<name>PersistedToolchains</name>
      <superClass>TrackableBase</superClass>
      <description>
        The {@code &lt;toolchains&gt;} element is the root of the descriptor.
        The following table lists all the possible child elements.
      </description>
      <version>1.0.0+</version>
      <fields>
        <field>
          <name>toolchains</name>
          <version>1.0.0+</version>

        return doFindEpg(_epgMap, prop);
    }

    // ===================================================================================
    //                                                                          Table Info
    //                                                                          ==========
    protected final String _tableDbName = "search_log";
    protected final String _tableDispName = "search_log";

p2.y, cond) q.z.Select(p1.z, p2.z, cond) return q } // A {{.p}}Table holds the first 15 multiples of a point at offset -1, so [1]P // is at table[0], [15]P is at table[14], and [0]P is implicitly the identity // point. type {{.p}}Table [15]*{{.P}}Point // Select selects the n-th multiple of the table base point into p. It works in // constant time by iterating over every entry of the table. n must be in [0, 15]. func (table *{{.p}}Table) Select(p *{{.P}}Point, n uint8) { if n >= 16 { panic("nistec:...

        return doFindEpg(_epgMap, prop);
    }

    // ===================================================================================
    //                                                                          Table Info
    //                                                                          ==========
    protected final String _tableDbName = "data_config";
    protected final String _tableDispName = "data_config";

 * good job of distributing the elements to the buckets to a distribution not far from uniform), and
 * amortized since some operations can trigger a hash table resize.
 *
 * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or
 * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like

 * good job of distributing the elements to the buckets to a distribution not far from uniform), and
 * amortized since some operations can trigger a hash table resize.
 *
 * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or
 * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like

 * Windows command prompt you can see
 * what names a host registers with the nbtstat command.
 *
 *  * <blockquote>
 *
 * <pre>
 * C:\&gt;nbtstat -a 192.168.1.15
 *
 *        NetBIOS Remote Machine Name Table
 *
 *    Name               Type         Status
 * ---------------------------------------------
 * JMORRIS2        &lt;00&gt;  UNIQUE      Registered
 * BILLING-NY      &lt;00&gt;  GROUP       Registered

	type RegionOrg struct {
		RegionId       uint
		OrganizationId uint
		Empty          myType
	}
	if err := DB.SetupJoinTable(&Region{}, "Organizations", &RegionOrg{}); err != nil {
		t.Fatalf("Failed to set up join table, got error: %s", err)
	}
	if err := DB.Migrator().DropTable(&Organization{}, &Region{}); err != nil {
		t.Fatalf("Failed to migrate, got error: %s", err)
	}

import java.util.HashMap;
import java.util.Map;

import org.codelibs.fess.opensearch.user.allcommon.EsAbstractEntity;
import org.codelibs.fess.opensearch.user.bsentity.dbmeta.UserDbm;

/**
 * ${table.comment}
 * @author ESFlute (using FreeGen)
 */
public class BsUser extends EsAbstractEntity {

    // ===================================================================================

 * function doing a good job of distributing the elements to the buckets to a distribution not far
 * from uniform), and amortized since some operations can trigger a hash table resize.
 *
 * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced
 * load on the garbage collector by only using a constant number of internal objects.
 *