Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 51 - 60 of 109 for cap1 (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/main/java/jcifs/smb1/smb1/SmbTransport.java

        }
    
        boolean hasCapability(final int cap) throws SmbException {
            try {
                connect(RESPONSE_TIMEOUT);
            } catch (final IOException ioe) {
                throw new SmbException(ioe.getMessage(), ioe);
            }
            return (capabilities & cap) == cap;
        }
    
        boolean isSignatureSetupRequired(final NtlmPasswordAuthentication auth) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 31.8K bytes
    - Click Count (0)
  2. cmd/local-locker_gen.go

    			err = msgp.WrapError(err)
    			return
    		}
    		var zb0002 []lockRequesterInfo
    		var zb0005 uint32
    		zb0005, err = dc.ReadArrayHeader()
    		if err != nil {
    			err = msgp.WrapError(err, zb0001)
    			return
    		}
    		if cap(zb0002) >= int(zb0005) {
    			zb0002 = (zb0002)[:zb0005]
    		} else {
    			zb0002 = make([]lockRequesterInfo, zb0005)
    		}
    		for zb0003 := range zb0002 {
    			err = zb0002[zb0003].DecodeMsg(dc)
    			if err != nil {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 16.6K bytes
    - Click Count (0)
  3. internal/s3select/simdj/record.go

    	if dst == nil {
    		dst = &json.Record{SelectFormat: sql.SelectFmtJSON}
    	}
    	dst.Reset()
    	elems, err := r.object.Parse(nil)
    	if err != nil {
    		return nil, err
    	}
    	if cap(dst.KVS) < len(elems.Elements) {
    		dst.KVS = make(jstream.KVS, 0, len(elems.Elements))
    	}
    	for _, elem := range elems.Elements {
    		v, err := sql.IterToValue(elem.Iter)
    		if err != nil {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 5.4K bytes
    - Click Count (0)
  4. cmd/streaming-v4-unsigned.go

    				fmt.Printf("err size: %v\n", string(b))
    			}
    			cr.err = errMalformedEncoding
    			return n, cr.err
    		}
    		if size > maxChunkSize {
    			cr.err = errChunkTooBig
    			return n, cr.err
    		}
    	}
    
    	if cap(cr.buffer) < size {
    		cr.buffer = make([]byte, size)
    	} else {
    		cr.buffer = cr.buffer[:size]
    	}
    
    	// Now, we read the payload.
    	_, err = io.ReadFull(cr.reader, cr.buffer)
    	if err == io.EOF && size != 0 {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Apr 03 14:55:52 GMT 2025
    - 6.3K bytes
    - Click Count (0)
  5. lib/fips140/v1.26.0.zip

    VSLDOI $8, T2, T1, T1 // VSLDB $8, T2, T1, T1 VADDCUQ T0, RED1, CAR1 // VACCQ T0, RED1, CAR1 VADDUQM T0, RED1, T0 // VAQ T0, RED1, T0 VADDECUQ T1, RED2, CAR1, CAR2 // VACCCQ T1, RED2, CAR1, CAR2 VADDEUQM T1, RED2, CAR1, T1 // VACQ T1, RED2, CAR1, T1 VADDUQM T2, CAR2, T2 // VAQ T2, CAR2, T2 // ---------- VSUBCUQ T0, PL, CAR1 // VSCBIQ PL, T0, CAR1 VSUBUQM T0, PL, TT0 // VSQ PL, T0, TT0 VSUBECUQ T1, PH, CAR1, CAR2 // VSBCBIQ T1, PH, CAR1, CAR2 VSUBEUQM T1, PH, CAR1, TT1 // VSBIQ T1, PH, CAR1, TT1 VSUBEUQM...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  6. internal/lru/lru.go

    func (c *LRU[K, V]) removeFromBucket(e *Entry[K, V]) {
    	delete(c.buckets[e.ExpireBucket].entries, e.Key)
    }
    
    // Cap returns the capacity of the cache
    func (c *LRU[K, V]) Cap() int {
    	return c.size
    }
    
    // Entry is an LRU Entry
    type Entry[K comparable, V any] struct {
    	// Next and previous pointers in the doubly-linked list of elements.
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Sat Mar 21 11:35:55 GMT 2026
    - 12.6K bytes
    - Click Count (0)
  7. internal/s3select/json/preader.go

    // return the buffer until the next newline occurs.
    // The last block will be sent along with an io.EOF.
    func (r *PReader) nextSplit(skip int, dst []byte) ([]byte, error) {
    	if cap(dst) < skip {
    		dst = make([]byte, 0, skip+1024)
    	}
    	dst = dst[:skip]
    	if skip > 0 {
    		n, err := io.ReadFull(r.buf, dst)
    		if err != nil && err != io.ErrUnexpectedEOF {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue May 27 15:19:03 GMT 2025
    - 6.5K bytes
    - Click Count (0)
  8. association.go

    			var fieldValue reflect.Value
    			if clear {
    				fieldValue = reflect.MakeSlice(oldFieldValue.Type(), 0, oldFieldValue.Cap())
    			} else {
    				fieldValue = reflect.MakeSlice(oldFieldValue.Type(), oldFieldValue.Len(), oldFieldValue.Cap())
    				reflect.Copy(fieldValue, oldFieldValue)
    			}
    
    			appendToFieldValues := func(ev reflect.Value) {
    				if ev.Type().AssignableTo(elemType) {
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Sun Oct 26 12:09:12 GMT 2025
    - 23.6K bytes
    - Click Count (0)
  9. cmd/bitrot-streaming.go

    	h := algo.New()
    	buf := globalBytePoolCap.Load().Get()
    	rb := ringbuffer.NewBuffer(buf[:cap(buf)]).SetBlocking(true)
    
    	bw := &streamingBitrotWriter{
    		iow:          ioutil.NewDeadlineWriter(rb.WriteCloser(), globalDriveConfig.GetMaxTimeout()),
    		closeWithErr: rb.CloseWithError,
    		h:            h,
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Jan 17 19:19:30 GMT 2025
    - 6.2K bytes
    - Click Count (0)
  10. cmd/batch-replicate_gen.go

    				return
    			}
    		case "Tags":
    			var zb0002 uint32
    			zb0002, err = dc.ReadArrayHeader()
    			if err != nil {
    				err = msgp.WrapError(err, "Tags")
    				return
    			}
    			if cap(z.Tags) >= int(zb0002) {
    				z.Tags = (z.Tags)[:zb0002]
    			} else {
    				z.Tags = make([]BatchJobKV, zb0002)
    			}
    			for za0001 := range z.Tags {
    				err = z.Tags[za0001].DecodeMsg(dc)
    				if err != nil {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 40.7K bytes
    - Click Count (0)
Back to Top