Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 101 for cap (1.8 sec)

  1. src/main/java/jcifs/internal/smb1/com/SmbComNegotiateResponse.java

        /**
         * {@inheritDoc}
         *
         * @see jcifs.internal.SmbNegotiationResponse#haveCapabilitiy(int)
         */
        @Override
        public boolean haveCapabilitiy(final int cap) {
            return (this.capabilities & cap) == cap;
        }
    
        /**
         * {@inheritDoc}
         *
         * @see jcifs.internal.SmbNegotiationResponse#isDFSSupported()
         */
        @Override
        public boolean isDFSSupported() {
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 15.8K bytes
    - Viewed (0)
  2. cmd/erasure-server-pool-decom_gen.go

    				return
    			}
    		case "bkts":
    			var zb0002 uint32
    			zb0002, err = dc.ReadArrayHeader()
    			if err != nil {
    				err = msgp.WrapError(err, "QueuedBuckets")
    				return
    			}
    			if cap(z.QueuedBuckets) >= int(zb0002) {
    				z.QueuedBuckets = (z.QueuedBuckets)[:zb0002]
    			} else {
    				z.QueuedBuckets = make([]string, zb0002)
    			}
    			for za0001 := range z.QueuedBuckets {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 26.7K bytes
    - Viewed (0)
  3. src/main/java/jcifs/smb/SmbTreeHandleImpl.java

        public void ensureDFSResolved() throws CIFSException {
            this.treeConnection.ensureDFSResolved(this.resourceLoc);
        }
    
        @Override
        public boolean hasCapability(final int cap) throws SmbException {
            return this.treeConnection.hasCapability(cap);
        }
    
        /**
         * {@inheritDoc}
         *
         * @see jcifs.SmbTreeHandle#isConnected()
         */
        @Override
        public boolean isConnected() {
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 11.1K bytes
    - Viewed (0)
  4. cmd/bootstrap-peer-server_gen.go

    				return
    			}
    		case "CmdLines":
    			var zb0002 uint32
    			zb0002, err = dc.ReadArrayHeader()
    			if err != nil {
    				err = msgp.WrapError(err, "CmdLines")
    				return
    			}
    			if cap(z.CmdLines) >= int(zb0002) {
    				z.CmdLines = (z.CmdLines)[:zb0002]
    			} else {
    				z.CmdLines = make([]string, zb0002)
    			}
    			for za0001 := range z.CmdLines {
    				z.CmdLines[za0001], err = dc.ReadString()
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 6.9K bytes
    - Viewed (0)
  5. src/test/java/jcifs/smb/SmbPipeHandleInternalTest.java

            int n = handle.sendrecv(out, 1, 10, in, 128);
    
            // Assert
            assertEquals(42, n);
            ArgumentCaptor<Smb2IoctlRequest> cap = ArgumentCaptor.forClass(Smb2IoctlRequest.class);
            verify(tree).send(cap.capture(), eq(RequestParam.NO_RETRY));
            assertNotNull(cap.getValue()); // captured request should be present
        }
    
        @Test
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 16.7K bytes
    - Viewed (0)
  6. cmd/xl-storage-format-v2_gen.go

    				return
    			}
    		case "EcDist":
    			var zb0003 uint32
    			zb0003, err = dc.ReadArrayHeader()
    			if err != nil {
    				err = msgp.WrapError(err, "ErasureDist")
    				return
    			}
    			if cap(z.ErasureDist) >= int(zb0003) {
    				z.ErasureDist = (z.ErasureDist)[:zb0003]
    			} else {
    				z.ErasureDist = make([]uint8, zb0003)
    			}
    			for za0003 := range z.ErasureDist {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 55.8K bytes
    - Viewed (0)
  7. src/test/java/jcifs/internal/smb2/Smb2ConstantsTest.java

                // Verify each is a power of 2
                for (int cap : capabilities) {
                    assertTrue(isPowerOfTwo(cap), "Capability 0x" + Integer.toHexString(cap) + " should be a power of 2");
                }
    
                // Verify no overlapping bits
                for (int i = 0; i < capabilities.length; i++) {
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 14.1K bytes
    - Viewed (0)
  8. scan.go

    				update = false
    				if isArrayKind {
    					db.Statement.ReflectValue.Set(reflect.Zero(reflectValue.Type()))
    				} else {
    					// if the slice cap is externally initialized, the externally initialized slice is directly used here
    					if reflectValue.Cap() == 0 {
    						db.Statement.ReflectValue.Set(reflect.MakeSlice(reflectValue.Type(), 0, 20))
    					} else {
    						reflectValue.SetLen(0)
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  9. src/builtin/builtin.go

    // capacity" section for details.
    func len(v Type) int
    
    // The cap built-in function returns the capacity of v, according to its type:
    //
    //   - Array: the number of elements in v (same as len(v)).
    //   - Pointer to array: the number of elements in *v (same as len(v)).
    //   - Slice: the maximum length the slice can reach when resliced;
    //     if v is nil, cap(v) is zero.
    //   - Channel: the channel buffer capacity, in units of elements;
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Mon Dec 30 23:59:23 UTC 2024
    - 12.8K bytes
    - Viewed (0)
  10. internal/logger/target/http/http.go

    		// from this main worker routine will exit
    		// once the channel drops below half capacity
    		// and when it's been at least 30 seconds since
    		// we launched a new worker.
    		if mainWorker && len(h.logCh) > cap(h.logCh)/2 {
    			nWorkers := h.workers.Load()
    			if nWorkers < h.maxWorkers {
    				if time.Since(h.lastStarted).Milliseconds() > 10 {
    					h.lastStarted = time.Now()
    					go h.startQueueProcessor(ctx, false)
    				}
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 15.6K bytes
    - Viewed (0)
Back to top