Cart (0)Free Online Dictionary
TreeMap
| Wikipedia English The Free Encyclopedia |  Download this dictionary |
Treemapping
In information visualization and computing, treemapping is a method for displaying hierarchical data by using nested rectangles.
| See more at Wikipedia.org... |
© This article uses material from Wikipedia® and is licensed under the GNU Free Documentation License and under the Creative Commons Attribution-ShareAlike License
| Wikipedia Deutsch Die freie Enzyklopädie | Download this dictionary |
Tree Map
Eine Tree Map dient der Visualisierung hierarchischer Strukturen, die hierbei durch ineinander verschachtelte Rechtecke dargestellt werden. Damit können anschaulich Größenverhältnisse dargestellt werden, indem die Fläche der Rechtecke proportional zur Größe der darzustellenden Dateneinheit gewählt wird.
| Mehr unter Wikipedia.org... |
© Dieser Eintrag beinhaltet Material aus Wikipedia und ist lizensiert auf GNU-Lizenz für freie Dokumentation
| Wikipédia Français | Download this dictionary |
Treemapping
Le treemapping est une technique de représentation de données hiérarchiques dans un espace limité, comme par exemple l'écran d'un ordinateur.
| Pour la suite, voir Wikipédia.org… |
© Cet article se sert du contenu de Wikipédia® et est autorisé sous les termes de la Licence de Documentation libre GNU
| JDK Doc(JAVA) | Download this dictionary |
TreeMap
- class java.util..TreeMap
public class TreeMap extends AbstractMap implements SortedMap , Cloneable , Serializable
Tree:java.lang.Object - java.util.AbstractMap - java.util.TreeMap
Red-Black tree based implementation of the interface. This class guarantees that the map will be in ascending key order, sorted according to the for the key's class (see ), or by the comparator provided at creation time, depending on which constructor is used.
public class TreeMap extends AbstractMap implements SortedMap , Cloneable , Serializable
Tree:java.lang.Object - java.util.AbstractMap - java.util.TreeMap
Red-Black tree based implementation of the interface. This class guarantees that the map will be in ascending key order, sorted according to the for the key's class (see ), or by the comparator provided at creation time, depending on which constructor is used.
TreeMap()
- Constructor for class java.util.TreeMap
public TreeMap ()
Constructs a new, empty map, sorted according to the keys' natural order. All keys inserted into the map must implement the Comparable interface. Furthermore, all such keys must be mutually comparable: k1.compareTo(k2) must not throw a ClassCastException for any elements k1 and k2 in the map. If the user attempts to put a key into the map that violates this constraint (for example, the user attempts to put a string key into a map whose keys are integers), the put(Object key, Object value) call will throw a ClassCastException.See Also: Comparable
public TreeMap ()
Constructs a new, empty map, sorted according to the keys' natural order. All keys inserted into the map must implement the Comparable interface. Furthermore, all such keys must be mutually comparable: k1.compareTo(k2) must not throw a ClassCastException for any elements k1 and k2 in the map. If the user attempts to put a key into the map that violates this constraint (for example, the user attempts to put a string key into a map whose keys are integers), the put(Object key, Object value) call will throw a ClassCastException.See Also: Comparable
TreeMap(Comparator)
- Constructor for class java.util.TreeMap
public TreeMap (Comparator c)
Constructs a new, empty map, sorted according to the given comparator. All keys inserted into the map must be mutually comparable by the given comparator: comparator.compare(k1, k2) must not throw a ClassCastException for any keys k1 and k2 in the map. If the user attempts to put a key into the map that violates this constraint, the put(Object key, Object value) call will throw a ClassCastException.
public TreeMap (Comparator c)
Constructs a new, empty map, sorted according to the given comparator. All keys inserted into the map must be mutually comparable by the given comparator: comparator.compare(k1, k2) must not throw a ClassCastException for any keys k1 and k2 in the map. If the user attempts to put a key into the map that violates this constraint, the put(Object key, Object value) call will throw a ClassCastException.
TreeMap(Map)
- Constructor for class java.util.TreeMap
public TreeMap (Map m)
Constructs a new map containing the same mappings as the given map, sorted according to the keys' natural order. All keys inserted into the new map must implement the Comparable interface. Furthermore, all such keys must be mutually comparable: k1.compareTo(k2) must not throw a ClassCastException for any elements k1 and k2 in the map. This method runs in n*log(n) time.Throws: ClassCastException - the keys in t are not Comparable, or are not mutually comparable.
public TreeMap (Map m)
Constructs a new map containing the same mappings as the given map, sorted according to the keys' natural order. All keys inserted into the new map must implement the Comparable interface. Furthermore, all such keys must be mutually comparable: k1.compareTo(k2) must not throw a ClassCastException for any elements k1 and k2 in the map. This method runs in n*log(n) time.Throws: ClassCastException - the keys in t are not Comparable, or are not mutually comparable.
TreeMap(SortedMap)
- Constructor for class java.util.TreeMap
public TreeMap (SortedMap m)
Constructs a new map containing the same mappings as the given SortedMap, sorted according to the same ordering. This method runs in linear time.
public TreeMap (SortedMap m)
Constructs a new map containing the same mappings as the given SortedMap, sorted according to the same ordering. This method runs in linear time.
| TreeMap in English | TreeMap in French | TreeMap in German
You think you have ethics...
Take the survey NOW!