Search Options

Results per page
Sort
Preferred Languages
Advance

Results 91 - 100 of 628 for June (0.05 sec)

  1. src/cmd/compile/internal/syntax/scanner.go

    			panic("imperfect hash")
    		}
    		keywordMap[h] = tok
    	}
    }
    
    func lower(ch rune) rune     { return ('a' - 'A') | ch } // returns lower-case ch iff ch is ASCII letter
    func isLetter(ch rune) bool  { return 'a' <= lower(ch) && lower(ch) <= 'z' || ch == '_' }
    func isDecimal(ch rune) bool { return '0' <= ch && ch <= '9' }
    func isHex(ch rune) bool     { return '0' <= ch && ch <= '9' || 'a' <= lower(ch) && lower(ch) <= 'f' }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 28 18:17:41 UTC 2022
    - 17.1K bytes
    - Viewed (0)
  2. src/go/scanner/scanner.go

    }
    
    func digitVal(ch rune) int {
    	switch {
    	case '0' <= ch && ch <= '9':
    		return int(ch - '0')
    	case 'a' <= lower(ch) && lower(ch) <= 'f':
    		return int(lower(ch) - 'a' + 10)
    	}
    	return 16 // larger than any legal digit val
    }
    
    func lower(ch rune) rune     { return ('a' - 'A') | ch } // returns lower-case ch iff ch is ASCII letter
    func isDecimal(ch rune) bool { return '0' <= ch && ch <= '9' }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 12:02:03 UTC 2023
    - 24.3K bytes
    - Viewed (0)
  3. src/cmd/go/internal/work/exec_test.go

    	rBuffer := make([]rune, nRunes)
    	buf := bytes.NewBuffer([]byte(string(rBuffer)))
    
    	seed := time.Now().UnixNano()
    	t.Logf("rand seed: %v", seed)
    	rng := rand.New(rand.NewSource(seed))
    
    	for i := 0; i < 50; i++ {
    		// Generate a random string of runes.
    		buf.Reset()
    		for buf.Len() < sys.ExecArgLengthLimit+1 {
    			var r rune
    			for {
    				r = rune(rng.Intn(utf8.MaxRune + 1))
    				if utf8.ValidRune(r) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Oct 02 13:15:42 UTC 2021
    - 1.8K bytes
    - Viewed (0)
  4. src/unicode/digit_test.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    package unicode_test
    
    import (
    	"testing"
    	. "unicode"
    )
    
    var testDigit = []rune{
    	0x0030,
    	0x0039,
    	0x0661,
    	0x06F1,
    	0x07C9,
    	0x0966,
    	0x09EF,
    	0x0A66,
    	0x0AEF,
    	0x0B66,
    	0x0B6F,
    	0x0BE6,
    	0x0BEF,
    	0x0C66,
    	0x0CEF,
    	0x0D66,
    	0x0D6F,
    	0x0E50,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Sep 08 04:08:51 UTC 2014
    - 1.5K bytes
    - Viewed (0)
  5. test/initialize.go

    func f12(b []byte) [2][]byte { return [2][]byte{b, b} }
    
    var a12 = f12([]byte("hello"))
    var a13 = f12([]byte{1, 2, 3})
    var a14 = f12(make([]byte, 1))
    
    func f15(b []rune) [2][]rune { return [2][]rune{b, b} }
    
    var a15 = f15([]rune("hello"))
    var a16 = f15([]rune{1, 2, 3})
    
    type Same struct {
    	a, b interface{}
    }
    
    var same = []Same{
    	{a1, b1},
    	{a2, b2},
    	{a3, b3},
    	{a4, b4},
    	{a5, b5},
    	{a6, b6},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Nov 16 04:04:52 UTC 2022
    - 2.2K bytes
    - Viewed (0)
  6. src/vendor/golang.org/x/text/unicode/bidi/prop.go

    	return c
    }
    
    // IsBracket reports whether the rune is a bracket.
    func (p Properties) IsBracket() bool { return p.entry&0xF0 != 0 }
    
    // IsOpeningBracket reports whether the rune is an opening bracket.
    // IsBracket must return true.
    func (p Properties) IsOpeningBracket() bool { return p.entry&openMask != 0 }
    
    // TODO: find a better API and expose.
    func (p Properties) reverseBracket(r rune) rune {
    	return xorMasks[p.entry>>xorMaskShift] ^ r
    }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 11 20:28:54 UTC 2019
    - 5.7K bytes
    - Viewed (0)
  7. docs/fr/docs/tutorial/background-tasks.md

    ```
    
    **FastAPI** créera l'objet de type `BackgroundTasks` pour vous et le passera comme paramètre.
    
    ## Créer une fonction de tâche
    
    Une fonction à exécuter comme tâche d'arrière-plan est juste une fonction standard qui peut recevoir des paramètres.
    
    Elle peut être une fonction asynchrone (`async def`) ou une fonction normale (`def`), **FastAPI** saura la gérer correctement.
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu May 12 00:06:16 UTC 2022
    - 5.7K bytes
    - Viewed (0)
  8. docs/fr/docs/advanced/response-directly.md

    Vous pouvez mettre votre contenu XML dans une chaîne de caractères, la placer dans une `Response`, et la retourner :
    
    ```Python hl_lines="1  18"
    {!../../../docs_src/response_directly/tutorial002.py!}
    ```
    
    ## Notes
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu Apr 18 19:53:19 UTC 2024
    - 3.6K bytes
    - Viewed (0)
  9. test/utf.go

    package main
    
    import "unicode/utf8"
    
    func main() {
    	var chars [6]rune
    	chars[0] = 'a'
    	chars[1] = 'b'
    	chars[2] = 'c'
    	chars[3] = '\u65e5'
    	chars[4] = '\u672c'
    	chars[5] = '\u8a9e'
    	s := ""
    	for i := 0; i < 6; i++ {
    		s += string(chars[i])
    	}
    	var l = len(s)
    	for w, i, j := 0, 0, 0; i < l; i += w {
    		var r rune
    		r, w = utf8.DecodeRuneInString(s[i:len(s)])
    		if w == 0 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Feb 24 00:48:19 UTC 2012
    - 1.2K bytes
    - Viewed (0)
  10. test/alias3.dir/a.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    package a
    
    import "go/build"
    
    type (
    	Float64 = float64
    	Rune    = rune
    )
    
    type (
    	Int       int
    	IntAlias  = Int
    	IntAlias2 = IntAlias
    	S         struct {
    		Int
    		IntAlias
    		IntAlias2
    	}
    )
    
    type (
    	Context = build.Context
    )
    
    type (
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jan 20 05:55:53 UTC 2017
    - 540 bytes
    - Viewed (0)
Back to top