jobs:
  build:
    # Don't do this in forks, and if labeled, only for 'kokoro:force-run'
    if: github.repository == 'tensorflow/tensorflow' && (github.event.action != 'labeled' || (github.event.action == 'labeled' && github.event.label.name == 'kokoro:force-run'))
    runs-on: [self-hosted, linux, ARM64]
    strategy:
      matrix:
        pyver: ['3.10']
    steps:
      - name: Stop old running containers (if any)
        shell: bash

     *
     * @param baseKey the base key
     * @param label key derivation label
     * @param context key derivation context
     * @param length desired key length in bytes
     * @return derived key
     * @throws GeneralSecurityException if key derivation fails
     */
    public byte[] deriveKey(byte[] baseKey, String label, byte[] context, int length) throws GeneralSecurityException {
        checkNotClosed();

 * This job removes old crawling sessions, search logs, job logs, and user info logs
 * based on configured retention periods. It helps maintain system performance by
 * preventing log tables from growing too large.
 */
public class PurgeLogJob {

    /** Logger instance for this class */
    private static final Logger logger = LogManager.getLogger(PurgeLogJob.class);

    /**

pkg go/types, method (*Label) Exported() bool
pkg go/types, method (*Label) Id() string
pkg go/types, method (*Label) Name() string
pkg go/types, method (*Label) Parent() *Scope
pkg go/types, method (*Label) Pkg() *Package
pkg go/types, method (*Label) Pos() token.Pos
pkg go/types, method (*Label) String() string
pkg go/types, method (*Label) Type() Type
pkg go/types, method (*Map) Elem() Type

import com.google.common.base.Supplier;
import java.io.Serializable;
import java.util.LinkedHashMap;
import java.util.Map;

/**
 * Implementation of {@link Table} using linked hash tables. This guarantees predictable iteration
 * order of the various views.
 *
 * <p>The views returned by {@link #column}, {@link #columnKeySet()}, and {@link #columnMap()} have

import com.google.common.base.Supplier;
import java.io.Serializable;
import java.util.LinkedHashMap;
import java.util.Map;

/**
 * Implementation of {@link Table} using linked hash tables. This guarantees predictable iteration
 * order of the various views.
 *
 * <p>The views returned by {@link #column}, {@link #columnKeySet()}, and {@link #columnMap()} have

    /**
     * Flag indicating that system access control list (SACL) information is requested or being set.
     */
    int SACL_SECURITY_INFO = 0x8;

    /**
     * Flag indicating that mandatory label information is requested or being set.
     */
    int LABEL_SECURITY_INFO = 0x10;

    /**
     * Flag indicating that attribute security information is requested or being set.
     */

    }

    int writeResourceRecordWireFormat(final byte[] dst, int dstIndex) {
        final int start = dstIndex;
        if (this.recordName == this.questionName) {
            dst[dstIndex] = (byte) 0xC0; // label string pointer to
            dstIndex++;
            dst[dstIndex++] = (byte) 0x0C; // questionName (offset 12)
        } else {
            dstIndex += this.recordName.writeWireFormat(dst, dstIndex);
        }

    }

    int writeResourceRecordWireFormat(final byte[] dst, int dstIndex) {
        final int start = dstIndex;
        if (recordName == questionName) {
            dst[dstIndex] = (byte) 0xC0; // label string pointer to
            dstIndex++;
            dst[dstIndex++] = (byte) 0x0C; // questionName (offset 12)
        } else {
            dstIndex += recordName.writeWireFormat(dst, dstIndex);
        }

		if tables := strings.Split(stmt.Schema.Table, "."); len(tables) == 2 {
			stmt.TableExpr = &clause.Expr{SQL: stmt.Quote(stmt.Schema.Table)}
			stmt.Table = tables[1]
			return
		}

		stmt.Table = stmt.Schema.Table
	}
	return err
}

func (stmt *Statement) clone() *Statement {