Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 261 - 270 of 375 for olen (0.02 seconds)

  1. src/archive/tar/reader_test.go

    			}
    
    			for i, hdr := range hdrs {
    				if i >= len(v.headers) {
    					t.Fatalf("entry %d: unexpected header:\ngot %+v", i, *hdr)
    				}
    				if !reflect.DeepEqual(*hdr, *v.headers[i]) {
    					t.Fatalf("entry %d: incorrect header:\ngot  %+v\nwant %+v", i, *hdr, *v.headers[i])
    				}
    			}
    			if len(hdrs) != len(v.headers) {
    				t.Fatalf("got %d headers, want %d headers", len(hdrs), len(v.headers))
    			}
    
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Dec 30 15:28:53 GMT 2025
    - 47.5K bytes
    - Click Count (0)
  2. src/main/java/org/codelibs/fess/timer/SystemMonitorTarget.java

            buf.append("\"process\":{");
            final ProcessProbe processProbe = ProcessProbe.getInstance();
            buf.append("\"file_descriptor\":{");
            append(buf, "open", () -> processProbe.getOpenFileDescriptorCount()).append(',');
            append(buf, "max", () -> processProbe.getMaxFileDescriptorCount());
            buf.append("},");
            buf.append("\"cpu\":{");
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Jul 17 08:28:31 GMT 2025
    - 7.8K bytes
    - Click Count (0)
  3. okhttp/src/commonJvmAndroid/kotlin/okhttp3/Address.kt

    /*
     * Copyright (C) 2012 The Android Open Source Project
     *
     * Licensed under the Apache License, Version 2.0 (the "License");
     * you may not use this file except in compliance with the License.
     * You may obtain a copy of the License at
     *
     *      http://www.apache.org/licenses/LICENSE-2.0
     *
     * Unless required by applicable law or agreed to in writing, software
     * distributed under the License is distributed on an "AS IS" BASIS,
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Mar 19 19:25:20 GMT 2025
    - 7.3K bytes
    - Click Count (0)
  4. src/main/java/jcifs/internal/dtyp/ACE.java

     * are "allowed". If all of the desired access bits are not "allowed"
     * the then same process is repeated for inherited ACEs.
     * <p>
     * For example, if user <code>WNET\alice</code> tries to open a file
     * with desired access bits <code>0x00000003</code> (<code>FILE_READ_DATA |
     * FILE_WRITE_DATA</code>) and the target file has the following security
     * descriptor ACEs:
     *
     * <pre>
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 5.6K bytes
    - Click Count (0)
  5. src/main/java/jcifs/internal/smb1/com/SmbComWriteAndX.java

         * @param len the number of bytes to write
         */
        public final void setParam(final int fid, final long offset, final int remaining, final byte[] b, final int off, final int len) {
            this.fid = fid;
            this.offset = offset;
            this.remaining = remaining;
            this.b = b;
            this.off = off;
            this.dataLength = len;
            this.digest = null; /*
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 6.1K bytes
    - Click Count (0)
  6. src/main/java/jcifs/smb/SmbFile.java

                }
    
                for (int off = 0; off < sids.length; off += 64) {
                    int len = sids.length - off;
                    if (len > 64) {
                        len = 64;
                    }
    
                    getContext().getSIDResolver().resolveSids(getContext(), server, sids, off, len);
                }
            } else {
                for (ai = 0; ai < aces.length; ai++) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 30 05:58:03 GMT 2025
    - 103.2K bytes
    - Click Count (0)
  7. docs/tr/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    Nelerin değiştiğini daha iyi anlamak için okuyabilirsiniz.
    
    ## Testler { #tests }
    
    Uygulamanız için [testleriniz](../tutorial/testing.md) olduğundan ve bunları continuous integration (CI) üzerinde çalıştırdığınızdan emin olun.
    
    Bu şekilde yükseltmeyi yapabilir ve her şeyin hâlâ beklendiği gibi çalıştığını doğrulayabilirsiniz.
    
    ## `bump-pydantic` { #bump-pydantic }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 07:53:17 GMT 2026
    - 6K bytes
    - Click Count (0)
  8. docs/debugging/reorder-disks/main.go

    }
    
    func getMountMap() (map[string]string, error) {
    	result := make(map[string]string)
    
    	mountInfo, err := os.Open("/proc/self/mountinfo")
    	if err != nil {
    		return nil, err
    	}
    	defer mountInfo.Close()
    
    	scanner := bufio.NewScanner(mountInfo)
    	for scanner.Scan() {
    		s := strings.Split(scanner.Text(), " ")
    		if len(s) != 11 {
    			return nil, errors.New("unsupported /proc/self/mountinfo format")
    		}
    		result[s[2]] = s[9]
    	}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri May 24 23:05:23 GMT 2024
    - 5.4K bytes
    - Click Count (0)
  9. docs/es/docs/tutorial/first-steps.md

    FastAPI Cloud es el sponsor principal y proveedor de financiación para los proyectos open source de *FastAPI and friends*. ✨
    
    #### Despliega en otros proveedores cloud { #deploy-to-other-cloud-providers }
    
    FastAPI es open source y basado en estándares. Puedes desplegar apps de FastAPI en cualquier proveedor cloud que elijas.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:15:55 GMT 2026
    - 13.9K bytes
    - Click Count (0)
  10. docs/fr/docs/tutorial/first-steps.md

    FastAPI Cloud est le sponsor principal et le financeur des projets open source *FastAPI and friends*. ✨
    
    #### Déployer sur d’autres fournisseurs cloud { #deploy-to-other-cloud-providers }
    
    FastAPI est open source et basé sur des standards. Vous pouvez déployer des applications FastAPI chez n’importe quel fournisseur cloud de votre choix.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 15.1K bytes
    - Click Count (0)
Back to Top