Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 7 years ago.
Improve this question
What advantage is there in keeping the Set unordered?
Is it more efficient in space/time?
In what way is a random order easier to manage than insertion order?
Elements in a HashSet are ordered (dispersed in the Javadoc) by the Object.hashCode(). You can use a LinkedHashSet if you need a Set that preserves insertion order.
Related
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 2 years ago.
Improve this question
Which data structures should I use to implement a trie in Java?
Do I use a linked list, array, map?
The way I implemented a Trie was to use a custom class for the node and store outgoing links as either a HashMap or ArrayList (depending on the number of child nodes).
The reason to split the two cases was that many of the nodes would have just a few child nodes and using a Map would actually slow things down. If I recall correctly I put the limit at about 4 child nodes.
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 3 years ago.
Improve this question
I am writing a simple OpcUa client using milo and want to use multi-dimensional arrays as values.
Do I have to create an ExtensionObject to decode my matrix or is there an attribute to store the dimensions in? And if there is such an attribute, how can I access it?
Thanks
Chris
I oversaw the VariableNode.getArrayDimensions() and VariableNode.setArrayDimensions() methods.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 3 years ago.
Improve this question
I have a Map<Type, Data>
We need to convert the keySet of the map to a LinkedHashSet of String.
What is the most efficient way to do it using java 8 stream.
map.keySet().stream().map(Object::toString).collect(toCollection(LinkedHashSet::new));
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
how internal Implementation of TreeMap is done in Java? Does it use any tree (like : binary tree, red-black, B-tree) for arranging elements?
First line of the documentation:
A Red-Black tree based NavigableMap implementation.
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 7 years ago.
Improve this question
I'm thinking on possibility of making a Huffman code without "node".
It's based on the nodes then my question seems a bit ambiguous.
I know,maybe we have to use string's abilites ...
Is it possible ? and if "YES" how Is it possible in java?
Thanks.
You can use indices instead of nodes but you need somewhere nodes and/or vertices.