Search Options

Results per page
Sort
Preferred Languages
Advance

Results 551 - 560 of 906 for Append (0.06 sec)

  1. src/bufio/bufio_test.go

    	for i := 0; i < 100; i++ {
    		// Obtain a buffer to append to.
    		b := w.AvailableBuffer()
    		if w.Available() != cap(b) {
    			t.Fatalf("Available() = %v, want %v", w.Available(), cap(b))
    		}
    
    		// While not recommended, it is valid to append to a shifted buffer.
    		// This forces Write to copy the input.
    		if rn.Intn(8) == 0 && cap(b) > 0 {
    			b = b[1:1:cap(b)]
    		}
    
    		// Append a random integer of varying width.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Feb 07 01:08:54 UTC 2025
    - 51.6K bytes
    - Viewed (0)
  2. src/test/java/org/codelibs/fess/mylasta/direction/sponsor/FessListedClassificationProviderTest.java

        public void test_provide_withLongClassificationName() {
            // Test with very long classification name
            StringBuilder longName = new StringBuilder();
            for (int i = 0; i < 1000; i++) {
                longName.append("VeryLongClassificationName");
            }
            assertProvideThrowsException(longName.toString());
        }
    
        public void test_provide_withUnicodeCharacters() {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 7.5K bytes
    - Viewed (0)
  3. src/test/java/org/codelibs/fess/opensearch/client/SearchEngineClientExceptionTest.java

        }
    
        public void test_constructor_withLongMessage() {
            // Test constructor with long message
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < 1000; i++) {
                sb.append("Long message content ");
            }
            String message = sb.toString();
            SearchEngineClientException exception = new SearchEngineClientException(message);
    
            assertNotNull(exception);
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 6.9K bytes
    - Viewed (0)
  4. src/test/java/org/codelibs/fess/dict/stopwords/StopwordsItemTest.java

        }
    
        public void test_longStrings() {
            // Test with long strings
            StringBuilder longString = new StringBuilder();
            for (int i = 0; i < 1000; i++) {
                longString.append("word");
            }
            String longInput = longString.toString();
    
            StopwordsItem item = new StopwordsItem(1, longInput);
            assertEquals(longInput, item.getInput());
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 9.9K bytes
    - Viewed (0)
  5. src/bytes/bytes_test.go

    	for _, r16 := range rt.R16 {
    		for r := rune(r16.Lo); r <= rune(r16.Hi); r += rune(r16.Stride) {
    			if r != needle {
    				rs = append(rs, r)
    			}
    		}
    	}
    	for _, r32 := range rt.R32 {
    		for r := rune(r32.Lo); r <= rune(r32.Hi); r += rune(r32.Stride) {
    			if r != needle {
    				rs = append(rs, r)
    			}
    		}
    	}
    	// Shuffle the runes so that they are not in descending order.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Jul 28 18:13:58 UTC 2025
    - 62.9K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/hash/HashCode.java

       */
      @Override
      public final String toString() {
        byte[] bytes = getBytesInternal();
        StringBuilder sb = new StringBuilder(2 * bytes.length);
        for (byte b : bytes) {
          sb.append(hexDigits[(b >> 4) & 0xf]).append(hexDigits[b & 0xf]);
        }
        return sb.toString();
      }
    
      private static final char[] hexDigits = "0123456789abcdef".toCharArray();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 12.6K bytes
    - Viewed (0)
  7. cmd/streaming-signature-v4_test.go

    		{"10000000000000000", 0, "http chunk length too large"},
    		{"00000000000000001", 0, "http chunk length too large"}, // could accept if we wanted
    	}
    	for i := uint64(0); i <= 1234; i++ {
    		tests = append(tests, testCase{in: fmt.Sprintf("%x", i), want: i})
    	}
    	for _, tt := range tests {
    		got, err := parseHexUint([]byte(tt.in))
    		if tt.wantErr != "" {
    			if err != nil && !strings.Contains(err.Error(), tt.wantErr) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 5.7K bytes
    - Viewed (0)
  8. compat/maven-artifact/src/main/java/org/apache/maven/artifact/versioning/VersionRange.java

                for (Iterator<Restriction> i = restrictions.iterator(); i.hasNext(); ) {
                    Restriction r = i.next();
    
                    buf.append(r.toString());
    
                    if (i.hasNext()) {
                        buf.append(',');
                    }
                }
                return buf.toString();
            }
        }
    
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Wed Jul 23 17:27:08 UTC 2025
    - 19K bytes
    - Viewed (0)
  9. android/guava-testlib/src/com/google/common/collect/testing/google/ListGenerators.java

        @Override
        public List<Character> create(Character[] elements) {
          char[] chars = Chars.toArray(asList(elements));
          StringBuilder str = new StringBuilder();
          str.append(chars);
          return charactersOf(str);
        }
      }
    
      private abstract static class TestUnhashableListGenerator
          extends TestUnhashableCollectionGenerator<List<UnhashableObject>>
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 14:50:24 UTC 2024
    - 5K bytes
    - Viewed (0)
  10. docs/extensions/s3zip/README.md

    ## How to access to files inside a ZIP archive
    
    Accessing to contents inside an archive can be done using regular S3 API with a modified request path. You just need to append the path of the content inside the archive to the path of the archive itself.
    
    e.g.:
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Apr 10 16:28:27 UTC 2024
    - 3K bytes
    - Viewed (0)
Back to top