- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 540 for rangesP (0.14 sec)
-
src/internal/trace/summary.go
syscallingP map[ProcID]GoID syscallingG map[GoID]ProcID // rangesP is used for optimistic tracking of P-based ranges for goroutines. // // It's a best-effort mapping of an active range on a P to the goroutine we think // is associated with it. rangesP map[rangeP]GoID lastTs Time // timestamp of the last event processed.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 20.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeSet.java
* rangeSet.add(Range.closedOpen(15, 20)); // connected range; {[1, 10], [11, 20)} * rangeSet.add(Range.openClosed(0, 0)); // empty range; {[1, 10], [11, 20)} * rangeSet.remove(Range.open(5, 10)); // splits [1, 10]; {[1, 5], [10, 10], [11, 20)} * }</pre> * * <p>Note that the behavior of {@link Range#isEmpty()} and {@link Range#isConnected(Range)} may not
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 9.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/RangeSet.java
* rangeSet.add(Range.closedOpen(15, 20)); // connected range; {[1, 10], [11, 20)} * rangeSet.add(Range.openClosed(0, 0)); // empty range; {[1, 10], [11, 20)} * rangeSet.remove(Range.open(5, 10)); // splits [1, 10]; {[1, 5], [10, 10], [11, 20)} * }</pre> * * <p>Note that the behavior of {@link Range#isEmpty()} and {@link Range#isConnected(Range)} may not
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/Range.java
* also be called their <i>union</i>. If they are not, note that the span might contain values * that are not contained in either input range. * * <p>Like {@link #intersection(Range) intersection}, this operation is commutative, associative * and idempotent. Unlike it, it is always well-defined for any two input ranges. */ public Range<C> span(Range<C> other) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
src/runtime/mranges.go
coalescesDown := i > 0 && a.ranges[i-1].limit.equal(r.base) coalescesUp := i < len(a.ranges) && r.limit.equal(a.ranges[i].base) if coalescesUp && coalescesDown { // We have neighbors and they both border us. // Merge a.ranges[i-1], r, and a.ranges[i] together into a.ranges[i-1]. a.ranges[i-1].limit = a.ranges[i].limit // Delete a.ranges[i]. copy(a.ranges[i:], a.ranges[i+1:]) a.ranges = a.ranges[:len(a.ranges)-1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 14.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/AbstractRangeSetTest.java
Range<C> range1 = asRanges.get(i); Range<C> range2 = asRanges.get(i + 1); assertFalse(range1.isConnected(range2)); } // test that there are no empty ranges for (Range<C> range : asRanges) { assertFalse(range.isEmpty()); } // test that the RangeSet's span is the span of all the ranges Iterator<Range<C>> itr = rangeSet.asRanges().iterator();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 20:09:59 UTC 2024 - 2.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Range.java
* also be called their <i>union</i>. If they are not, note that the span might contain values * that are not contained in either input range. * * <p>Like {@link #intersection(Range) intersection}, this operation is commutative, associative * and idempotent. Unlike it, it is always well-defined for any two input ranges. */ public Range<C> span(Range<C> other) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
src/unicode/letter.go
for i := range ranges { range_ := &ranges[i] if r < range_.Lo { return false } if r <= range_.Hi { return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0 } } return false } // binary search over ranges lo := 0 hi := len(ranges) for lo < hi { m := int(uint(lo+hi) >> 1) range_ := ranges[m] if range_.Lo <= r && r <= range_.Hi {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0) -
src/debug/dwarf/testdata/ranges.c
Ian Lance Taylor <******@****.***> 1458162954 -0700
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 22 14:06:09 UTC 2016 - 415 bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
ImmutableRangeSet(ImmutableList<Range<C>> ranges) { this.ranges = ranges; } private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { this.ranges = ranges; this.complement = complement; } private final transient ImmutableList<Range<C>> ranges; @Override public boolean intersects(Range<C> otherRange) { int ceilingIndex = SortedLists.binarySearch(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 27.1K bytes - Viewed (0)