Search Options

Results per page
Sort
Preferred Languages
Advance

Results 451 - 460 of 759 for Mount (0.04 sec)

  1. guava/src/com/google/common/graph/Network.java

       * self-loops incident to {@code node}).
       *
       * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}.
       *
       * @throws IllegalArgumentException if {@code node} is not an element of this network
       */
      int degree(N node);
    
      /**
       * Returns the count of {@code node}'s {@link #inEdges(Object) incoming edges} in a directed
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 22.4K bytes
    - Viewed (0)
  2. src/main/java/jcifs/smb1/smb1/ACE.java

            bi += 4;
            sid = new SID(buf, bi);
            return size;
        }
    
        void appendCol(StringBuffer sb, String str, int width) {
            sb.append(str);
            int count = width - str.length();
            for (int i = 0; i < count; i++) {
                sb.append(' ');
            }
        }
        /**
         * Return a string represeting this ACE.
         * <p>
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 7.2K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/io/CountingOutputStreamTest.java

        counter.write(data, 2, 5);
        written += 5;
        assertEquals(written, out.size());
        assertEquals(written, counter.getCount());
    
        // Test that illegal arguments do not affect count
        assertThrows(IndexOutOfBoundsException.class, () -> counter.write(data, 0, data.length + 1));
        assertEquals(written, out.size());
        assertEquals(written, counter.getCount());
      }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Sep 06 17:04:31 UTC 2023
    - 1.9K bytes
    - Viewed (0)
  4. guava/src/com/google/common/graph/ValueGraph.java

       * self-loops incident to {@code node}).
       *
       * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}.
       *
       * @throws IllegalArgumentException if {@code node} is not an element of this graph
       */
      @Override
      int degree(N node);
    
      /**
       * Returns the count of {@code node}'s incoming edges (equal to {@code predecessors(node).size()})
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 16K bytes
    - Viewed (0)
  5. android/guava-testlib/src/com/google/common/collect/testing/google/MultisetElementSetTester.java

      public void testElementSetRemovePropagatesToMultiset() {
        Set<E> elementSet = getMultiset().elementSet();
        int size = getNumElements();
        int expectedSize = size - getMultiset().count(e0());
        assertTrue(elementSet.remove(e0()));
        assertFalse(getMultiset().contains(e0()));
        assertEquals(expectedSize, getMultiset().size());
      }
    
      @CollectionSize.Require(SEVERAL)
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 4.2K bytes
    - Viewed (0)
  6. common-protos/k8s.io/api/apps/v1beta1/generated.proto

      optional int32 replicas = 1;
    
      // selector is a label query over pods that should match the replicas count. More info: https://kubernetes.io/docs/concepts/overview/working-with-objects/labels/
      // +optional
      map<string, string> selector = 2;
    
      // targetSelector is the label selector for pods that should match the replicas count. This is a serializated
      // version of both map-based and more expressive set-based selectors. This is done to
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 24K bytes
    - Viewed (0)
  7. cmd/format-erasure_test.go

    	for _, hash := range formatHashes {
    		if hash == "" {
    			continue
    		}
    		formatCountMap[hash]++
    	}
    
    	maxHash := ""
    	maxCount := 0
    	for hash, count := range formatCountMap {
    		if count > maxCount {
    			maxCount = count
    			maxHash = hash
    		}
    	}
    
    	if maxCount < len(formats)/2 {
    		return nil, errErasureReadQuorum
    	}
    
    	for i, hash := range formatHashes {
    		if hash == maxHash {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Apr 15 08:25:46 UTC 2024
    - 12.9K bytes
    - Viewed (0)
  8. cmd/metacache-set.go

    	filter := func(list []uint64) (commonCount uint64) {
    		max := 0
    		signatureMap := map[uint64]int{}
    		for _, v := range list {
    			signatureMap[v]++
    		}
    		for ops, count := range signatureMap {
    			if max < count && commonCount < ops {
    				max = count
    				commonCount = ops
    			}
    		}
    		if max < readQuorum {
    			return 0
    		}
    		return commonCount
    	}
    
    	commonWrite = filter(writes)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jul 12 16:23:16 UTC 2024
    - 30.7K bytes
    - Viewed (0)
  9. internal/logger/target/types/types.go

    	QueueLength int
    
    	// TotalMessages is the total number of messages sent in the lifetime of the target
    	TotalMessages int64
    
    	// FailedMessages should log message count that failed to send.
    	FailedMessages int64
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Nov 10 18:20:21 UTC 2022
    - 1.4K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java

         * desired count.
         *
         * @param element the element to add or remove occurrences of
         * @param count the desired count of the element in this multiset
         * @return this {@code Builder} object
         * @throws NullPointerException if {@code element} is null
         * @throws IllegalArgumentException if {@code count} is negative
         */
        @CanIgnoreReturnValue
        @Override
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 21:21:17 UTC 2024
    - 35.4K bytes
    - Viewed (0)
Back to top