- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 879 for aranges (0.12 sec)
-
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
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( ranges,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 27.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableRangeSet.java
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( ranges,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 26.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeSet.java
boolean isEmpty(); /** * Returns the minimal range which {@linkplain Range#encloses(Range) encloses} all ranges in this * range set. * * @throws NoSuchElementException if this range set is {@linkplain #isEmpty() empty} */ Range<C> span(); // Views /** * Returns a view of the {@linkplain Range#isConnected disconnected} ranges that make up this
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 9.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeSet.java
&& !priorEntry.getValue().intersection(range).isEmpty(); } @Override public boolean encloses(Range<C> range) { checkNotNull(range); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); return floorEntry != null && floorEntry.getValue().encloses(range); } @CheckForNull private Range<C> rangeEnclosing(Range<C> range) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 26 21:02:13 UTC 2023 - 32.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/RangeSet.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.2K bytes - Viewed (0) -
src/cmd/internal/dwarf/dwarf.go
} // PutBasedRanges writes a range table to sym. All addresses in ranges are // relative to some base address, which must be arranged by the caller // (e.g., with a DW_AT_low_pc attribute, or in a BASE-prefixed range). func PutBasedRanges(ctxt Context, sym Sym, ranges []Range) { ps := ctxt.PtrSize() // Write ranges. for _, r := range ranges { ctxt.AddInt(sym, ps, r.Start) ctxt.AddInt(sym, ps, r.End)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 06 15:23:18 UTC 2024 - 43K bytes - Viewed (0) -
src/internal/trace/testtrace/validation.go
ranges, ok := v.ranges[r] return ok && slices.Contains(ranges, name) } func (v *Validator) addRange(r trace.ResourceID, name string) { ranges, _ := v.ranges[r] ranges = append(ranges, name) v.ranges[r] = ranges } func (v *Validator) hasAnyRange(r trace.ResourceID) bool { ranges, ok := v.ranges[r] return ok && len(ranges) != 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 10.9K bytes - Viewed (0) -
src/cmd/trace/gen.go
// It expects ev to be one such event. func (g *procRangeGenerator) ProcRange(ctx *traceContext, ev *trace.Event) { if g.ranges == nil { g.ranges = make(map[trace.Range]activeRange) } r := ev.Range() switch ev.Kind() { case trace.EventRangeBegin: g.ranges[r] = activeRange{ev.Time(), ev.Stack()} case trace.EventRangeActive: // If we've seen a Sync event, then Active events are always redundant.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 11.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TreeRangeMapTest.java
for (Range<Integer> range2 : RANGES) { for (Range<Integer> range3 : RANGES) { Map<Integer, Integer> model = Maps.newHashMap(); putModel(model, range1, 1); putModel(model, range2, 2); putModel(model, range3, 3); RangeMap<Integer, Integer> test = TreeRangeMap.create(); RangeMap<Integer, Integer> test2 = TreeRangeMap.create();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 20:09:59 UTC 2024 - 33.2K 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)