}

  /**
   * Returns a hash code, having the same bit length as each of the input hash codes, that combines
   * the information of these hash codes in an ordered fashion. That is, whenever two equal hash
   * codes are produced by two calls to this method, it is <i>as likely as possible</i> that each
   * was computed from the <i>same</i> input hash codes in the <i>same</i> order.
   *

/**
 * An immutable pair representing the two endpoints of an edge in a graph. The {@link EndpointPair}
 * of a directed edge is an ordered pair of nodes ({@link #source()} and {@link #target()}). The
 * {@link EndpointPair} of an undirected edge is an unordered pair of nodes ({@link #nodeU()} and
 * {@link #nodeV()}).
 *
 * <p>The edge is a self-loop if, and only if, the two endpoints are equal.
 *
 * @author James Sexton

import common.getBuildScanCustomValueParam
import model.CIBuildModel
import model.Stage

class BuildLogicTest(
    model: CIBuildModel,
    stage: Stage,
) : OsAwareBaseGradleBuildType(os = Os.LINUX, stage = stage, init = {
        id(buildTypeId(model))
        name = "Build-logic test"
        description = "Run :build-logic:test"

        features {
            publishBuildStatusToGithub(model)
        }

        applyDefaults(

	if err := DB.Create(&man).Error; err != nil {
		t.Fatalf("unexpected error: %v", err)
	}

	if err := DB.Model(&man).Where("id = ?", man.ID).Updates(struct {
		Age int
	}{Age: 20}).Error; err != nil {
		t.Fatalf("unexpected error: %v", err)
	}

	var result = struct{
		ID int
		Age int
	}{}
	if err := DB.Model(&man).Where("id = ?", man.ID).Find(&result).Error; err != nil {
		t.Fatalf("unexpected error: %v", err)
	}

  @Test
  public void immutableValueGraphBuilder_addNode() {
    ImmutableValueGraph<String, Integer> graph =
        ValueGraphBuilder.directed().<String, Integer>immutable().addNode("A").build();

    assertThat(graph.nodes()).containsExactly("A");
    assertThat(graph.edges()).isEmpty();
  }

  @Test
  public void immutableValueGraphBuilder_putEdgeFromNodes() {
    ImmutableValueGraph<String, Integer> graph =

public interface SuccessorsFunction<N> {

  /**
   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
   * {@code node}'s outgoing edges in the direction (if any) of the edge.
   *
   * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing

import jcifs.CIFSException;

/**
 * NetBIOS exception class for NBT-related errors.
 *
 * This exception encapsulates NetBIOS name service and session service errors
 * with specific error classes and codes.
 */
public class NbtException extends CIFSException {

    /**
     *
     */
    private static final long serialVersionUID = 492638554095148960L;
    // error classes
    /** Success status code */

import org.apache.maven.model.Build;
import org.apache.maven.model.Model;

/**
 */
@Deprecated
public interface ModelInheritanceAssembler {
    String ROLE = ModelInheritanceAssembler.class.getName();

    void assembleModelInheritance(Model child, Model parent, String childPathAdjustment);

    void assembleModelInheritance(Model child, Model parent);

package configurations

import common.Os
import common.buildScanTagParam
import common.getBuildScanCustomValueParam
import model.CIBuildModel
import model.Stage

class CompileAll(
    model: CIBuildModel,
    stage: Stage,
) : OsAwareBaseGradleBuildType(os = Os.LINUX, stage = stage, init = {
        id(buildTypeId(model))
        name = "Compile All"
        description = "Compiles all production/test source code and warms up the build cache"

import javax.inject.Singleton;

import org.apache.maven.model.Build;
import org.apache.maven.model.Model;

/**
 * DefaultModelInheritanceAssembler
 */
@Named
@Singleton
@Deprecated
public class DefaultModelInheritanceAssembler implements ModelInheritanceAssembler {
    @Override
    public void assembleModelInheritance(Model child, Model parent, String childPathAdjustment) {