- Sort Score
- Num 10 results
- Language All
Results 51 - 60 of 637 for Right (0.02 seconds)
-
internal/s3select/sql/evaluate.go
lval, lerr := e.Left.evalNode(r, tableAlias) if lerr != nil || len(e.Right) == 0 { return lval, lerr } // Process remaining child nodes - result must be // numeric. This AST node is for terms separated by + or - // symbols. for _, rightTerm := range e.Right { op := rightTerm.Op rval, rerr := rightTerm.Right.evalNode(r, tableAlias) if rerr != nil { return nil, rerr }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 12K bytes - Click Count (0) -
docs/en/docs/js/custom.js
} announceRandom() setInterval(announceRandom, timeInterval ) } } function handleSponsorImages() { const announceRight = document.getElementById('announce-right'); if(!announceRight) return; const sponsorImages = document.querySelectorAll('.sponsor-image'); const imagePromises = Array.from(sponsorImages).map(img => {Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Mon Sep 22 15:11:52 GMT 2025 - 6.3K bytes - Click Count (2) -
guava/src/com/google/common/collect/MapDifference.java
*/ boolean areEqual(); /** * Returns an unmodifiable map containing the entries from the left map whose keys are not present * in the right map. */ Map<K, V> entriesOnlyOnLeft(); /** * Returns an unmodifiable map containing the entries from the right map whose keys are not * present in the left map. */ Map<K, V> entriesOnlyOnRight(); /**
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 3.4K bytes - Click Count (0) -
docs/en/docs/advanced/events.md
And then, right after the `yield`, we unload the model. This code will be executed **after** the application **finishes handling requests**, right before the *shutdown*. This could, for example, release resources like memory or a GPU. /// tip
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Dec 17 20:41:43 GMT 2025 - 7.9K bytes - Click Count (0) -
build-logic-commons/module-identity/src/main/kotlin/gradlebuild.module-identity.gradle.kts
Created: Wed Dec 31 11:36:14 GMT 2025 - Last Modified: Thu Oct 30 16:56:31 GMT 2025 - 5.9K bytes - Click Count (0) -
docs/ja/docs/index.md
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Oct 11 17:48:49 GMT 2025 - 21.3K bytes - Click Count (0) -
src/arena/arena.go
safe. Typically, a use-after-free bug will result in a fault and a helpful error message, but this package reserves the right to not force a fault on freed memory. That means a valid implementation of this package is to just allocate all memory the way the runtime normally would, and in fact, it reserves the right to occasionally do so for some Go values. */ package arena import ( "internal/reflectlite" "unsafe" )
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Wed Oct 12 20:23:36 GMT 2022 - 4.3K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/RegularContiguousSet.java
return equalsOrThrow(previous, first) ? null : domain.previous(previous); } }; } private static boolean equalsOrThrow(Comparable<?> left, @Nullable Comparable<?> right) { return right != null && Range.compareOrThrow(left, right) == 0; } @Override boolean isPartialView() { return false; } @Override public C first() {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 8.3K bytes - Click Count (0) -
docs/LICENSE
3. To the extent possible, the Licensor waives any right to collect royalties from You for the exercise of the Licensed Rights, whether directly or through a collecting society under any voluntary or waivable statutory or compulsory licensing scheme. In all other cases the Licensor expressly reserves any right to collect such royalties. Section 3 -- License Conditions.Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Mon May 10 16:50:06 GMT 2021 - 18.2K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/Longs.java
INSTANCE; @Override public int compare(long[] left, long[] right) { int minLength = Math.min(left.length, right.length); for (int i = 0; i < minLength; i++) { int result = Long.compare(left[i], right[i]); if (result != 0) { return result; } } return left.length - right.length; } @Override public String toString() {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Oct 22 18:14:49 GMT 2025 - 29K bytes - Click Count (0)