NodeMap (JunGrapht Visualization 1.1 API)

java.lang.Object
- java.util.AbstractMap<K,V>
- - java.util.HashMap<V,Rectangle2D>
  - - org.jungrapht.visualization.spatial.rtree.NodeMap<V>

All Implemented Interfaces:

Serializable, Cloneable, Map<V,Rectangle2D>, Bounded, BoundedMap<V>
```
public class NodeMap<V>
extends HashMap<V,Rectangle2D>
implements BoundedMap<V>, Bounded
```
A Map of elements to Rectangle2D where the union of the child elements is kept up to date with the values in the Map

Author:

Tom Nelson

See Also:

Serialized Form

Nested Class Summary
- Nested classes/interfaces inherited from class java.util.AbstractMap
  AbstractMap.SimpleEntry<K extends Object,V extends Object>, AbstractMap.SimpleImmutableEntry<K extends Object,V extends Object>
- Nested classes/interfaces inherited from interface java.util.Map
  Map.Entry<K extends Object,V extends Object>

Constructor Summary

Constructors
Constructor Description

NodeMap()

NodeMap(int initialCapacity)

NodeMap(Map<V,Rectangle2D> map)

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`void`	`clear()`
`Rectangle2D`	`getBounds()`	return the Rectangle of the bounding box
`void`	`put(Map.Entry<V,Rectangle2D> entry)`
`Rectangle2D`	`put(V n, Rectangle2D b)`
`void`	`recalculateBounds()`	iterate over all children and update the bounds Called after removing from the collection
`Rectangle2D`	`remove(Object o)`

Methods inherited from class java.util.HashMap
clone, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, forEach, get, getOrDefault, isEmpty, keySet, merge, putAll, putIfAbsent, remove, replace, replace, replaceAll, size, values

Methods inherited from class java.util.AbstractMap
equals, hashCode, toString

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, putAll, putIfAbsent, remove, replace, replace, replaceAll, size, values

- Constructor Detail
  - NodeMap
```
public NodeMap()
```
  - NodeMap
```
public NodeMap(int initialCapacity)
```
  - NodeMap
```
public NodeMap(Map<V,Rectangle2D> map)
```
- Method Detail
  - put
```
public void put(Map.Entry<V,Rectangle2D> entry)
```
  - put
```
public Rectangle2D put(V n,
                       Rectangle2D b)
```
    Specified by:
    
    put in interface Map<V,Rectangle2D>
    
    Overrides:
    
    put in class HashMap<V,Rectangle2D>
  - remove
```
public Rectangle2D remove(Object o)
```
    Specified by:
    
    remove in interface Map<V,Rectangle2D>
    
    Overrides:
    
    remove in class HashMap<V,Rectangle2D>
  - clear
```
public void clear()
```
    Specified by:
    
    clear in interface Map<V,Rectangle2D>
    
    Overrides:
    
    clear in class HashMap<V,Rectangle2D>
  - getBounds
```
public Rectangle2D getBounds()
```
    Description copied from interface: Bounded
    
    return the Rectangle of the bounding box
    
    Specified by:
    
    getBounds in interface Bounded
    
    Specified by:
    
    getBounds in interface BoundedMap<V>
    
    Returns:
    
    the rectangular bounds of the implementation
  - recalculateBounds
```
public void recalculateBounds()
```
    iterate over all children and update the bounds Called after removing from the collection
    
    Specified by:
    
    recalculateBounds in interface BoundedMap<V>