Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 12 for tok (0.02 sec)

  1. src/cmd/asm/internal/lex/tokenizer.go

    	s := t.s
    	for {
    		t.tok = ScanToken(s.Scan())
    		if t.tok != scanner.Comment {
    			break
    		}
    		text := s.TokenText()
    		t.line += strings.Count(text, "\n")
    		if constraint.IsGoBuild(text) {
    			t.tok = BuildComment
    			break
    		}
    	}
    	switch t.tok {
    	case '\n':
    		t.line++
    	case '-':
    		if s.Peek() == '>' {
    			s.Next()
    			t.tok = ARR
    			return ARR
    		}
    	case '@':
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Aug 04 20:35:21 UTC 2022
    - 3K bytes
    - Viewed (0)
  2. src/cmd/asm/internal/lex/input.go

    	nesting := 0
    	var tokens []Token
    	for {
    		tok := in.Stack.Next()
    		if tok == scanner.EOF || tok == '\n' {
    			in.Error("unterminated arg list invoking macro:", macro.name)
    		}
    		if nesting == 0 && (tok == ')' || tok == ',') {
    			return tokens, tok
    		}
    		if tok == '(' {
    			nesting++
    		}
    		if tok == ')' {
    			nesting--
    		}
    		tokens = append(tokens, Make(tok, in.Stack.Text()))
    	}
    }
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Sep 06 13:17:27 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  3. src/cmd/asm/internal/asm/parse.go

    			if tok == '\n' || tok == ';' || (nesting == 0 && (tok == ',' || tok == ':')) {
    				if tok == ':' {
    					// Remember this location so we can swap the operands below.
    					if colon >= 0 {
    						p.errorf("invalid ':' in operand")
    						return word, cond, operands, true
    					}
    					colon = len(operands)
    				}
    				break
    			}
    			if tok == '(' || tok == '[' {
    				nesting++
    			}
    			if tok == ')' || tok == ']' {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Sep 04 18:16:59 UTC 2024
    - 36.9K bytes
    - Viewed (0)
  4. compat/maven-artifact/src/main/java/org/apache/maven/artifact/versioning/DefaultArtifactVersion.java

                    if (minorVersion == null) {
                        fallback = true;
                    }
                }
                if (idx < tok.length) {
                    incrementalVersion = getNextIntegerToken(tok[idx++]);
                    if (incrementalVersion == null) {
                        fallback = true;
                    }
                }
                if (idx < tok.length) {
                    qualifier = tok[idx++];
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 6K bytes
    - Viewed (0)
  5. compat/maven-embedder/src/main/java/org/apache/maven/cli/props/MavenPropertiesLoader.java

                StringBuilder tokBuf = new StringBuilder(10);
                String tok;
                boolean inQuote = false;
                boolean tokStarted = false;
                boolean exit = false;
                while ((st.hasMoreTokens()) && (!exit)) {
                    tok = st.nextToken(tokenList);
                    switch (tok) {
                        case "\"":
                            inQuote = !inQuote;
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 6.5K bytes
    - Viewed (0)
  6. src/cmd/asm/internal/asm/expr_test.go

    		result := int64(p.expr())
    		if result != test.output {
    			t.Errorf("%d: %q evaluated to %d; expected %d", i, test.input, result, test.output)
    		}
    		tok := p.next()
    		if test.atEOF && tok.ScanToken != scanner.EOF {
    			t.Errorf("%d: %q: at EOF got %s", i, test.input, tok)
    		} else if !test.atEOF && tok.ScanToken == scanner.EOF {
    			t.Errorf("%d: %q: expected not EOF but at EOF", i, test.input)
    		}
    	}
    }
    
    type badExprTest struct {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Aug 29 07:48:38 UTC 2023
    - 3.2K bytes
    - Viewed (0)
  7. src/cmd/asm/internal/lex/lex_test.go

    }
    
    // drain returns a single string representing the processed input tokens.
    func drain(input *Input) string {
    	var buf strings.Builder
    	for {
    		tok := input.Next()
    		if tok == scanner.EOF {
    			return buf.String()
    		}
    		if tok == '#' {
    			continue
    		}
    		if buf.Len() > 0 {
    			buf.WriteByte('.')
    		}
    		buf.WriteString(input.Text())
    	}
    }
    
    type badLexTest struct {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Aug 29 07:48:38 UTC 2023
    - 5.8K bytes
    - Viewed (0)
  8. src/cmd/asm/internal/lex/lex.go

    func Tokenize(str string) []Token {
    	t := NewTokenizer("command line", strings.NewReader(str), nil)
    	var tokens []Token
    	for {
    		tok := t.Next()
    		if tok == scanner.EOF {
    			break
    		}
    		tokens = append(tokens, Make(tok, t.Text()))
    	}
    	return tokens
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Aug 29 18:31:05 UTC 2023
    - 4.1K bytes
    - Viewed (0)
  9. src/test/java/jcifs/tests/PACTest.java

                KerberosKey[] keys = kt.getKeys(new KerberosPrincipal("cifs/******@****.***FIELD", KerberosPrincipal.KRB_NT_PRINCIPAL));
                KerberosToken tok = new KerberosToken(krbToken, keys);
    
                KerberosEncData ed = tok.getTicket().getEncData();
                Assert.assertEquals(1, ed.getUserAuthorizations().size());
    
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Oct 01 12:01:17 UTC 2023
    - 22.3K bytes
    - Viewed (0)
  10. src/archive/tar/reader.go

    	}
    
    	// nextToken gets the next token delimited by a newline. This assumes that
    	// at least one newline exists in the buffer.
    	nextToken := func() string {
    		cntNewline--
    		tok, _ := buf.ReadString('\n')
    		return strings.TrimRight(tok, "\n")
    	}
    
    	// Parse for the number of entries.
    	// Use integer overflow resistant math to check this.
    	if err := feedTokens(1); err != nil {
    		return nil, err
    	}
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Mar 08 01:59:14 UTC 2024
    - 26.8K bytes
    - Viewed (0)
Back to top