LinkedHashSet=Linked + Hash +Set
In linkedHashSet are the elements stored according to the insertion order or according to the hash value. If the elements are stored according to the insertion order then why is it not named as LinkedSet instead of LinkedHashSet? Why is the word hash used in LinkedHashSet?
What is the difference between HashSet, TreeSet and LinkedHashSet?.One difference between HashSet and TreeSet is that TreeSet is sorted, whereas HashSet is not sorted. I dont know the other differences
View Replies View RelatedI have built a binary tree, from a file. In each node, I am storing each word as a string, and an int frequency for each time the word occurs. For the assignment, I need to find how many words occur only once in the file. I wrote the program, but for some reason I am getting a number different from what my professor is expecting.
As far as I know, this file has loaded into the tree correctly, because all of my other answers in the assignment are correct. What am I doing wrong?
public void findUnique() {
System.out.println("There are " + findUniqueWords(root, 0) + " unique words.");
}
private int findUniqueWords(Node subTree, int uniqueCount) {
// Base Case: At the end of the branch
if(subTree == null){
return uniqueCount;
[Code] ....
The intentions of this program is to prompt a user to enter a file name, and then reads the file. The program will prompt the user to enter a word that needs to be corrected. So lets say I have a text file containing "My name is OP and I Like goind to the Park!" I want to change "goind" to "going",
Now, my second method "isSimilar" executes a similar word with more than one same letter and same length, but I dont know how to execute that whole thing in my third method "correctThisLine" . How I can call that isSimilar method and read in that text file and change that word into that?
import java.util.*;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class WahidMuhammadA3Q2{
String fileName = "AutoCorrectMe.txt";
public static void main (String [] args){
[Code] ....
I am looking for java codes to generate a word document based on a word template, basically, I have a word template created and in my local path, the template has a proper format with some fields which will be filled in after java codes ran. The java codes will fetch one record from a table, and open the word template and then fill the fields in the word template, and created a new word document and save it in another folder.
I found this example: [URL] which is similar except it uses xml template instead of word template, how to make it work to change the template from xml to word (docx) template?
I am trying to create a class (DVD) with an instance variable that references a map, the constructor for this class must create an empty map and assign it to the instance variable map. I want to populate this map with instances of a different class called tv series, I am using blueJ, I am not sure why this doesn't work
Java Code:
import java.util.*;
public class DVD
{
public static Map<String, TvSeries>DVD;
public TvSeries program;
[Code] .....
Here's My Code.
package bin;
import java.util.Scanner;
public class AppletMain{
public static void main(String[] args){
Scanner oneinput = new Scanner(System.in);
String one;
[Code] ....
I am trying to get it to compare the word I type in to the set word in the object 'secretword'. I have tried everything from equal to == to compareTo, I even created a two hundred line program to do this SIMPLE problem.
import java.io.*;
import java.util.Random;
import java.util.Scanner;
public class WordGame
{
public static void main(String[] args) throws IOException
{
final int RANDOM_LETTERS_COUNT = 10;
final int TRIALS = 10;
int score = 0;
[Code] ....
what is mean by hash code??
View Replies View RelatedI want to generate a Hash key for a [ Nested Hierarchical nodes]. Any lightweight non-cryptographic hash map functions which generate a key, so that I can use this hashkey to comparison purposes.
NOTE: Security is not a concern for me, I just want to create a Unique ID.
I am trying to add two strings to a hash map. the first being the key, a 3 digit code that can have duplicates, and the value to store in an ArrayList. From what I've read, when add a key to the hashmap that is a duplicate, the previous gets overwritten and that is why I am trying to put the values in an array list. I was hoping that when the key is looked up, it would print all the values associated with that key:
class library{
HashMap<String, ArrayList<String>> checkoutBooks =
new HashMap<String, ArrayList<String>>() ;
ArrayList<String> patName = new ArrayList<String>() ;
public void checkoutBook(String isbn, String patron) {
patName.add(patron) ;
[Code]...
So when I try to add values such as:
library.checkoutBook("000", "test 1");
library.checkoutBook("000", "test 2");
library.checkoutBook("001", "test 3");
library.checkoutBook("001", "test 4");
library.checkoutBook("002", "test 5");
library.checkoutBook("002", "test 6");
[Code]...
I am implementing the hash join algorithm for a project with a hard coded hash function. I've hashed the first relation and I've hashed the second relation. The problem is when hashing the second relation I only know how to add the tuple from the second relation into a third relation and not also access the first relation tuple at that time
The "hashtable" structure contains the hashcode of my key as well as the tuple stored in a string. This code below is taking place in the hashing of the second table, my function determines that both these tuples share the same hash code based on the first element in the tuple (element 0) so I add the tuple from my second relation to the qRelation but I also want to add the tuple from the hashtable at that point and I don't know how to access that string
if(hashtable.containsKey(tuple/*(RELATIONA)*/.get(0).hashCode()))
{
//Add the tuple from relation A into qRelation wich matches the
//above condition
qRelation.addAll(tuple/*(RELATIONB)*/);
}
I need a Example of a Hash Mapping Algorithm in Java. This Mapping Needs to do the following:
Map an Array of Strings, to integer values which correspond to each fruit
private String[] Fruit = {"Apple","Orange","Pear","Grapes"};
Apple: 1 + 1
---------------
Orange: 1+ 2
---------------
Pear: 1 + 3
---------------
Grapes: 1 + 4
---------------
I not sure where to start at the Moment...
I have to write a resize method so that when my Bucket gets to a certain point, then it resizes the bucket when it is called. What is happening is, I am getting strange results when I run the method. My mean bucket length should be at 2.5 for the last insertion, but I am getting something like 0.1346. Here is my dictionary class
// The "Dictionary" class.
// The Dictionary class implemented using hashing. Hash buckets are used. A dictionary contains a set of data elements with corresponding keys. Each element is inserted into the dictionary with a key. Later the key can be used to look up the element. Using the key, an element can be changed or it can be deleted from the dictionary. There is also an operation for checking to see if the dictionary is empty.
package dictionary;
public class Dictionary {
protected final static int MAX_BUCKETS = 1000; // number of buckets
protected DictHashEntry[] buckets; // the bucket array
private int collisionCount = 0;
[Code] .....
I have a drop-down which contains the four sections simple buttons(filters). When click any of these buttons some settings are applied. I have successfully auotmated it using simple if else and switch but in that case i have to use 8 parameters(8 are the number of button)
public void editFilters(WebElement filter1, WebElement filter2, WebElement filter3, WebElement filter4,WebElement filter5,WebElement filter6,WebElement filter7,WebElement filter8 String edit, String expectedColour) {
switch (edit) {
case "selectFilter":
if (filter1 != null) {
[Code] .....
But want to make it more effective by using hashes. I do not want to use 8 different parameters to perform action on the respective button.
So now what i want to implement.
Create a method in which i pass the parameter1 as hash and 2nd parameter as 0 or 1, 0 means unSelectFilter and 1 means select the filter.
With parameter 1, in code i want to pass the name or xpath or anything else for any number of filters , that those filters names should be stored into that hash and then by passing 0 or 1, i can select/unselect those filters.
I am trying to use this program for reference but its not working ...
View Replies View RelatedSo I am supposed to be changing infix notation to postfix notation using stacks. This is simply taking a string "3 + 5 * 6" (infix) and turning it into (3 5 6 * +" (postfix).
To do this, we are to scan the string from left to right and when we encounter a number, we just add it to the final string, but when we encounter an operand, we throw it on the stack. Then if the next operand has a higher input precedence than the stack precedence of the operator on the top of the stack, we add that operator to the stack too, otherwise we pop from the stack THEN add the new operator.
I am supposed to be utilizing a hash map but I don't see how you would go about doing this. We are supposed to store operators on the hash map but operators need their own character, input precedence, stack precedence, and rank. How do you use a hash map when you need to tie a character to 3 values instead of just 1? I just don't get it.
The following is our Operator class that we are to use. Another problem is this isn't really supposed to be modified, yet we were given two important variables (inputPrecedence and outputPrecedence) that we can't have nothing to be initialized to and no way of accessing? So that might be where a hash map comes in but I am not sure. I am not very sure on how they exactly work anyway...
public class Operator implements Comparable<Operator>
{
public char operator; // operator
privateint inputPrecedence; // input precedence of operator in the range [0, 5]
privateint stackPrecedence; // stack precedence of operator in the range [-1, 3]
[Code] ....
So my question mostly revolves around how I tie an Operator character to its required values, so I can use it in my code to test two operators precedence values.
My original thought was turn string into character array, but then I would need nested for/while loops to check if it is a number or letter, or if it is an operator and thus result in O(n^2) time
i have completed a code in java so that it can read spaces in a line but when i run it if i put Line 1 test test for example it will print : [ 3] spaces in Line1 test test what i want to print is [ 3] spaces in "Line1 test test" so the diferences is at " Is there any possible thing that i can do?
class Main
{
public static void main( String args[] )
{
System.out.print( "#Enter text : " );
String text = BIO.getString();
while ( ! text.equals( "END" ) )
{
[Code]...
i want to swap the word. how could i be able to swap..
for example:-
I/P:-
i want to be a java developer
O/P:-
developer a be to java want
means swap first and last word and all alternate word.
Okay, so the assignment was creating a word search for the given array. I've created all the code necessary, but I've ran into trouble. This problem occurs with the Up-Forward, Up-Backward, Down-Forward, and Down-Backward sections. If I only set one of these to run, it works. But if I have all 4 set at the same time, it errors out on the first one that runs.
public class P_WordSearch {
public static void main(String[] args) {
char[][] puzzle = {
{'B','O','O','G','S','R','O','W','I','N','G'},
{'E','B','L','G','N','I','M','M','I','W','S'},
{'L','C','E','A','T','I','P','U','P','I','S'},
{'C','M','I','N','C','A','X','Y','O','S','N'},
[Code] ....
I'm trying to use regex to find a word containing the substring "cat." I'm not sure why this isn't working?
String match = "^ cat$";
So the exercise I'm working on says to have the user enter their name and the program will output their name with the last name in all caps. i made it work BUT the only way i could figure it out was to ask for the first and last names separately creating two strings rather than one.
Of course I want to make it work how it's supposed to (with one string) so that I'm learning. I'm just having trouble conceptualizing how exactly (with varying lengths of names) to tell the program to only capitalize the second word... at first I thought create a substring beginning with the first letter of the last name and ending with the last...but again, therein lies the issue of varying name lengths.
is there a way to create a substring that beginIndex's at the first "space"? then i could just leave the endIndex parameter empty and it would take the whole word into a new string. and from there utilize toUpperCase to the new string?
Here's my code asking for the first and last names separately.
import java.util.Scanner;
class nameEcho {
public static void main ( String [] args ) {
Scanner scan = new Scanner( System.in );
String first;
String last;
[Code] .....
How to delete word "kumar" from sentence
import java.util.*;
class kumar
{
public static void main(String args[]) {
Scanner in=new Scanner(System.in);
System.out.println("Enter a sentence");
String s=in.nextLine();
s=s=" ";
[Code] ....
I do not get any output nor any error....
I was tasked with building a program that, when is given a string by the user, takes it and prints it out as a rectangle. For example, if the user types in "COMPUTER", the output would be:
COMPUTER
OMPUTERC
MPUTERCO
PUTERCOM
UTERCOMP
TERCOMPU
ERCOMPUT
RCOMPUTE
So far, I have created 2 separate strings, and have gotten the output to look like:
COMPUTER
OMPUTERC
OMPUTERO
OMPUTERO
OMPUTERO
OMPUTERO
OMPUTERO
OMPUTERO
OMPUTERO
So, it works once, but then it doesn't work again. Here is my code:
i was tasked with building a program that, when is given a string by the user, takes it and prints it out as a rectangle. For example, if the user types in "COMPUTER", the output would be:
COMPUTER
OMPUTERC
MPUTERCO
PUTERCOM
UTERCOMP
TERCOMPU
ERCOMPUT
RCOMPUTE
So far, I have created 2 separate strings, and have gotten the output to look like:
COMPUTER
OMPUTERC
OMPUTERO
OMPUTERO
OMPUTERO
OMPUTERO
OMPUTERO
OMPUTERO
OMPUTERO
So, it works once, but then it doesn't work again. Here is my code:
import java.util.Scanner;
public class WordRectangle {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
Scanner userInput = new Scanner (System.in);
[code]....
I want to write a program to convert word document into excel output..
Is any API available?..
I'm very new to Java, and I'm writing a code to search a string to see how many times the word "dog" is found in it. I'm not sure if this is error-free or the most efficient, but I'd like to keep it simple.
public void run()
{
String input = new String("The Dogman was no ordinary dog, nor man, but rather a peculiar dog-like man who barked like a dog, and panted like a dog, he even ate like a dog. He owned a dog named Doglips, and interestingly enough, his favorite food was hotdogs.");
println(input);
int index = -1;
int count = 0;
print("Counting dogs:");
inputarray = input.split(" ");
[Code] .....