Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 243 for iword (0.18 sec)

  1. src/go/internal/gccgoimporter/testdata/v1reflect.gox

     func (f <type 42>) .reflect.mustBe (expected <type 28>);
     func (f <type 42>) .reflect.mustBeExported ();
     func (f <type 42>) .reflect.mustBeAssignable ();
    >; }>
     func (v <type 1>) .reflect.iword () <type 43 ".reflect.iword" <type 7>>;
     func (v <type 1>) Addr () <type 1>;
     func (v <type 1>) Bool () <type -15>;
     func (v <type 1>) Bytes () <type 44 [] <type -20>>;
     func (v <type 1>) CanAddr () <type -15>;
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Sep 30 21:33:51 UTC 2021
    - 10.3K bytes
    - Viewed (0)
  2. pkg/collateral/control.go

    	-e "s/${LWORD}_filedir${RWORD}/__istio_filedir/g" \
    	-e "s/${LWORD}_get_comp_words_by_ref${RWORD}/__istio_get_comp_words_by_ref/g" \
    	-e "s/${LWORD}__ltrim_colon_completions${RWORD}/__istio_ltrim_colon_completions/g" \
    	-e "s/${LWORD}compgen${RWORD}/__istio_compgen/g" \
    	-e "s/${LWORD}compopt${RWORD}/__istio_compopt/g" \
    	-e "s/${LWORD}declare${RWORD}/builtin declare/g" \
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Wed Jan 10 03:51:36 UTC 2024
    - 17.8K bytes
    - Viewed (0)
  3. src/cmd/vendor/golang.org/x/arch/x86/x86asm/intel.go

    			prefix = "dword "
    		case STOSQ, MOVSQ, CMPSQ, LODSQ, SCASQ:
    			prefix = "qword "
    		case LAR:
    			prefix = "word "
    		case BOUND:
    			if inst.Mode == 32 {
    				prefix = "qword "
    			} else {
    				prefix = "dword "
    			}
    		case PREFETCHW, PREFETCHNTA, PREFETCHT0, PREFETCHT1, PREFETCHT2, CLFLUSH:
    			prefix = "zmmword "
    		}
    		switch inst.Op {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Nov 29 22:23:32 UTC 2017
    - 11.7K bytes
    - Viewed (0)
  4. src/math/big/int.go

    					q, r := aWord/bWord, aWord%bWord
    					aWord, bWord = bWord, r
    					ua, ub = ub, ua+q*ub
    					va, vb = vb, va+q*vb
    					even = !even
    				}
    
    				t.abs = t.abs.setWord(ua)
    				s.abs = s.abs.setWord(va)
    				t.neg = !even
    				s.neg = even
    
    				t.Mul(Ua, t)
    				s.Mul(Ub, s)
    
    				Ua.Add(t, s)
    			} else {
    				for bWord != 0 {
    					aWord, bWord = bWord, aWord%bWord
    				}
    			}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Mar 14 17:02:38 UTC 2024
    - 33.1K bytes
    - Viewed (0)
  5. src/internal/syscall/windows/registry/registry_test.go

    	{Type: registry.DWORD, Name: "Dword1", Value: uint64(0)},
    	{Type: registry.DWORD, Name: "Dword2", Value: uint64(1)},
    	{Type: registry.DWORD, Name: "Dword3", Value: uint64(0xff)},
    	{Type: registry.DWORD, Name: "Dword4", Value: uint64(0xffff)},
    	{Type: registry.QWORD, Name: "Qword1", Value: uint64(0)},
    	{Type: registry.QWORD, Name: "Qword2", Value: uint64(1)},
    	{Type: registry.QWORD, Name: "Qword3", Value: uint64(0xff)},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Mar 06 19:19:00 UTC 2024
    - 18.5K bytes
    - Viewed (0)
  6. src/internal/syscall/windows/registry/value.go

    // If value is not DWORD or QWORD, it will return the correct value
    // type and ErrUnexpectedType.
    func (k Key) GetIntegerValue(name string) (val uint64, valtype uint32, err error) {
    	data, typ, err2 := k.getValue(name, make([]byte, 8))
    	if err2 != nil {
    		return 0, typ, err2
    	}
    	switch typ {
    	case DWORD:
    		if len(data) != 4 {
    			return 0, typ, errors.New("DWORD value is not 4 bytes long")
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Sep 18 20:01:34 UTC 2023
    - 11K bytes
    - Viewed (0)
  7. src/math/big/arith_test.go

    	}
    }
    
    // TODO(gri) mulAddVWW and divWVW are symmetric operations but
    // their signature is not symmetric. Try to unify.
    
    type funWVW func(z []Word, xn Word, x []Word, y Word) (r Word)
    type argWVW struct {
    	z  nat
    	xn Word
    	x  nat
    	y  Word
    	r  Word
    }
    
    func testFunWVW(t *testing.T, msg string, f funWVW, a argWVW) {
    	z := make(nat, len(a.z))
    	r := f(z, a.xn, a.x, a.y)
    	for i, zi := range z {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Nov 02 14:43:52 UTC 2022
    - 19.9K bytes
    - Viewed (0)
  8. src/mime/encodedword.go

    }
    
    // Decode decodes an RFC 2047 encoded-word.
    func (d *WordDecoder) Decode(word string) (string, error) {
    	// See https://tools.ietf.org/html/rfc2047#section-2 for details.
    	// Our decoder is permissive, we accept empty encoded-text.
    	if len(word) < 8 || !strings.HasPrefix(word, "=?") || !strings.HasSuffix(word, "?=") || strings.Count(word, "?") != 4 {
    		return "", errInvalidWord
    	}
    	word = word[2 : len(word)-2]
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Mar 21 16:12:35 UTC 2024
    - 10K bytes
    - Viewed (0)
  9. src/math/big/arith_arm64.s

    	BEQ	done
    copy_4:				// no carry flag, copy the rest
    	vwOneIterCopy(R0, done)
    	B	copy_4
    
    // func shlVU(z, x []Word, s uint) (c Word)
    // This implementation handles the shift operation from the high word to the low word,
    // which may be an error for the case where the low word of x overlaps with the high
    // word of z. When calling this function directly, you need to pay attention to this
    // situation.
    TEXT ·shlVU(SB),NOSPLIT,$0
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:27 UTC 2023
    - 11.8K bytes
    - Viewed (0)
  10. src/math/big/natconv.go

    			}
    			prev = '_'
    		} else {
    			// convert rune into digit value d1
    			var d1 Word
    			switch {
    			case '0' <= ch && ch <= '9':
    				d1 = Word(ch - '0')
    			case 'a' <= ch && ch <= 'z':
    				d1 = Word(ch - 'a' + 10)
    			case 'A' <= ch && ch <= 'Z':
    				if b <= maxBaseSmall {
    					d1 = Word(ch - 'A' + 10)
    				} else {
    					d1 = Word(ch - 'A' + maxBaseSmall)
    				}
    			default:
    				d1 = MaxBase + 1
    			}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Nov 18 17:59:44 UTC 2022
    - 14.6K bytes
    - Viewed (0)
Back to top