Search Options

Results per page
Sort
Preferred Languages
Advance

Results 891 - 900 of 1,095 for appendTo (0.25 sec)

  1. docs/bigdata/README.md

    fs.s3a.block.size=512M
    fs.s3a.buffer.dir=${hadoop.tmp.dir}/s3a
    fs.s3a.committer.magic.enabled=false
    fs.s3a.committer.name=directory
    fs.s3a.committer.staging.abort.pending.uploads=true
    fs.s3a.committer.staging.conflict-mode=append
    fs.s3a.committer.staging.tmp.path=/tmp/staging
    fs.s3a.committer.staging.unique-filenames=true
    fs.s3a.connection.establish.timeout=5000
    fs.s3a.connection.ssl.enabled=false
    fs.s3a.connection.timeout=200000
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 29 04:28:45 UTC 2022
    - 14.7K bytes
    - Viewed (0)
  2. internal/s3select/jstream/decoder.go

    	if c = d.skipSpaces(); c == ']' {
    		goto out
    	}
    
    scan:
    	if v, err = d.emitAny(); err != nil {
    		goto out
    	}
    
    	if d.depth > d.emitDepth { // skip alloc for array if it won't be emitted
    		array = append(array, v)
    	}
    
    	// next token must be ',' or ']'
    	switch c = d.skipSpaces(); c {
    	case ',':
    		d.skipSpaces()
    		goto scan
    	case ']':
    		goto out
    	default:
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 23 19:35:41 UTC 2024
    - 13.5K bytes
    - Viewed (0)
  3. 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 Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Apr 23 18:58:53 UTC 2021
    - 5.7K bytes
    - Viewed (0)
  4. internal/crypto/sse-s3.go

    	}
    	keys := make([]ObjectKey, 0, len(metadata))
    	for i := range metadata {
    		key, err := s3.UnsealObjectKey(k, metadata[i], buckets[i], objects[i])
    		if err != nil {
    			return nil, err
    		}
    		keys = append(keys, key)
    	}
    	return keys, nil
    }
    
    // CreateMetadata encodes the sealed object key into the metadata and returns
    // the modified metadata. If the keyID and the kmsKey is not empty it encodes
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue May 07 23:55:37 UTC 2024
    - 7.6K bytes
    - Viewed (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);
        }
    
        public static SuggestSettingsBuilder builder() {
    Registered: Fri Nov 08 09:08:12 UTC 2024
    - Last Modified: Sat Oct 12 00:10:39 UTC 2024
    - 11.7K bytes
    - Viewed (0)
  6. docs/en/docs/js/termynal.js

            // moving as she/he scrolls
            const finish = this.generateFinish()
            finish.style.visibility = 'hidden'
            this.container.appendChild(finish)
            // Appends dynamically loaded lines to existing line elements.
            this.lines = [...this.container.querySelectorAll(`[${this.pfx}]`)].concat(this.lineData);
            for (let line of this.lines) {
                line.style.visibility = 'hidden'
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Thu May 12 00:06:16 UTC 2022
    - 9.3K bytes
    - Viewed (0)
  7. cmd/erasure-sets_test.go

    		// so that newErasureSets initializes non existing paths
    		// and successfully returns initialized object layer.
    		disk := filepath.Join(globalTestTmpDir, "minio-"+nextSuffix())
    		erasureDisks = append(erasureDisks, disk)
    		defer os.RemoveAll(disk)
    	}
    
    	endpoints := mustGetNewEndpoints(0, 16, erasureDisks...)
    	_, _, err := waitForFormatErasure(true, endpoints, 1, 0, 16, "")
    	if err != errInvalidArgument {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Feb 12 07:21:56 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  8. android/guava/pom.xml

      <build>
        <resources>
          <resource>
            <directory>..</directory>
            <includes>
              <include>LICENSE</include> <!-- copied from the parent pom because I couldn't figure out a way to make combine.children="append" work -->
              <include>proguard/*</include>
            </includes>
            <targetPath>META-INF</targetPath>
          </resource>
        </resources>
        <plugins>
          <plugin>
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Jul 24 18:53:31 UTC 2024
    - 9.1K bytes
    - Viewed (0)
  9. src/archive/tar/reader.go

    			if (len(sparseMap)%2 == 0 && key != paxGNUSparseOffset) ||
    				(len(sparseMap)%2 == 1 && key != paxGNUSparseNumBytes) ||
    				strings.Contains(value, ",") {
    				return nil, ErrHeader
    			}
    			sparseMap = append(sparseMap, value)
    		default:
    			paxHdrs[key] = value
    		}
    	}
    	if len(sparseMap) > 0 {
    		paxHdrs[paxGNUSparseMap] = strings.Join(sparseMap, ",")
    	}
    	return paxHdrs, nil
    }
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Mar 08 01:59:14 UTC 2024
    - 26.8K bytes
    - Viewed (0)
  10. licenses/github.com/klauspost/compress/LICENSE

          Object form, made available under the License, as indicated by a
          copyright notice that is included in or attached to the work
          (an example is provided in the Appendix below).
    
          "Derivative Works" shall mean any work, whether in Source or Object
          form, that is based on (or derived from) the Work and for which the
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Tue Nov 30 19:13:15 UTC 2021
    - 16.3K bytes
    - Viewed (0)
Back to top