Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 15 for LowerBound (0.04 sec)

  2. github.com/google/guava

    android/guava/src/com/google/common/collect/TreeRangeSet.java 

                nextComplementRangeUpperBound = positiveRange.lowerBound;
            if (complementLowerBoundWindow.lowerBound.isLessThan(negativeRange.lowerBound)) {
              return immutableEntry(negativeRange.lowerBound, negativeRange);
            }
          } else if (complementLowerBoundWindow.lowerBound.isLessThan(Cut.belowAll())) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 32.3K bytes
    - Viewed (0)
  3. github.com/google/guava

    android/guava/src/com/google/common/collect/TreeRangeMap.java 

        @Override
    public Range<K> span() {
      Cut<K> lowerBound;
      Entry<Cut<K>, RangeMapEntry<K, V>> lowerEntry =
          entriesByLowerBound.floorEntry(subRange.lowerBound);
      if (lowerEntry != null
          && lowerEntry.getValue().getUpperBound().compareTo(subRange.lowerBound) > 0) {
        lowerBound = subRange.lowerBound;
      } else {
        lowerBound = entriesByLowerBound.ceilingKey(subRange.lowerBound);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Jul 18 15:05:43 UTC 2025
    - 22.8K bytes
    - Viewed (0)
  4. github.com/google/guava

    android/guava/src/com/google/common/collect/TreeBasedTable.java 

        final @Nullable C lowerBound;
    final @Nullable C upperBound;

    TreeRow(R rowKey) {
      this(rowKey, null, null);
    }

    TreeRow(R rowKey, @Nullable C lowerBound, @Nullable C upperBound) {
      super(rowKey);
      this.lowerBound = lowerBound;
      this.upperBound = upperBound;
      checkArgument(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Jul 18 15:05:43 UTC 2025
    - 11.6K bytes
    - Viewed (0)
  5. github.com/google/guava

    guava/src/com/google/common/collect/TreeBasedTable.java 

        final @Nullable C lowerBound;
    final @Nullable C upperBound;

    TreeRow(R rowKey) {
      this(rowKey, null, null);
    }

    TreeRow(R rowKey, @Nullable C lowerBound, @Nullable C upperBound) {
      super(rowKey);
      this.lowerBound = lowerBound;
      this.upperBound = upperBound;
      checkArgument(
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Jul 18 15:05:43 UTC 2025
    - 11.6K bytes
    - Viewed (0)
  6. github.com/apache/maven

    compat/maven-artifact/src/main/java/org/apache/maven/artifact/versioning/VersionRange.java 

            } else {
            String lowerBound = process.substring(0, index).trim();
            String upperBound = process.substring(index + 1).trim();

            ArtifactVersion lowerVersion = null;
            if (!lowerBound.isEmpty()) {
                lowerVersion = new DefaultArtifactVersion(lowerBound);
            }
            ArtifactVersion upperVersion = null;
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Wed Jul 23 17:27:08 UTC 2025
    - 19K bytes
    - Viewed (0)
  7. github.com/google/guava

    android/guava/src/com/google/common/collect/ImmutableRangeMap.java 

            SortedLists.binarySearch(
            ranges,
            Range::upperBound,
            range.lowerBound,
            KeyPresentBehavior.FIRST_AFTER,
            KeyAbsentBehavior.NEXT_HIGHER);
    int upperIndex =
        SortedLists.binarySearch(
            ranges,
            Range::lowerBound,
            range.upperBound,
            KeyPresentBehavior.ANY_PRESENT,
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 14.3K bytes
    - Viewed (0)
  8. github.com/google/guava

    android/guava/src/com/google/common/collect/ImmutableRangeSet.java 

        }

    @Override
    public Range<C> get(int index) {
      checkElementIndex(index, size);

      Cut<C> lowerBound;
      if (positiveBoundedBelow) {
        lowerBound = (index == 0) ? Cut.belowAll() : ranges.get(index - 1).upperBound;
      } else {
        lowerBound = ranges.get(index).upperBound;
      }

      Cut<C> upperBound;
      if (positiveBoundedAbove && index == size - 1) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 27.4K bytes
    - Viewed (0)
  9. github.com/minio/minio

    cmd/batch-job-common-types_gen.go 

    					err = msgp.WrapError(err, "UpperBound")
					return
				}
				z.UpperBound = BatchJobSize(zb0002)
			}
		case "LowerBound":
			{
				var zb0003 int64
				zb0003, err = dc.ReadInt64()
				if err != nil {
					err = msgp.WrapError(err, "LowerBound")
					return
				}
				z.LowerBound = BatchJobSize(zb0003)
			}
		default:
			err = dc.Skip()
			if err != nil {
				err = msgp.WrapError(err)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sat Dec 02 10:51:33 UTC 2023
    - 21.9K bytes
    - Viewed (0)
  10. github.com/google/guava

    guava/src/com/google/common/collect/ImmutableRangeMap.java 

            SortedLists.binarySearch(
            ranges,
            Range::upperBound,
            range.lowerBound,
            KeyPresentBehavior.FIRST_AFTER,
            KeyAbsentBehavior.NEXT_HIGHER);
    int upperIndex =
        SortedLists.binarySearch(
            ranges,
            Range::lowerBound,
            range.upperBound,
            KeyPresentBehavior.ANY_PRESENT,
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 14.7K bytes
    - Viewed (0)
  11. github.com/google/guava

    guava-tests/test/com/google/common/collect/RangeTest.java 

        }
  }

  public void testOrderingCuts() {
    Cut<Integer> a = Range.lessThan(0).lowerBound;
    Cut<Integer> b = Range.atLeast(0).lowerBound;
    Cut<Integer> c = Range.greaterThan(0).lowerBound;
    Cut<Integer> d = Range.atLeast(1).lowerBound;
    Cut<Integer> e = Range.greaterThan(1).lowerBound;
    Cut<Integer> f = Range.greaterThan(1).upperBound;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 24.2K bytes
    - Viewed (0)
Back to top