- Sort Score
- Result 10 results
- Languages All
Results 241 - 250 of 289 for primarily (0.11 sec)
-
src/main/webapp/WEB-INF/view/admin/searchlist/admin_searchlist_edit.jsp
<c:otherwise> <la:link href="/admin/searchlist/search?q=${f:u(q)}" styleClass="btn btn-primary btn-xs"> <em class="fa fa-th-list"> <la:message key="labels.crud_link_list"/>
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Thu Feb 13 07:47:04 UTC 2020 - 24.9K bytes - Viewed (0) -
src/main/webapp/WEB-INF/orig/view/advance.jsp
</div> <div class="col-lg-4 d-none d-lg-flex align-items-center"> </div> </div> <div class="row"> <button type="submit" name="search" id="searchButton" class="btn btn-primary mx-auto"> <em class="fa fa-search"> <la:message key="labels.index_form_search_btn" /> </button> </div> </main> <jsp:include page="footer.jsp" /> </la:form>
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 01:07:52 UTC 2024 - 14.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* cryptographic hashes.) * <li><b>fast:</b> perhaps self-explanatory, but often the most important consideration. * </ul> * * <h3>Providing input to a hash function</h3> * * <p>The primary way to provide the data that your hash function should act on is via a {@link * Hasher}. Obtain a new hasher from the hash function using {@link #newHasher}, "push" the relevant
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* cryptographic hashes.) * <li><b>fast:</b> perhaps self-explanatory, but often the most important consideration. * </ul> * * <h3>Providing input to a hash function</h3> * * <p>The primary way to provide the data that your hash function should act on is via a {@link * Hasher}. Obtain a new hasher from the hash function using {@link #newHasher}, "push" the relevant
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
internal/s3select/sql/evaluate.go
if err != nil { return nil, err } } return lval, nil } func (e *UnaryTerm) evalNode(r Record, tableAlias string) (*Value, error) { if e.Negated == nil { return e.Primary.evalNode(r, tableAlias) } v, err := e.Negated.Term.evalNode(r, tableAlias) if err != nil { return nil, err } inferTypeForArithOp(v) v.negate() if v.isNumeric() { return v, nil
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Sep 23 19:35:41 UTC 2024 - 12K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* * <p>Operations on this class make no guarantees about the ordering of elements with equal * priority. If you need to enforce an ordering, you can define custom classes or comparators that * use a secondary key to break ties in primary priority values. For example, here is a class that * applies first-in-first-out tie-breaking to comparable elements. To use it, you would insert a * {@code new FIFOEntry(anEntry)} instead of a plain entry object. * * <pre>
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Jun 07 21:36:32 UTC 2024 - 19K bytes - Viewed (0) -
chainable_api.go
"gorm.io/gorm/utils" ) // Model specify the model you would like to run db operations // // // update all users's name to `hello` // db.Model(&User{}).Update("name", "hello") // // if user's primary key is non-blank, will use it as condition, then will only update that user's name to `hello` // db.Model(&user).Update("name", "hello") func (db *DB) Model(value interface{}) (tx *DB) { tx = db.getInstance()
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Mon Jun 24 09:42:59 UTC 2024 - 14.8K bytes - Viewed (0) -
tests/update_test.go
} CheckUser(t, last, *users[2]) } if err := DB.Create(&users).Error; err != nil { t.Fatalf("errors happened when create: %v", err) } else if user.ID == 0 { t.Fatalf("user's primary value should not zero, %v", user.ID) } else if user.UpdatedAt.IsZero() { t.Fatalf("user's updated at should not zero, %v", user.UpdatedAt) } lastUpdatedAt = user.UpdatedAt
Registered: Sun Nov 03 09:35:10 UTC 2024 - Last Modified: Mon Dec 04 03:50:58 UTC 2023 - 30.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
* whose edges have associated non-unique values. * * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. * * <p>There are three primary interfaces provided to represent graphs. In order of increasing * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 16K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* whose edges are anonymous entities with no identity or information of their own. * * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes. * * <p>There are three primary interfaces provided to represent graphs. In order of increasing * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 10 15:41:27 UTC 2024 - 13.7K bytes - Viewed (0)