| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/arrays/ |
| H A D | DeletedRangeArrayFilter.java | 57 return lo <= longIndex && longIndex <= hi; in isDeleted()
134 if (longIndex < lo || longIndex > hi) { in set()
136 } else if (longIndex > lo && longIndex < hi) { in set()
139 if (longIndex == lo) { in set()
152 if (longIndex < lo || longIndex > hi) { in set()
154 } else if (longIndex > lo && longIndex < hi) { in set()
170 if (longIndex < lo || longIndex > hi) { in set()
172 } else if (longIndex > lo && longIndex < hi) { in set()
202 lo = longIndex; in delete()
204 hi = longIndex; in delete()
[all …]
|
| H A D | SparseArrayData.java | 177 final Long longIndex = indexToKey(index); in set() local
178 sparseMap.put(longIndex, value); in set()
179 setLength(Math.max(longIndex + 1, length())); in set()
192 final Long longIndex = indexToKey(index); in set() local
193 sparseMap.put(longIndex, value); in set()
194 setLength(Math.max(longIndex + 1, length())); in set()
206 final Long longIndex = indexToKey(index); in set() local
207 sparseMap.put(longIndex, value); in set()
208 setLength(Math.max(longIndex + 1, length())); in set()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/arrays/ |
| H A D | DeletedRangeArrayFilter.java | 57 return lo <= longIndex && longIndex <= hi; in isDeleted()
134 if (longIndex < lo || longIndex > hi) { in set()
136 } else if (longIndex > lo && longIndex < hi) { in set()
139 if (longIndex == lo) { in set()
152 if (longIndex < lo || longIndex > hi) { in set()
154 } else if (longIndex > lo && longIndex < hi) { in set()
170 if (longIndex < lo || longIndex > hi) { in set()
172 } else if (longIndex > lo && longIndex < hi) { in set()
202 lo = longIndex; in delete()
204 hi = longIndex; in delete()
[all …]
|
| H A D | SparseArrayData.java | 177 final Long longIndex = indexToKey(index); in set() local
178 sparseMap.put(longIndex, value); in set()
179 setLength(Math.max(longIndex + 1, length())); in set()
192 final Long longIndex = indexToKey(index); in set() local
193 sparseMap.put(longIndex, value); in set()
194 setLength(Math.max(longIndex + 1, length())); in set()
206 final Long longIndex = indexToKey(index); in set() local
207 sparseMap.put(longIndex, value); in set()
208 setLength(Math.max(longIndex + 1, length())); in set()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/arrays/ |
| H A D | DeletedRangeArrayFilter.java | 57 return lo <= longIndex && longIndex <= hi; in isDeleted()
134 if (longIndex < lo || longIndex > hi) { in set()
136 } else if (longIndex > lo && longIndex < hi) { in set()
139 if (longIndex == lo) { in set()
152 if (longIndex < lo || longIndex > hi) { in set()
154 } else if (longIndex > lo && longIndex < hi) { in set()
170 if (longIndex < lo || longIndex > hi) { in set()
172 } else if (longIndex > lo && longIndex < hi) { in set()
202 lo = longIndex; in delete()
204 hi = longIndex; in delete()
[all …]
|
| H A D | SparseArrayData.java | 177 final Long longIndex = indexToKey(index); in set() local
178 sparseMap.put(longIndex, value); in set()
179 setLength(Math.max(longIndex + 1, length())); in set()
192 final Long longIndex = indexToKey(index); in set() local
193 sparseMap.put(longIndex, value); in set()
194 setLength(Math.max(longIndex + 1, length())); in set()
206 final Long longIndex = indexToKey(index); in set() local
207 sparseMap.put(longIndex, value); in set()
208 setLength(Math.max(longIndex + 1, length())); in set()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/arrays/ |
| H A D | DeletedRangeArrayFilter.java | 57 return lo <= longIndex && longIndex <= hi; in isDeleted()
134 if (longIndex < lo || longIndex > hi) { in set()
136 } else if (longIndex > lo && longIndex < hi) { in set()
139 if (longIndex == lo) { in set()
152 if (longIndex < lo || longIndex > hi) { in set()
154 } else if (longIndex > lo && longIndex < hi) { in set()
170 if (longIndex < lo || longIndex > hi) { in set()
172 } else if (longIndex > lo && longIndex < hi) { in set()
202 lo = longIndex; in delete()
204 hi = longIndex; in delete()
[all …]
|
| H A D | SparseArrayData.java | 177 final Long longIndex = indexToKey(index); in set() local
178 sparseMap.put(longIndex, value); in set()
179 setLength(Math.max(longIndex + 1, length())); in set()
192 final Long longIndex = indexToKey(index); in set() local
193 sparseMap.put(longIndex, value); in set()
194 setLength(Math.max(longIndex + 1, length())); in set()
206 final Long longIndex = indexToKey(index); in set() local
207 sparseMap.put(longIndex, value); in set()
208 setLength(Math.max(longIndex + 1, length())); in set()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/arrays/ |
| H A D | DeletedRangeArrayFilter.java | 57 return lo <= longIndex && longIndex <= hi; in isDeleted()
134 if (longIndex < lo || longIndex > hi) { in set()
136 } else if (longIndex > lo && longIndex < hi) { in set()
139 if (longIndex == lo) { in set()
152 if (longIndex < lo || longIndex > hi) { in set()
154 } else if (longIndex > lo && longIndex < hi) { in set()
170 if (longIndex < lo || longIndex > hi) { in set()
172 } else if (longIndex > lo && longIndex < hi) { in set()
202 lo = longIndex; in delete()
204 hi = longIndex; in delete()
[all …]
|
| H A D | SparseArrayData.java | 177 final Long longIndex = indexToKey(index); in set() local
178 sparseMap.put(longIndex, value); in set()
179 setLength(Math.max(longIndex + 1, length())); in set()
192 final Long longIndex = indexToKey(index); in set() local
193 sparseMap.put(longIndex, value); in set()
194 setLength(Math.max(longIndex + 1, length())); in set()
206 final Long longIndex = indexToKey(index); in set() local
207 sparseMap.put(longIndex, value); in set()
208 setLength(Math.max(longIndex + 1, length())); in set()
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/nashorn/src/jdk/nashorn/internal/runtime/arrays/ |
| H A D | DeletedRangeArrayFilter.java | 57 return lo <= longIndex && longIndex <= hi; in isDeleted()
134 if (longIndex < lo || longIndex > hi) { in set()
136 } else if (longIndex > lo && longIndex < hi) { in set()
139 if (longIndex == lo) { in set()
152 if (longIndex < lo || longIndex > hi) { in set()
154 } else if (longIndex > lo && longIndex < hi) { in set()
170 if (longIndex < lo || longIndex > hi) { in set()
172 } else if (longIndex > lo && longIndex < hi) { in set()
202 lo = longIndex; in delete()
204 hi = longIndex; in delete()
[all …]
|
| H A D | SparseArrayData.java | 177 final Long longIndex = indexToKey(index); in set() local
178 sparseMap.put(longIndex, value); in set()
179 setLength(Math.max(longIndex + 1, length())); in set()
192 final Long longIndex = indexToKey(index); in set() local
193 sparseMap.put(longIndex, value); in set()
194 setLength(Math.max(longIndex + 1, length())); in set()
206 final Long longIndex = indexToKey(index); in set() local
207 sparseMap.put(longIndex, value); in set()
208 setLength(Math.max(longIndex + 1, length())); in set()
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/nashorn/src/jdk/nashorn/internal/runtime/arrays/ |
| H A D | DeletedRangeArrayFilter.java | 57 return lo <= longIndex && longIndex <= hi; in isDeleted()
134 if (longIndex < lo || longIndex > hi) { in set()
136 } else if (longIndex > lo && longIndex < hi) { in set()
139 if (longIndex == lo) { in set()
152 if (longIndex < lo || longIndex > hi) { in set()
154 } else if (longIndex > lo && longIndex < hi) { in set()
170 if (longIndex < lo || longIndex > hi) { in set()
172 } else if (longIndex > lo && longIndex < hi) { in set()
202 lo = longIndex; in delete()
204 hi = longIndex; in delete()
[all …]
|
| H A D | SparseArrayData.java | 177 final Long longIndex = indexToKey(index); in set() local
178 sparseMap.put(longIndex, value); in set()
179 setLength(Math.max(longIndex + 1, length())); in set()
192 final Long longIndex = indexToKey(index); in set() local
193 sparseMap.put(longIndex, value); in set()
194 setLength(Math.max(longIndex + 1, length())); in set()
206 final Long longIndex = indexToKey(index); in set() local
207 sparseMap.put(longIndex, value); in set()
208 setLength(Math.max(longIndex + 1, length())); in set()
|
| /dports/devel/icu/icu/source/test/perf/usetperf/ |
| H A D | bitset.cpp | 35 uint32_t longIndex = bitIndex >> 5; in get() local
37 return (longIndex < len) ? (((data[longIndex] >> bitInLong) & 1) != 0) in get()
42 uint32_t longIndex = bitIndex >> 5; in set() local
44 if (longIndex >= len) { in set()
45 ensureCapacity(longIndex+1); in set()
47 data[longIndex] |= (1 << bitInLong); in set()
|
| /dports/devel/icu-lx/icu/source/test/perf/usetperf/ |
| H A D | bitset.cpp | 35 uint32_t longIndex = bitIndex >> 5; in get() local
37 return (longIndex < len) ? (((data[longIndex] >> bitInLong) & 1) != 0) in get()
42 uint32_t longIndex = bitIndex >> 5; in set() local
44 if (longIndex >= len) { in set()
45 ensureCapacity(longIndex+1); in set()
47 data[longIndex] |= (1 << bitInLong); in set()
|
| /dports/databases/sqlrelay/sqlrelay-1.7.0/doc/api/ruby/doc/js/ |
| H A D | searcher.js | 87 function matchPassBeginning(index, longIndex, queries, regexps) { argument
90 if (!index.match(regexps[i]) && !longIndex.match(regexps[i]))
100 function matchPassLongIndex(index, longIndex, queries, regexps) { argument
101 if (longIndex.indexOf(queries[0]) != 0) return false;
103 if (!longIndex.match(regexps[i]))
113 function matchPassContains(index, longIndex, queries, regexps) { argument
116 if (!index.match(regexps[i]) && !longIndex.match(regexps[i]))
126 function matchPassRegexp(index, longIndex, queries, regexps) { argument
129 if (!index.match(regexps[i]) && !longIndex.match(regexps[i]))
|
| H A D | searcher.js.gz | 1Searcher = function(data) {
2 this.data = data;
3 this.handlers ... |
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/utilities/ |
| H A D | BitMapSegmented.java | 90 long longIndex = offset / SegmentSize;
92 assert longIndex < Integer.MAX_VALUE;
93 return (int)longIndex;
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/utilities/ |
| H A D | BitMapSegmented.java | 90 long longIndex = offset / SegmentSize;
92 assert longIndex < Integer.MAX_VALUE;
93 return (int)longIndex;
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/utilities/ |
| H A D | BitMapSegmented.java | 90 long longIndex = offset / SegmentSize;
92 assert longIndex < Integer.MAX_VALUE;
93 return (int)longIndex;
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/utilities/ |
| H A D | BitMapSegmented.java | 90 long longIndex = offset / SegmentSize;
92 assert longIndex < Integer.MAX_VALUE;
93 return (int)longIndex;
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/utilities/ |
| H A D | BitMapSegmented.java | 90 long longIndex = offset / SegmentSize;
92 assert longIndex < Integer.MAX_VALUE;
93 return (int)longIndex;
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/codegen/ |
| H A D | SpillObjectCreator.java | 101 final long longIndex = ArrayIndex.toLongIndex(index); in createObject() local
105 if (longIndex >= oldLength) { in createObject()
106 arrayData = arrayData.ensure(longIndex); in createObject()
118 if (longIndex > oldLength) { in createObject()
119 arrayData = arrayData.delete(oldLength, longIndex - 1); in createObject()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/codegen/ |
| H A D | SpillObjectCreator.java | 101 final long longIndex = ArrayIndex.toLongIndex(index); in createObject() local
105 if (longIndex >= oldLength) { in createObject()
106 arrayData = arrayData.ensure(longIndex); in createObject()
118 if (longIndex > oldLength) { in createObject()
119 arrayData = arrayData.delete(oldLength, longIndex - 1); in createObject()
|