| /external/guava/guava-tests/test/com/google/common/collect/ |
| TreeRangeMapTest.java | 60 RangeMap<Integer, String> rangeMap = TreeRangeMap.create();
64 rangeMap.put(entry.getKey(), entry.getValue());
66 return rangeMap.asMapOfRanges();
115 RangeMap<Integer, String> rangeMap = TreeRangeMap.create();
119 rangeMap.put(entry.getKey(), entry.getValue());
121 return rangeMap.subRangeMap(Range.atMost(22)).asMapOfRanges();
192 RangeMap<Integer, Integer> rangeMap = TreeRangeMap.create()
[all...] |
| ImmutableRangeMapTest.java | 104 ImmutableRangeMap<Integer, Integer> rangeMap =
115 assertEquals(expectedValue, rangeMap.get(i));
132 RangeMap<Integer, Integer> rangemap = local
134 assertEquals(range, rangemap.span());
142 RangeMap<Integer, Integer> rangemap = local
144 assertEquals(range1.span(range2), rangemap.span());
154 ImmutableRangeMap<Integer, Integer> rangeMap =
165 assertEquals(expectedEntry, rangeMap.getEntry(i))
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableRangeMap.java | 33 * An immutable implementation of {@code RangeMap}, supporting all query operations efficiently.
35 * <p>Like all {@code RangeMap} implementations, this supports neither null keys nor null values.
42 public class ImmutableRangeMap<K extends Comparable<?>, V> implements RangeMap<K, V> {
66 RangeMap<K, ? extends V> rangeMap) {
67 if (rangeMap instanceof ImmutableRangeMap) {
68 return (ImmutableRangeMap<K, V>) rangeMap;
70 Map<Range<K>, ? extends V> map = rangeMap.asMapOfRanges();
92 private final RangeMap<K, V> rangeMap;
[all...] |
| TreeRangeMap.java | 45 * An implementation of {@code RangeMap} based on a {@code TreeMap}, supporting
48 * <p>Like all {@code RangeMap} implementations, this supports neither null
56 public final class TreeRangeMap<K extends Comparable, V> implements RangeMap<K, V> {
134 public void putAll(RangeMap<K, V> rangeMap) {
135 for (Map.Entry<Range<K>, V> entry : rangeMap.asMapOfRanges().entrySet()) {
249 public RangeMap<K, V> subRangeMap(Range<K> subRange) {
258 private RangeMap<K, V> emptySubRangeMap() {
262 private static final RangeMap EMPTY_SUB_RANGE_MAP =
263 new RangeMap() {
[all...] |
| RangeMap.java | 36 public interface RangeMap<K extends Comparable, V> {
56 * in this {@code RangeMap}.
74 * Puts all the associations from {@code rangeMap} into this range map (optional operation).
76 void putAll(RangeMap<K, V> rangeMap);
103 * <p>For example, if {@code rangeMap} had the entries
105 * then {@code rangeMap.subRangeMap(Range.open(3, 12))} would return a range map
114 RangeMap<K, V> subRangeMap(Range<K> range);
117 * Returns {@code true} if {@code obj} is another {@code RangeMap} that has an equivalent
|
| /external/valgrind/coregrind/ |
| m_rangemap.c | 59 static void preen (/*MOD*/RangeMap* rm);
60 static Word find ( const RangeMap* rm, UWord key );
61 static void split_at ( /*MOD*/RangeMap* rm, UWord key );
62 static void show ( const RangeMap* rm );
65 RangeMap* VG_(newRangeMap) ( Alloc_Fn_t alloc_fn,
73 RangeMap* rm = alloc_fn(cc, sizeof(RangeMap));
90 void VG_(deleteRangeMap) ( RangeMap* rm )
99 void VG_(bindRangeMap) ( RangeMap* rm,
117 /*OUT*/UWord* val, const RangeMap* rm, UWord key
[all...] |
| /external/valgrind/include/ |
| pub_tool_rangemap.h | 43 typedef struct _RangeMap RangeMap;
45 /* Create a new RangeMap, using given allocation and free functions.
50 RangeMap* VG_(newRangeMap) ( Alloc_Fn_t alloc_fn,
55 /* Free all memory associated with a RangeMap. */
56 void VG_(deleteRangeMap) ( RangeMap* );
63 void VG_(bindRangeMap) ( RangeMap* rm,
67 the key bounds. Can never fail since the RangeMap covers the
71 /*OUT*/UWord* val, const RangeMap* rm, UWord key );
74 UInt VG_(sizeRangeMap) ( const RangeMap* rm );
78 /*OUT*/UWord* val, const RangeMap* rm, Word ix )
[all...] |
| /external/google-breakpad/src/processor/ |
| map_serializers.h | 31 // wrappers: AddressMap, RangeMap, and ContainedRangeMap.
107 // RangeMapSerializer allocates memory and serializes a RangeMap instance into a
113 size_t SizeOf(const RangeMap<Address, Entry> &m) const;
118 char* Write(const RangeMap<Address, Entry> &m, char* dest) const;
120 // Serializes a RangeMap object into a chunk of memory data.
124 char* Serialize(const RangeMap<Address, Entry> &m, unsigned int *size) const;
128 typedef typename RangeMap<Address, Entry>::Range Range;
130 // Serializer for RangeMap's key and Range::base_.
132 // Serializer for RangeMap::Range::entry_.
|
| range_map-inl.h | 50 bool RangeMap<AddressType, EntryType>::StoreRange(const AddressType &base,
118 bool RangeMap<AddressType, EntryType>::RetrieveRange(
121 BPLOG_IF(ERROR, !entry) << "RangeMap::RetrieveRange requires |entry|";
147 bool RangeMap<AddressType, EntryType>::RetrieveNearestRange(
150 BPLOG_IF(ERROR, !entry) << "RangeMap::RetrieveNearestRange requires |entry|";
178 bool RangeMap<AddressType, EntryType>::RetrieveRangeAtIndex(
181 BPLOG_IF(ERROR, !entry) << "RangeMap::RetrieveRangeAtIndex requires |entry|";
206 int RangeMap<AddressType, EntryType>::GetCount() const {
212 void RangeMap<AddressType, EntryType>::Clear() {
|
| basic_code_modules.cc | 50 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) {
78 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) {
117 // This class stores everything in a RangeMap, without any more-efficient
|
| static_range_map.h | 32 // StaticRangeMap is similar as RangeMap. However, StaticRangeMap wraps a
35 // RangeMap. Please see range_map.h for more documentation.
81 // Returns the number of ranges stored in the RangeMap.
|
| basic_source_line_resolver_types.h | 68 RangeMap< MemAddr, linked_ptr<Line> > lines;
145 RangeMap< MemAddr, linked_ptr<Function> > functions_;
163 // recovery rules. The RangeMap's itself gives the starting and ending
165 RangeMap<MemAddr, string> cfi_initial_rules_;
|
| range_map.h | 53 class RangeMap {
55 RangeMap() : map_() {}
90 // Returns the number of ranges stored in the RangeMap.
112 // be stored, because RangeMap uses it as the key to the map.
|
| basic_code_modules.h | 49 template<typename AddressType, typename EntryType> class RangeMap;
78 RangeMap<uint64_t, linked_ptr<const CodeModule> > *map_;
|
| range_map_unittest.cc | 30 // range_map_unittest.cc: Unit tests for RangeMap
49 using google_breakpad::RangeMap;
71 typedef RangeMap< AddressType, linked_ptr<CountedObject> > TestMap;
92 // sequence on the same RangeMap.
103 // test RangeMap. It returns true if the expected result occurred, and
125 // test RangeMap. If it retrieves the expected value (which can be no
412 // three stores because AddressType is signed for these tests, so RangeMap
471 // the RangeMap with data for the RetrieveRange test.
485 // stored in the RangeMap.
495 // The RangeMap's own count of objects should also match
[all...] |
| static_range_map_unittest.cc | 48 typedef google_breakpad::RangeMap< AddressType, EntryType > RMap;
67 // sequence on the same RangeMap.
121 // three stores because AddressType is signed for these tests, so RangeMap
174 // test RangeMap. It returns true if the expected result occurred, and
179 // test RangeMap. If it retrieves the expected value (which can be no
361 // the RangeMap with data for the RetrieveRange test.
376 // The RangeMap's own count of objects should also match.
|
| map_serializers-inl.h | 120 const RangeMap<Address, Entry> &m) const {
139 const RangeMap<Address, Entry> &m, char *dest) const {
170 const RangeMap<Address, Entry> &m, unsigned int *size) const {
|
| module_comparer.cc | 110 RangeMap<MemAddr, linked_ptr<BasicFunc> >::MapConstIterator iter1;
153 RangeMap<MemAddr, string>::MapConstIterator iter1;
200 RangeMap<MemAddr, linked_ptr<BasicLine> >::MapConstIterator iter1;
|
| fast_source_line_resolver_types.h | 171 // recovery rules. The RangeMap's itself gives the starting and ending
|
| /external/v8/src/profiler/ |
| allocation-tracker.cc | 124 ranges_.insert(RangeMap::value_type(end, new_range));
129 RangeMap::const_iterator it = ranges_.upper_bound(addr);
153 for (RangeMap::iterator it = ranges_.begin(); it != ranges_.end(); ++it) {
162 RangeMap::iterator it = ranges_.upper_bound(start);
167 RangeMap::iterator to_remove_begin = it;
184 ranges_.insert(RangeMap::value_type(start, prev_range));
|
| allocation-tracker.h | 89 typedef std::map<Address, RangeStack> RangeMap;
93 RangeMap ranges_;
|
| /external/smali/dexlib2/src/main/java/org/jf/dexlib2/ |
| Opcodes.java | 35 import com.google.common.collect.RangeMap;
101 RangeMap<Integer, Short> versionToValueMap;
|
| /system/extras/perfprofd/ |
| map_utils.h | 26 class RangeMap {
|
| perf_data_converter.cc | 60 RangeMap<std::string, uint64_t> symbols;
|
| /external/google-breakpad/src/google_breakpad/processor/ |
| minidump.h | 107 template<typename AddressType, typename EntryType> class RangeMap;
520 RangeMap<uint64_t, unsigned int> *range_map_;
575 RangeMap<uint64_t, unsigned int> *range_map_;
849 RangeMap<uint64_t, unsigned int> *range_map_;
[all...] |
