AddressSegmentMap

Class Overview

Segment-map specialized to handle memory addresses, up to 64-bit. The addresses are represented as longs, and should be interpreted as unsigned.

Caveat: for 64-bit spaces, the theoretically addressable byte (address 0xFFFF_FFFF_FFFF_FFFF) is not accessible. Therefore, a segment such as (base=0xFFFF_FFFF_FFFF_FFF0,size=0x10) is attempting to insert it into the map will throw an exception. The following segment would be valid: (base=0xFFFF_FFFF_FFFF_FFF0,size=0xF)

Thread safety: partially concurrent (refer to SegmentMap)

Summary

[Expand] Inherited Methods
From class com.pnfsoftware.jeb.util.collect.SegmentMap V add(V v) Add a segment to the map. V addAndMerge(V v, BiFunction<Couple<K, K>, List<V>, V> merge) Adds a segment to the map and merge all the values within the overlap. int compareKeys(K a, K b) Compare two keys using the map's actual comparator. SortedMap<K, V> contiguousSubMap(K begin, K end, ISegmentFactory<K, V> factory) Get a map containing all the segments in the ranges, without any gap. boolean equals(Object obj) List<V> fillGaps(K begin, K end, ISegmentFactory<K, V> factory) Create segments to fill in the gaps in the provided range of addresses. List<V> generateGapItems(K begin, boolean allowHeader, K end, boolean allowTrailer, ISegmentFactory<K, V> factory, boolean addItemsToMap) Create segments to fill in the gaps in the provided range of addresses. List<Couple<K, K>> generateGaps(K begin, boolean allowHeader, K end, boolean allowTrailer, ISegmentGapVerifier<K> verifier) Generate a list of segments that correspond to the ordered gaps list of this map. List<Couple<K, K>> generateGaps(K begin, boolean allowHeader, K end, boolean allowTrailer) Generate a list of segments that correspond to the ordered gaps list of this map. SortedMap<K, V> getOverlappingSegmentsMap(K begin, boolean includeFirstPartialSegment, K end, boolean includeLastPartialSegment) Get all segments partially or fully present in the given range. V getSegmentAfter(K key) Get the closest segment after the provided address, which does not contain it. V getSegmentBefore(K key) Get the closest segment before the provided address, which does not contain it. V getSegmentContaining(K key) Get the segment containing the provided address. int hashCode() boolean isEmptyRange(K begin, K end) Determine is the provided range is unencumbered. boolean isRemoveSegmentsOnOverlap() Get the map behavior when the insertion of a segment would overlap existing segments. boolean isValidKey(K k) Validate whether or not the provided key is valid. boolean isValidSegment(V v) Validate whether or not the provided key is valid. V put(K k, V v) void putAll(Map<? extends K, ? extends V> m) void setRemoveSegmentsOnOverlap(boolean removeSegmentsOnOverlap) Set the map behavior when the insertion of a segment would overlap existing segments. ConcurrentNavigableMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) String toString()
From class java.util.concurrent.ConcurrentSkipListMap Entry<K, V> ceilingEntry(K arg0) K ceilingKey(K arg0) void clear() Object clone() Comparator<? super K> comparator() V compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1) V computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1) V computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1) boolean containsKey(Object arg0) boolean containsValue(Object arg0) NavigableSet<K> descendingKeySet() NavigableMap descendingMap() Set<Entry<K, V>> entrySet() boolean equals(Object arg0) Entry<K, V> firstEntry() K firstKey() Entry<K, V> floorEntry(K arg0) K floorKey(K arg0) void forEach(BiConsumer<? super K, ? super V> arg0) V get(Object arg0) V getOrDefault(Object arg0, V arg1) ConcurrentNavigableMap<K, V> headMap(K arg0) SortedMap headMap(Object arg0) ConcurrentNavigableMap<K, V> headMap(K arg0, boolean arg1) NavigableMap headMap(Object arg0, boolean arg1) Entry<K, V> higherEntry(K arg0) K higherKey(K arg0) boolean isEmpty() Set keySet() Entry<K, V> lastEntry() K lastKey() Entry<K, V> lowerEntry(K arg0) K lowerKey(K arg0) V merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2) NavigableSet<K> navigableKeySet() Entry<K, V> pollFirstEntry() Entry<K, V> pollLastEntry() V put(K arg0, V arg1) V putIfAbsent(K arg0, V arg1) V remove(Object arg0) boolean remove(Object arg0, Object arg1) boolean replace(K arg0, V arg1, V arg2) V replace(K arg0, V arg1) void replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0) int size() ConcurrentNavigableMap<K, V> subMap(K arg0, boolean arg1, K arg2, boolean arg3) ConcurrentNavigableMap<K, V> subMap(K arg0, K arg1) NavigableMap subMap(Object arg0, boolean arg1, Object arg2, boolean arg3) SortedMap subMap(Object arg0, Object arg1) SortedMap tailMap(Object arg0) NavigableMap tailMap(Object arg0, boolean arg1) ConcurrentNavigableMap<K, V> tailMap(K arg0, boolean arg1) ConcurrentNavigableMap<K, V> tailMap(K arg0) Collection<V> values()
From class java.util.AbstractMap void clear() Object clone() boolean containsKey(Object arg0) boolean containsValue(Object arg0) abstract Set<Entry<K, V>> entrySet() boolean equals(Object arg0) V get(Object arg0) int hashCode() boolean isEmpty() Set<K> keySet() V put(K arg0, V arg1) void putAll(Map<? extends K, ? extends V> arg0) V remove(Object arg0) int size() String toString() Collection<V> values()
From class java.lang.Object Object clone() boolean equals(Object arg0) void finalize() final Class<?> getClass() int hashCode() final void notify() final void notifyAll() String toString() final void wait(long arg0, int arg1) final void wait(long arg0) final void wait()
From interface com.pnfsoftware.jeb.util.collect.ISegmentMap abstract V add(V segment) Add a segment to the map. abstract V addAndMerge(V v, BiFunction<Couple<K, K>, List<V>, V> merge) Adds a segment to the map and merge all the values within the overlap. abstract SortedMap<K, V> contiguousSubMap(K begin, K end, ISegmentFactory<K, V> factory) Get a map containing all the segments in the ranges, without any gap. abstract List<V> fillGaps(K begin, K end, ISegmentFactory<K, V> factory) Create segments to fill in the gaps in the provided range of addresses. abstract List<V> generateGapItems(K begin, boolean allowHeader, K end, boolean allowTrailer, ISegmentFactory<K, V> factory, boolean addItemsToMap) Create segments to fill in the gaps in the provided range of addresses. abstract List<Couple<K, K>> generateGaps(K begin, boolean allowHeader, K end, boolean allowTrailer, ISegmentGapVerifier<K> verifier) Generate a list of segments that correspond to the ordered gaps list of this map. abstract List<Couple<K, K>> generateGaps(K begin, boolean allowHeader, K end, boolean allowTrailer) Generate a list of segments that correspond to the ordered gaps list of this map. abstract SortedMap<K, V> getOverlappingSegmentsMap(K begin, boolean includeFirstPartialSegment, K end, boolean includeLastPartialSegment) Get all segments partially or fully present in the given range. abstract V getSegmentAfter(K key) Get the closest segment after the provided address, which does not contain it. abstract V getSegmentBefore(K key) Get the closest segment before the provided address, which does not contain it. abstract V getSegmentContaining(K key) Get the segment containing the provided address. abstract boolean isEmptyRange(K begin, K end) Determine is the provided range is unencumbered. abstract V put(K key, V segment) Add a segment to the map. abstract void putAll(Map<? extends K, ? extends V> m) Add multiple segments to the map.
From interface java.util.Map abstract void clear() abstract V compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1) abstract V computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1) abstract V computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1) abstract boolean containsKey(Object arg0) abstract boolean containsValue(Object arg0) abstract static <K, V> Map<K, V> copyOf(Map<? extends K, ? extends V> arg0) abstract static <K, V> Entry<K, V> entry(K arg0, V arg1) abstract Set<Entry<K, V>> entrySet() abstract boolean equals(Object arg0) abstract void forEach(BiConsumer<? super K, ? super V> arg0) abstract V get(Object arg0) abstract V getOrDefault(Object arg0, V arg1) abstract int hashCode() abstract boolean isEmpty() abstract Set<K> keySet() abstract V merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2) abstract static <K, V> Map<K, V> of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9) abstract static <K, V> Map<K, V> of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7) abstract static <K, V> Map<K, V> of(K arg0, V arg1) abstract static <K, V> Map<K, V> of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11, K arg12, V arg13, K arg14, V arg15) abstract static <K, V> Map<K, V> of(K arg0, V arg1, K arg2, V arg3) abstract static <K, V> Map<K, V> of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5) abstract static <K, V> Map<K, V> of() abstract static <K, V> Map<K, V> of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11, K arg12, V arg13, K arg14, V arg15, K arg16, V arg17) abstract static <K, V> Map<K, V> of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11) abstract static <K, V> Map<K, V> of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11, K arg12, V arg13) abstract static <K, V> Map<K, V> of(K arg0, V arg1, K arg2, V arg3, K arg4, V arg5, K arg6, V arg7, K arg8, V arg9, K arg10, V arg11, K arg12, V arg13, K arg14, V arg15, K arg16, V arg17, K arg18, V arg19) abstract static <K, V> Map<K, V> ofEntries(Entry...<? extends K, ? extends V> arg0) abstract V put(K arg0, V arg1) abstract void putAll(Map<? extends K, ? extends V> arg0) abstract V putIfAbsent(K arg0, V arg1) abstract boolean remove(Object arg0, Object arg1) abstract V remove(Object arg0) abstract boolean replace(K arg0, V arg1, V arg2) abstract V replace(K arg0, V arg1) abstract void replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0) abstract int size() abstract Collection<V> values()
From interface java.util.NavigableMap abstract Entry<K, V> ceilingEntry(K arg0) abstract K ceilingKey(K arg0) abstract NavigableSet<K> descendingKeySet() abstract NavigableMap<K, V> descendingMap() abstract Entry<K, V> firstEntry() abstract Entry<K, V> floorEntry(K arg0) abstract K floorKey(K arg0) abstract SortedMap<K, V> headMap(K arg0) abstract NavigableMap<K, V> headMap(K arg0, boolean arg1) abstract Entry<K, V> higherEntry(K arg0) abstract K higherKey(K arg0) abstract Entry<K, V> lastEntry() abstract Entry<K, V> lowerEntry(K arg0) abstract K lowerKey(K arg0) abstract NavigableSet<K> navigableKeySet() abstract Entry<K, V> pollFirstEntry() abstract Entry<K, V> pollLastEntry() abstract SortedMap<K, V> subMap(K arg0, K arg1) abstract NavigableMap<K, V> subMap(K arg0, boolean arg1, K arg2, boolean arg3) abstract NavigableMap<K, V> tailMap(K arg0, boolean arg1) abstract SortedMap<K, V> tailMap(K arg0)
From interface java.util.SortedMap abstract Comparator<? super K> comparator() abstract Set<Entry<K, V>> entrySet() abstract K firstKey() abstract SortedMap<K, V> headMap(K arg0) abstract Set<K> keySet() abstract K lastKey() abstract SortedMap<K, V> subMap(K arg0, K arg1) abstract SortedMap<K, V> tailMap(K arg0) abstract Collection<V> values()
From interface java.util.concurrent.ConcurrentMap abstract V compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1) abstract V computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1) abstract V computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1) abstract void forEach(BiConsumer<? super K, ? super V> arg0) abstract V getOrDefault(Object arg0, V arg1) abstract V merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2) abstract V putIfAbsent(K arg0, V arg1) abstract boolean remove(Object arg0, Object arg1) abstract boolean replace(K arg0, V arg1, V arg2) abstract V replace(K arg0, V arg1) abstract void replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0)
From interface java.util.concurrent.ConcurrentNavigableMap abstract NavigableSet<K> descendingKeySet() abstract NavigableMap descendingMap() abstract ConcurrentNavigableMap<K, V> headMap(K arg0) abstract ConcurrentNavigableMap<K, V> headMap(K arg0, boolean arg1) abstract NavigableMap headMap(Object arg0, boolean arg1) abstract SortedMap headMap(Object arg0) abstract Set keySet() abstract NavigableSet<K> navigableKeySet() abstract SortedMap subMap(Object arg0, Object arg1) abstract ConcurrentNavigableMap<K, V> subMap(K arg0, K arg1) abstract ConcurrentNavigableMap<K, V> subMap(K arg0, boolean arg1, K arg2, boolean arg3) abstract NavigableMap subMap(Object arg0, boolean arg1, Object arg2, boolean arg3) abstract ConcurrentNavigableMap<K, V> tailMap(K arg0, boolean arg1) abstract NavigableMap tailMap(Object arg0, boolean arg1) abstract SortedMap tailMap(Object arg0) abstract ConcurrentNavigableMap<K, V> tailMap(K arg0)