Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 112 for grow (0.05 sec)

  1. src/bytes/buffer.go

    	return m
    }
    
    // Grow grows the buffer's capacity, if necessary, to guarantee space for
    // another n bytes. After Grow(n), at least n bytes can be written to the
    // buffer without another allocation.
    // If n is negative, Grow will panic.
    // If the buffer can't grow it will panic with [ErrTooLarge].
    func (b *Buffer) Grow(n int) {
    	if n < 0 {
    		panic("bytes.Buffer.Grow: negative count")
    	}
    	m := b.grow(n)
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Oct 29 16:47:05 UTC 2024
    - 15.7K bytes
    - Viewed (0)
  2. src/bytes/example_test.go

    func ExampleBuffer_Grow() {
    	var b bytes.Buffer
    	b.Grow(64)
    	bb := b.Bytes()
    	b.Write([]byte("64 bytes or fewer"))
    	fmt.Printf("%q", bb[:b.Len()])
    	// Output: "64 bytes or fewer"
    }
    
    func ExampleBuffer_Len() {
    	var b bytes.Buffer
    	b.Grow(64)
    	b.Write([]byte("abcde"))
    	fmt.Printf("%d", b.Len())
    	// Output: 5
    }
    
    func ExampleBuffer_Next() {
    	var b bytes.Buffer
    	b.Grow(64)
    	b.Write([]byte("abcde"))
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Aug 07 17:22:36 UTC 2024
    - 14.9K bytes
    - Viewed (0)
  3. src/bytes/buffer_test.go

    	}
    }
    
    func TestGrowOverflow(t *testing.T) {
    	defer func() {
    		if err := recover(); err != ErrTooLarge {
    			t.Errorf("after too-large Grow, recover() = %v; want %v", err, ErrTooLarge)
    		}
    	}()
    
    	buf := NewBuffer(make([]byte, 1))
    	const maxInt = int(^uint(0) >> 1)
    	buf.Grow(maxInt)
    }
    
    // Was a bug: used to give EOF reading empty slice at EOF.
    func TestReadEmptyAtEOF(t *testing.T) {
    	b := new(Buffer)
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Sep 03 20:55:15 UTC 2024
    - 18.6K bytes
    - Viewed (0)
  4. callbacks/create.go

    					}
    					db.Statement.AddClause(clause.Returning{Columns: fromColumns})
    				}
    			}
    		}
    
    		if db.Statement.SQL.Len() == 0 {
    			db.Statement.SQL.Grow(180)
    			db.Statement.AddClauseIfNotExists(clause.Insert{})
    			db.Statement.AddClause(ConvertToCreateValues(db.Statement))
    
    			db.Statement.Build(db.Statement.BuildClauses...)
    		}
    
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Mon Apr 08 03:29:55 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  5. okhttp/src/main/kotlin/okhttp3/internal/http2/Hpack.kt

            val entriesEvicted = evictToRecoverBytes(bytesToRecover)
    
            if (index == -1) { // Adding a value to the dynamic table.
              if (headerCount + 1 > dynamicTable.size) { // Need to grow the dynamic table.
                val doubled = arrayOfNulls<Header>(dynamicTable.size * 2)
                System.arraycopy(dynamicTable, 0, doubled, dynamicTable.size, dynamicTable.size)
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 22.5K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/escape/UnicodeEscaper.java

                    + " in '"
                    + seq
                    + "'");
          }
        }
        throw new IndexOutOfBoundsException("Index exceeds specified range");
      }
    
      /**
       * Helper method to grow the character buffer as needed, this only happens once in a while so it's
       * ok if it's in a method call. If the index passed in is 0 then no copying will be done.
       */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jan 18 20:55:09 UTC 2022
    - 13.2K bytes
    - Viewed (0)
  7. callbacks/query.go

    func BuildQuerySQL(db *gorm.DB) {
    	if db.Statement.Schema != nil {
    		for _, c := range db.Statement.Schema.QueryClauses {
    			db.Statement.AddClause(c)
    		}
    	}
    
    	if db.Statement.SQL.Len() == 0 {
    		db.Statement.SQL.Grow(100)
    		clauseSelect := clause.Select{Distinct: db.Statement.Distinct}
    
    		if db.Statement.ReflectValue.Kind() == reflect.Struct && db.Statement.ReflectValue.Type() == db.Statement.Schema.ModelType {
    			var conds []clause.Expression
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Thu Aug 22 11:03:42 UTC 2024
    - 10.1K bytes
    - Viewed (1)
  8. android/guava/src/com/google/common/primitives/Booleans.java

       *
       * @param array the source array
       * @param minLength the minimum length the returned array must guarantee
       * @param padding an extra amount to "grow" the array by if growth is necessary
       * @throws IllegalArgumentException if {@code minLength} or {@code padding} is negative
       * @return an array containing the values of {@code array}, with guaranteed minimum length {@code
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 20.4K bytes
    - Viewed (0)
  9. guava/src/com/google/common/primitives/Booleans.java

       *
       * @param array the source array
       * @param minLength the minimum length the returned array must guarantee
       * @param padding an extra amount to "grow" the array by if growth is necessary
       * @throws IllegalArgumentException if {@code minLength} or {@code padding} is negative
       * @return an array containing the values of {@code array}, with guaranteed minimum length {@code
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 20.4K bytes
    - Viewed (0)
  10. guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java

       * speed).
       *
       * To deal with such scenarios, we add an extra dimension, that of "past underutilization",
       * modeled by "storedPermits" variable. This variable is zero when there is no underutilization,
       * and it can grow up to maxStoredPermits, for sufficiently large underutilization. So, the
       * requested permits, by an invocation acquire(permits), are served from:
       *
       * - stored permits (if available)
       *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Apr 04 09:45:04 UTC 2023
    - 19.3K bytes
    - Viewed (0)
Back to top