byte[] tok = new byte[] { 0x04, 0x01 };
                    byte[] buf = new byte[2 + 2 + der.length + 4];
                    int p = 0;
                    buf[p++] = tok[0];
                    buf[p++] = tok[1];
                    buf[p++] = 0x00;
                    buf[p++] = (byte) der.length;

        final String p = props.getProperty(key);
        if (p != null) {
            final StringTokenizer tok = new StringTokenizer(p, delim);
            final int len = tok.countTokens();
            final InetAddress[] arr = new InetAddress[len];
            for (int i = 0; i < len; i++) {
                final String addr = tok.nextToken();
                try {
                    arr[i] = InetAddress.getByName(addr);

        }
        try {
            NegTokenInit tok = new NegTokenInit(initialToken);
            if (log.isDebugEnabled()) {
                log.debug("Have initial token " + tok);
            }
            if (tok.getMechanisms() != null) {
                Set<ASN1ObjectIdentifier> mechs = new HashSet<>(Arrays.asList(tok.getMechanisms()));
                boolean foundKerberos = false;

        final String p = getProperty(key);
        if (p != null) {
            final StringTokenizer tok = new StringTokenizer(p, delim);
            final int len = tok.countTokens();
            final InetAddress[] arr = new InetAddress[len];
            for (int i = 0; i < len; i++) {
                final String addr = tok.nextToken();
                try {
                    arr[i] = InetAddress.getByName(addr);

                NegTokenInit tok = new NegTokenInit(initialToken);
                if (log.isDebugEnabled()) {
                    log.debug("Have initial token " + tok);
                }
                if (tok.getMechanisms() != null) {
                    Set<ASN1ObjectIdentifier> mechs = new HashSet<>(Arrays.asList(tok.getMechanisms()));

	}

	// 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
	}

DSTShifted","array1","array2","dontConvert","lengthDiff","diffs","compareArrays","proto$1","get$1","index","field","setter","listMonthsImpl","out","listWeekdaysImpl","localeSorted","shift","_calendar","_longDateFormat","formatUpper","toUpperCase","tok","_invalidDate","_ordinal","isFuture","_relativeTime","pastFuture","source","_eras","Infinity","isFormat","_monthsShort","monthName","_monthsParseExact","ii","llc","toLocaleLowerCase","_monthsParse","_longMonthsParse","_shortMonthsParse","firstDayO...

pkg go/ast, type ArrayType struct, Len Expr
pkg go/ast, type AssignStmt struct
pkg go/ast, type AssignStmt struct, Lhs []Expr
pkg go/ast, type AssignStmt struct, Rhs []Expr
pkg go/ast, type AssignStmt struct, Tok token.Token
pkg go/ast, type AssignStmt struct, TokPos token.Pos
pkg go/ast, type BadDecl struct
pkg go/ast, type BadDecl struct, From token.Pos
pkg go/ast, type BadDecl struct, To token.Pos

Drop header comments. cmap[ast.Node(f)] = nil // Remove top-level consts used across the main and generated files. var newDecls []ast.Decl for _, decl := range f.Decls { switch d := decl.(type) { case *ast.GenDecl: if d.Tok == token.CONST { continue // Skip const declarations } if d.Tok == token.IMPORT { cmap[decl] = nil // Drop pre-import comments. } } newDecls = append(newDecls, decl) } f.Decls = newDecls // Replace identifiers. ast.Inspect(f, func(n ast.Node) bool { switch x := n.(type) { case *ast.Ident:...