Search Options

Results per page
Sort
Preferred Languages
Advance

Results 551 - 560 of 661 for clears (0.06 sec)

  1. src/main/webapp/js/admin/bootstrap.min.js

    UTO:"auto",TOP:"top",RIGHT:"right",BOTTOM:"bottom",LEFT:"left"},Ht={animation:!0,template:'<div class="tooltip" role="tooltip"><div class="arrow"></div><div class="tooltip-inner"></div></div>',trigger:"hover focus",title:"",delay:0,html:!1,selector:!1,placement:"top",offset:0,container:!1,fallbackPlacement:"flip",boundary:"scrollParent",customClass:"",sanitize:!0,sanitizeFn:null,whiteList:{"*":["class","dir","id","lang","role",/^aria-[\w-]*$/i],a:["target","href","title","rel"],area:[],b:[],br:[...
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 61.1K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/hash/BloomFilter.java

       *
       * @since 22.0
       */
      public long approximateElementCount() {
        long bitSize = bits.bitSize();
        long bitCount = bits.bitCount();
    
        /**
         * Each insertion is expected to reduce the # of clear bits by a factor of
         * `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 -
         * numHashFunctions/bitSize)^n)`. Solving that for n, and approximating `ln x` as `x - 1` when x
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 23 16:45:30 UTC 2024
    - 26.6K bytes
    - Viewed (0)
  3. src/archive/tar/common.go

    	if fi.h.Mode&c_ISUID != 0 {
    		mode |= fs.ModeSetuid
    	}
    	if fi.h.Mode&c_ISGID != 0 {
    		mode |= fs.ModeSetgid
    	}
    	if fi.h.Mode&c_ISVTX != 0 {
    		mode |= fs.ModeSticky
    	}
    
    	// Set file mode bits; clear perm, setuid, setgid, and sticky bits.
    	switch m := fs.FileMode(fi.h.Mode) &^ 07777; m {
    	case c_ISDIR:
    		mode |= fs.ModeDir
    	case c_ISFIFO:
    		mode |= fs.ModeNamedPipe
    	case c_ISLNK:
    		mode |= fs.ModeSymlink
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Sep 13 21:03:27 UTC 2024
    - 24.5K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/math/LongMathTest.java

          assertThrows(IllegalArgumentException.class, () -> LongMath.ceilingPowerOfTwo(x));
        }
      }
    
      public void testFloorPowerOfTwoNegative() {
        for (long x : NEGATIVE_LONG_CANDIDATES) {
          assertThrows(IllegalArgumentException.class, () -> LongMath.floorPowerOfTwo(x));
        }
      }
    
      public void testCeilingPowerOfTwoZero() {
        assertThrows(IllegalArgumentException.class, () -> LongMath.ceilingPowerOfTwo(0L));
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 15:00:32 UTC 2024
    - 30.6K bytes
    - Viewed (0)
  5. tensorflow/c/c_api.cc

        if (!mutation_warning.empty()) {
          // TODO(b/74949947): turn this back into an error status
          LOG(WARNING) << mutation_warning;
          session->graph->sessions[session].clear();
        }
    
        const auto num_nodes = graph.num_node_ids();
        if (session->last_num_graph_nodes < num_nodes) {
          // TODO(nolivia): check this on a subset of the graph instead of all of
          // it.
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 16:27:48 UTC 2024
    - 102.3K bytes
    - Viewed (0)
  6. cmd/metacache-set.go

    				topEntries[i] = entry
    				continue
    			}
    			// We got different entries
    			if entry.name > current.name {
    				continue
    			}
    			// We got a new, better current.
    			// Clear existing entries.
    			for i := range topEntries[:i] {
    				topEntries[i] = metaCacheEntry{}
    			}
    			agree = 1
    			current = entry
    			topEntries[i] = entry
    		}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jul 12 16:23:16 UTC 2024
    - 30.7K bytes
    - Viewed (0)
  7. src/archive/tar/reader.go

    }
    func (sr sparseFileReader) physicalRemaining() int64 {
    	return sr.fr.physicalRemaining()
    }
    
    type zeroReader struct{}
    
    func (zeroReader) Read(b []byte) (int, error) {
    	clear(b)
    	return len(b), nil
    }
    
    // mustReadFull is like io.ReadFull except it returns
    // io.ErrUnexpectedEOF when io.EOF is hit before len(b) bytes are read.
    func mustReadFull(r io.Reader, b []byte) (int, error) {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Mar 08 01:59:14 UTC 2024
    - 26.8K bytes
    - Viewed (0)
  8. docs/LICENSE

         and conditions of the license they choose before applying it.
         Licensors should also secure all rights necessary before
         applying our licenses so that the public can reuse the
         material as expected. Licensors should clearly mark any
         material not subject to the license. This includes other CC-
         licensed material, or material used under an exception or
         limitation to copyright. More considerations for licensors:
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon May 10 16:50:06 UTC 2021
    - 18.2K bytes
    - Viewed (0)
  9. CHANGELOG/CHANGELOG-1.20.md

    - Certain fields on  Service objects will be automatically cleared when changing the service's `type` to a mode that does not need those fields.  For example, changing from type=LoadBalancer to type=ClusterIP will clear the NodePort assignments, rather than forcing the user to clear them. ([#95196](https://github.com/kubernetes/kubernetes/pull/95196), [@thockin](https://github.com/thockin)) [SIG API Machinery, Apps, Network...
    Registered: Fri Nov 01 09:05:11 UTC 2024
    - Last Modified: Wed Jan 19 21:05:45 UTC 2022
    - 409K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

     * as the traditional heap data structure used in {@link PriorityQueue}.
     *
     * <p>This class is not thread-safe, and does not accept null elements.
     *
     * <p><i>Performance notes:</i>
     *
     * <ul>
     *   <li>If you only access one end of the queue, and do use a maximum size, this class will perform
     *       significantly worse than a {@code PriorityQueue} with manual eviction above the maximum
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
Back to top