- Sort Score
- Result 10 results
- Languages All
Results 721 - 730 of 1,176 for Halter (0.11 sec)
-
src/main/webapp/js/jquery-3.7.1.min.js
rn e===n!==r}):"string"!=typeof n?ce.grep(e,function(e){return-1<se.call(n,e)!==r}):ce.filter(n,e,r)}ce.filter=function(e,t,n){var r=t[0];return n&&(e=":not("+e+")"),1===t.length&&1===r.nodeType?ce.find.matchesSelector(r,e)?[r]:[]:ce.find.matches(e,ce.grep(t,function(e){return 1===e.nodeType}))},ce.fn.extend({find:function(e){var t,n,r=this.length,i=this;if("string"!=typeof e)return this.pushStack(ce(e).filter(function(){for(t=0;t<r;t++)if(ce.contains(i[t],this))return!0}));for(n=this.pushStack(...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Oct 26 01:07:52 UTC 2024 - 85.5K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/es/config/cbean/ca/bs/BsThumbnailQueueCA.java
import org.codelibs.fess.es.config.cbean.ca.ThumbnailQueueCA; import org.codelibs.fess.es.config.cbean.cq.ThumbnailQueueCQ; import org.codelibs.fess.es.config.cbean.cq.bs.BsThumbnailQueueCQ; import org.opensearch.search.aggregations.bucket.filter.FilterAggregationBuilder; import org.opensearch.search.aggregations.bucket.global.GlobalAggregationBuilder; import org.opensearch.search.aggregations.bucket.histogram.HistogramAggregationBuilder;
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 38.6K bytes - Viewed (0) -
tensorflow/c/c_api_experimental.cc
// scheduled on that same threadpool, causing a deadlock in cases where the // caller of event_mgr->ThenExecute() blocks on the completion of the callback // (as in the case of ConstOp kernel creation on GPU, which involves copying a // CPU tensor to GPU). // Setting a larger thread pool does not help with the Swift caller, as we use // a different TFE context for each thread of execution (for running graph
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Sat Oct 12 16:27:48 UTC 2024 - 29.5K bytes - Viewed (0) -
cmd/iam-store.go
// Assumes that c.Lock is held by caller. func (c *iamCache) buildUserGroupMemberships() { for group, gi := range c.iamGroupsMap { c.updateGroupMembershipsMap(group, &gi) } } // updateGroupMembershipsMap - updates the memberships map for a // group. IMPORTANT: Assumes c.Lock() is held by caller. func (c *iamCache) updateGroupMembershipsMap(group string, gi *GroupInfo) {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Oct 14 16:35:37 UTC 2024 - 83.2K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/JobHelper.java
} } public boolean isAvailable(final String id) { return ComponentUtil.getComponent(ScheduledJobBhv.class).selectByPK(id).filter(e -> Boolean.TRUE.equals(e.getAvailable())) .isPresent(); } public void store(final JobLog jobLog) { ComponentUtil.getComponent(JobLogBhv.class).insertOrUpdate(jobLog, op -> {
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
private final ElementOrder<E> edgeOrder; final MapIteratorCache<N, NetworkConnections<N, E>> nodeConnections; // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory. final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
graph.predecessors(node).iterator(), (N predecessor) -> EndpointPair.ordered(predecessor, node)), Iterators.transform( // filter out 'node' from successors (already covered by predecessors, // above) Sets.difference(graph.successors(node), ImmutableSet.of(node)).iterator(),
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardNetwork.java
private final ElementOrder<E> edgeOrder; final MapIteratorCache<N, NetworkConnections<N, E>> nodeConnections; // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory. final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.9K bytes - Viewed (0) -
manifests/charts/UPDATING-CHARTS.md
- Helm is for configuration that is expected to be set at install-time only. If the change is a dynamic runtime configuration, it probably belongs in the [MeshConfig API](https://github.com/istio/api/blob/master/mesh/v1alpha1/config.proto). This allows configuration without re-installing or restarting deployments.
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Thu Aug 15 16:31:46 UTC 2024 - 4.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/TimeoutFuture.java
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 13:13:32 UTC 2024 - 8.1K bytes - Viewed (0)