Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 871 - 880 of 1,007 for uaAppend (0.05 seconds)

  1. guava/src/com/google/common/collect/FluentIterable.java

       * {@code Iterator} supports it.
       *
       * <p><b>{@code Stream} equivalent:</b> {@link Stream#concat}.
       *
       * @since 18.0
       */
      public final FluentIterable<E> append(Iterable<? extends E> other) {
        return FluentIterable.concat(getDelegate(), other);
      }
    
      /**
       * Returns a fluent iterable whose iterators traverse first the elements of this fluent iterable,
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 34.7K bytes
    - Click Count (0)
  2. src/test/java/org/codelibs/fess/llm/AbstractLlmClientTest.java

                // Capture the system message
                for (final LlmMessage msg : request.getMessages()) {
                    if ("system".equals(msg.getRole())) {
                        captured.append(msg.getContent());
                    }
                }
                callback.onChunk("response", true);
            });
    
            client.generateSummaryResponse("summarize", documents, history, (chunk, done) -> {});
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Mar 19 07:04:54 GMT 2026
    - 53K bytes
    - Click Count (0)
  3. cmd/encryption-v1.go

    				ETag, err := etag.Parse(object.ETag)
    				if err != nil {
    					continue
    				}
    				if ETag.IsEncrypted() {
    					SSES3SinglePartObjects[i] = true
    					metadata = append(metadata, object.UserDefined)
    					buckets = append(buckets, object.Bucket)
    					names = append(names, object.Name)
    				}
    			}
    		}
    
    		// If there are no SSE-S3 single-part objects
    		// we can skip the decryption process. However,
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 38K bytes
    - Click Count (0)
  4. guava/src/com/google/common/collect/RegularImmutableMap.java

          ImmutableMapEntry<K, V> effectiveEntry =
              checkNoConflictInKeyBucket(key, value, keyBucketHead, throwIfDuplicateKeys);
          if (effectiveEntry == null) {
            // prepend, not append, so the entries can be immutable
            effectiveEntry =
                (keyBucketHead == null)
                    ? makeImmutable(entry, key, value)
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 15.7K bytes
    - Click Count (0)
  5. src/main/java/org/codelibs/fess/suggest/settings/SuggestSettings.java

                String line;
                while ((line = br.readLine()) != null) {
                    sb.append(line);
                }
            }
            return sb.toString().replaceAll(Pattern.quote("${fess.dictionary.path}"), dictionaryPath);
        }
    
        /**
         * Default keys for suggest settings.
         */
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Sat Mar 14 02:35:38 GMT 2026
    - 18.7K bytes
    - Click Count (0)
  6. cmd/bucket-replication.go

    	if opts == nil {
    		opts = &validateReplicationDestinationOptions{}
    	}
    	var arns []string
    	if rCfg.RoleArn != "" {
    		arns = append(arns, rCfg.RoleArn)
    	} else {
    		for _, rule := range rCfg.Rules {
    			arns = append(arns, rule.Destination.String())
    		}
    	}
    	var sameTarget bool
    	for _, arnStr := range arns {
    		arn, err := madmin.ParseARN(arnStr)
    		if err != nil {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 118.2K bytes
    - Click Count (0)
  7. src/test/java/jcifs/internal/fscc/FileBothDirectoryInfoTest.java

            // Prepare test data with long filename (255 characters)
            StringBuilder longName = new StringBuilder();
            for (int i = 0; i < 255; i++) {
                longName.append((char) ('a' + (i % 26)));
            }
            String expectedFilename = longName.toString();
            byte[] buffer = createValidBuffer(expectedFilename, "LONGNA~1.TXT", true);
    
            // Decode
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 20.9K bytes
    - Click Count (0)
  8. tests/scan_test.go

    		Age  int
    	}
    
    	var results []Result
    	for rows.Next() {
    		var result Result
    		if err := DB.ScanRows(rows, &result); err != nil {
    			t.Errorf("should get no error, but got %v", err)
    		}
    		results = append(results, result)
    	}
    
    	sort.Slice(results, func(i, j int) bool {
    		return strings.Compare(results[i].Name, results[j].Name) <= -1
    	})
    
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Wed Jun 12 10:57:36 GMT 2024
    - 10.9K bytes
    - Click Count (0)
  9. internal/grid/manager.go

    func (m *Manager) HostName() string {
    	return m.local
    }
    
    // Targets returns the names of all remote targets.
    func (m *Manager) Targets() []string {
    	var res []string
    	for k := range m.targets {
    		res = append(res, k)
    	}
    	return res
    }
    
    // debugMsg should *only* be used by tests.
    //
    //lint:ignore U1000 This is used by tests.
    func (m *Manager) debugMsg(d debugMsg, args ...any) {
    	for _, c := range m.targets {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Nov 12 20:41:41 GMT 2024
    - 10.8K bytes
    - Click Count (0)
  10. src/archive/zip/writer_test.go

    	if err != nil {
    		t.Fatal(err)
    	}
    	if err := w.Close(); err != nil {
    		t.Fatal(err)
    	}
    
    	// Add subfolder into fsys to match what we'll read from the zip.
    	tests = append(tests[:2:2], WriteTest{Name: "subfolder", Mode: 0o555 | os.ModeDir}, tests[2])
    
    	// read it back
    	r, err := NewReader(bytes.NewReader(buf.Bytes()), int64(buf.Len()))
    	if err != nil {
    		t.Fatal(err)
    	}
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Jan 28 04:20:09 GMT 2025
    - 14.4K bytes
    - Click Count (0)
Back to Top