Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 622 for puts (0.02 seconds)

  1. internal/store/queuestore.go

    	}
    
    	if err != nil {
    		return err
    	}
    	// Increment the item count.
    	store.entries[key.String()] = time.Now().UnixNano()
    	return nil
    }
    
    // Put - puts an item to the store.
    func (store *QueueStore[I]) Put(item I) (Key, error) {
    	store.Lock()
    	defer store.Unlock()
    	if uint64(len(store.entries)) >= store.entryLimit {
    		return Key{}, errLimitExceeded
    	}
    	// Generate a new UUID for the key.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 7.8K bytes
    - Click Count (0)
  2. src/cmd/cgo/doc.go

    	this symbol.
    
    	In the <remote>, # or @ can be used to introduce a symbol version.
    
    	Examples:
    	//go:cgo_import_dynamic puts
    	//go:cgo_import_dynamic puts puts#GLIBC_2.2.5
    	//go:cgo_import_dynamic puts puts#GLIBC_2.2.5 "libc.so.6"
    
    	A side effect of the cgo_import_dynamic directive with a
    	library is to make the final binary depend on that dynamic
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Dec 08 22:37:14 GMT 2025
    - 43.9K bytes
    - Click Count (0)
  3. src/main/java/org/codelibs/fess/crawler/transformer/FessTransformer.java

                    }
                    dataMap.put(key, values);
                } else {
                    final Object[] values = Arrays.copyOf(oldValues, oldValues.length + 1);
                    values[values.length - 1] = value;
                    dataMap.put(key, values);
                }
            }
        }
    
        /**
         * Puts data into the result data map after processing it through a template script.
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Dec 11 09:47:03 GMT 2025
    - 14.1K bytes
    - Click Count (0)
  4. ci/official/utilities/rename_and_verify_wheels.sh

    # ==============================================================================
    #
    # Usage: rename_and_verify_wheels.sh
    # This script is aware of TFCI_ variables, so it doesn't need any arguments.
    # Puts new wheel through auditwheel to rename and verify it, deletes the old
    # one, checks the filesize, and then ensures the new wheel is installable.
    set -exo pipefail
    
    cd "$TFCI_OUTPUT_DIR"
    
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Sep 22 21:39:32 GMT 2025
    - 4.4K bytes
    - Click Count (0)
  5. src/main/java/jcifs/smb1/util/MD4.java

         * reset.
         *
         * @return the array of bytes for the resulting hash value.
         */
        @Override
        public byte[] engineDigest() {
            // pad output to 56 mod 64; as RFC1320 puts it: congruent to 448 mod 512
            final int bufferNdx = (int) (count % BLOCK_LENGTH);
            final int padLen = bufferNdx < 56 ? 56 - bufferNdx : 120 - bufferNdx;
    
            // padding is alwas binary 1 followed by binary 0s
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 9.6K bytes
    - Click Count (0)
  6. docs/en/docs/python-types.md

    * `dict`
    
    #### List { #list }
    
    For example, let's define a variable to be a `list` of `str`.
    
    Declare the variable, with the same colon (`:`) syntax.
    
    As the type, put `list`.
    
    As the list is a type that contains some internal types, you put them in square brackets:
    
    {* ../../docs_src/python_types/tutorial006_py310.py hl[1] *}
    
    /// info
    
    Those internal types in the square brackets are called "type parameters".
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 11K bytes
    - Click Count (0)
  7. okhttp/src/jvmTest/kotlin/okhttp3/ConnectionCoalescingTest.kt

              proxy: Proxy,
            ) {
              // Let request1 proceed to make a connection.
              latch1.countDown()
              try {
                // Wait until request1 makes the connection and puts it in the connection pool.
                latch2.await()
              } catch (e: InterruptedException) {
                throw AssertionError(e)
              }
            }
    
            override fun connectionAcquired(
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Thu Jun 19 11:44:16 GMT 2025
    - 19.1K bytes
    - Click Count (0)
  8. cmd/bucket-stats.go

    	"github.com/minio/madmin-go/v3"
    )
    
    //go:generate msgp -file $GOFILE
    
    // ReplicationLatency holds information of bucket operations latency, such us uploads
    type ReplicationLatency struct {
    	// Single & Multipart PUTs latency
    	UploadHistogram LastMinuteHistogram
    }
    
    // Merge two replication latency into a new one
    func (rl ReplicationLatency) merge(other ReplicationLatency) (newReplLatency ReplicationLatency) {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 13.5K bytes
    - Click Count (0)
  9. internal/store/queuestore_test.go

    	if err != nil {
    		t.Fatal("Failed to create a queue store ", err)
    	}
    	for range 5 {
    		if _, err := store.Put(testItem); err != nil {
    			t.Fatal("Failed to put to queue store ", err)
    		}
    	}
    	// Should not allow 6th Put.
    	if _, err := store.Put(testItem); err == nil {
    		t.Fatalf("Expected to fail with %s, but passes", errLimitExceeded)
    	}
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 10.2K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/collect/HashBiMap.java

        return (entry == ABSENT) ? null : keys[entry];
      }
    
      @CanIgnoreReturnValue
      @Override
      public @Nullable V put(@ParametricNullness K key, @ParametricNullness V value) {
        return put(key, value, false);
      }
    
      private @Nullable V put(@ParametricNullness K key, @ParametricNullness V value, boolean force) {
        int keyHash = smearedHash(key);
        int entryForKey = findEntryByKey(key, keyHash);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 16:16:42 GMT 2026
    - 37K bytes
    - Click Count (0)
Back to Top