Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 101 - 110 of 118 for Getenv (0.15 seconds)

  1. docs/fr/docs/tutorial/security/index.md

    ///
    
    ## OpenID Connect { #openid-connect }
    
    OpenID Connect est une autre spécification, basée sur **OAuth2**.
    
    Elle étend simplement OAuth2 en précisant certains points relativement ambigus dans OAuth2, afin d'essayer de la rendre plus interopérable.
    
    Par exemple, la connexion Google utilise OpenID Connect (qui, en arrière-plan, utilise OAuth2).
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Feb 14 08:12:41 GMT 2026
    - 5.2K bytes
    - Click Count (0)
  2. src/archive/zip/zip_test.go

    // Tests that involve both reading and writing.
    
    package zip
    
    import (
    	"bytes"
    	"cmp"
    	"errors"
    	"fmt"
    	"hash"
    	"internal/testenv"
    	"io"
    	"runtime"
    	"slices"
    	"strings"
    	"testing"
    	"time"
    )
    
    func TestOver65kFiles(t *testing.T) {
    	if testing.Short() && testenv.Builder() == "" {
    		t.Skip("skipping in short mode")
    	}
    	buf := new(strings.Builder)
    	w := NewWriter(buf)
    	const nFiles = (1 << 16) + 42
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu May 23 01:00:11 GMT 2024
    - 19.6K bytes
    - Click Count (0)
  3. src/archive/tar/tar_test.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    package tar
    
    import (
    	"bytes"
    	"errors"
    	"fmt"
    	"internal/testenv"
    	"io"
    	"io/fs"
    	"maps"
    	"math"
    	"os"
    	"path"
    	"path/filepath"
    	"reflect"
    	"slices"
    	"strings"
    	"testing"
    	"time"
    )
    
    type testError struct{ error }
    
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jul 25 00:25:45 GMT 2024
    - 23.9K bytes
    - Click Count (0)
  4. src/bytes/buffer_test.go

    // Copyright 2009 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    package bytes_test
    
    import (
    	. "bytes"
    	"fmt"
    	"internal/testenv"
    	"io"
    	"math/rand"
    	"strconv"
    	"testing"
    	"unicode/utf8"
    )
    
    const N = 10000       // make this bigger for a larger (and slower) test
    var testString string // test data for write tests
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Nov 14 19:01:17 GMT 2025
    - 19.4K bytes
    - Click Count (0)
  5. src/archive/tar/reader_test.go

    				}
    			default:
    				t.Fatalf("test %d.%d, unknown test operation: %T", i, j, tf)
    			}
    		}
    	}
    }
    
    func TestInsecurePaths(t *testing.T) {
    	t.Setenv("GODEBUG", "tarinsecurepath=0")
    	for _, path := range []string{
    		"../foo",
    		"/foo",
    		"a/b/../../../c",
    	} {
    		var buf bytes.Buffer
    		tw := NewWriter(&buf)
    		tw.WriteHeader(&Header{
    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)
  6. docs/de/docs/tutorial/dependencies/dependencies-with-yield.md

    Und Sie könnten eine einzelne Abhängigkeit haben, die auf mehreren ge`yield`eten Abhängigkeiten basiert, usw.
    
    Sie können beliebige Kombinationen von Abhängigkeiten haben.
    
    **FastAPI** stellt sicher, dass alles in der richtigen Reihenfolge ausgeführt wird.
    
    /// note | Technische Details
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 14.4K bytes
    - Click Count (0)
  7. src/main/webapp/js/admin/popper.min.js

    null===e.parentNode?e:d(e.parentNode)}function a(e,t){if(!e||!e.nodeType||!t||!t.nodeType)return document.documentElement;var o=e.compareDocumentPosition(t)&Node.DOCUMENT_POSITION_FOLLOWING,n=o?e:t,i=o?t:e,r=document.createRange();r.setStart(n,0),r.setEnd(i,0);var l=r.commonAncestorContainer;if(e!==l&&t!==l||n.contains(i))return s(l)?l:p(l);var f=d(e);return f.host?a(f.host,t):a(e,d(t).host)}function l(e){var t=1<arguments.length&&void 0!==arguments[1]?arguments[1]:'top',o='top'===t?'scrollTop':'s...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 20.7K bytes
    - Click Count (0)
  8. src/bytes/bytes_test.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    package bytes_test
    
    import (
    	. "bytes"
    	"fmt"
    	"internal/asan"
    	"internal/testenv"
    	"iter"
    	"math"
    	"math/rand"
    	"slices"
    	"strings"
    	"testing"
    	"unicode"
    	"unicode/utf8"
    	"unsafe"
    )
    
    func sliceOfString(s [][]byte) []string {
    	result := make([]string, len(s))
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Mar 11 03:07:05 GMT 2026
    - 62.9K bytes
    - Click Count (0)
  9. src/cmd/cgo/doc.go

    non-nil, even if the function call is successful. Unlike normal Go conventions,
    you should first check whether the call succeeded before checking the error
    result. For example:
    
    	n, err := C.setenv(key, value, 1)
    	if n != 0 {
    		// we know the call failed, so it is now valid to use err
    		return err
    	}
    
    Calling C function pointers is currently not supported, however you can
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Dec 08 22:37:14 GMT 2025
    - 43.9K bytes
    - Click Count (0)
  10. src/main/webapp/js/admin/popper.min.js.map

    &\n    Node.DOCUMENT_POSITION_FOLLOWING;\n  const start = order ? element1 : element2;\n  const end = order ? element2 : element1;\n\n  // Get common ancestor container\n  const range = document.createRange();\n  range.setStart(start, 0);\n  range.setEnd(end, 0);\n  const { commonAncestorContainer } = range;\n\n  // Both nodes are inside #document\n  if (\n    (element1 !== commonAncestorContainer &&\n      element2 !== commonAncestorContainer) ||\n    start.contains(end)\n  ) {\n    if (isOffset...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 120.9K bytes
    - Click Count (0)
Back to Top