lookup造句

G: This option generates the lookup table as a static global variable rather than hiding it by generating it inside the lookup function (the default behavior).

Another way to get "just in time" injection is to use a lookup method.

The use of the hash table with linked list provides the quickest lookup.

The bulk access method can not be used for a sparse lookup.

In addition to the lexical dictionaries that are used during the dictionary lookup, there are also special internal inflection dictionaries.

For example, you might add a new lookup table associating each state and its two-digit ZIP code.

The DNS service would then perform the WINS lookup and pass the information back to the client.

For sparse lookup, a database query is generated based on each input record and the query is sent to the target database to get the result.

You can see in this example that snoop has decoded the contents of the DNS protocol to show the raw data returned by the lookup.

The ServiceLocator can also translate the checked exceptions (that get thrown during lookup or creation of the bean) into unchecked exceptions.

These include one-shot exchanges such as DNS lookup, where the cost introduced by BEEP would be disproportionate, or tightly coupled RPC protocols like NFS.

With the help of a dictionary editor, you can first build a dictionary and then use the dictionary lookup operator to embed the concept extraction in a flow.

The resulting code for handling all aspects of this lookup was straightforward but rather unwieldy, especially if you happen to have multiple tables that you want to use throughout a transform.

This pattern supports the virtualization of services in the following manner: To invoke another business unit's services, you define a service stub on the local ESB, encapsulating the registry lookup.

On the other hand, if your lookup data USES a single form and if there are only hundreds of documents, then there is a negligible effect on your main database.