Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 36 for backwards (0.09 sec)

  1. src/main/java/jcifs/smb1/netbios/Name.java

            } catch (final UnsupportedEncodingException uee) {}
            dstIndex += scope.length();
    
            dst[dstIndex++] = (byte) 0x00;
    
            // now go over scope backwards converting '.' to label length
    
            int i = dstIndex - 2;
            final int e = i - scope.length();
            int c = 0;
    
            do {
                if (dst[i] == '.') {
                    dst[i] = (byte) c;
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 7.2K bytes
    - Viewed (0)
  2. src/main/java/jcifs/netbios/Name.java

            dstIndex += this.scope.length();
    
            dst[dstIndex++] = (byte) 0x00;
    
            // now go over scope backwards converting '.' to label length
    
            int i = dstIndex - 2;
            final int e = i - this.scope.length();
            int c = 0;
    
            do {
                if (dst[i] == '.') {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 8K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/RegularImmutableMap.java

                    : new NonTerminalImmutableMapEntry<K, V>(key, value, keyBucketHead);
            table[tableIndex] = effectiveEntry;
          } else {
            // We already saw this key, and the first value we saw (going backwards) is the one we are
            // keeping. So we won't touch table[], but we do still want to add the existing entry that
            // we found to entries[] so that we will see this key in the right place when iterating.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 15.8K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/Iterables.java

        // * The element with (index == from) should be kept.
        // * Everything with (index > from) has not been checked yet.
    
        // Check from the end of the list backwards (minimize expected cost of
        // moving elements when remove() is called). Stop before 'from' because
        // we already know that should be kept.
        for (int n = list.size() - 1; n > from; n--) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 43.6K bytes
    - Viewed (0)
  5. src/test/java/jcifs/netbios/NameTest.java

            // First byte should be length of "test" (4) after processing
            assertEquals(4, dst[0]);
    
            // After processing, dots should be replaced with length markers
            // The scope processing happens backwards
            assertEquals(name.scope.length() + 2, length);
        }
    
        @Test
        void readScopeWireFormat_withMultipleLabels_shouldParseCorrectly() {
            byte[] src = new byte[100];
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 19.4K bytes
    - Viewed (0)
  6. guava/src/com/google/common/math/LongMath.java

          // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
          // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
    
          // We bend over backwards to avoid branching, adapting a technique from
          // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax
    
          long delta = a - b; // can't overflow, since a and b are nonnegative
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 29 16:20:07 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  7. src/bytes/bytes.go

    		last := n - 1
    		i := last
    		fails := 0
    		for i < len(s) {
    			if s[i] != b[last] {
    				o := IndexByte(s[i+1:], b[last])
    				if o < 0 {
    					return -1
    				}
    				i += o + 1
    			}
    			// Step backwards comparing bytes.
    			for j := 1; j < n; j++ {
    				if s[i-j] != b[last-j] {
    					goto next
    				}
    			}
    			return i - last
    		next:
    			fails++
    			i++
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  8. RELEASE.md

            `tf.errors.UnimplementedError` (with an understandable message) to be
            thrown.
            *   `tf.nn.sparse_softmax_cross_entropy_with_logits` forwards and/or
                backwards. See PR
                [47925](https://github.com/tensorflow/tensorflow/pull/47925).
            *   `tf.image.crop_and_resize` gradient w.r.t. either `image` or
                `boxes`. See PR
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (2)
  9. src/bytes/bytes_test.go

    		[]byte("ab\xc0a\xc0")},
    	{not(isValidRune), "\xc0a\xc0",
    		[]byte("a"),
    		[]byte("a\xc0"),
    		[]byte("\xc0a")},
    	// The nils returned by TrimLeftFunc are odd behavior, but we need
    	// to preserve backwards compatibility.
    	{isSpace, "",
    		nil,
    		nil,
    		[]byte("")},
    	{isSpace, " ",
    		nil,
    		nil,
    		[]byte("")},
    }
    
    func TestTrimFunc(t *testing.T) {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Jul 28 18:13:58 UTC 2025
    - 62.9K bytes
    - Viewed (0)
  10. android/guava-testlib/src/com/google/common/collect/testing/google/BiMapInverseTester.java

        assertEquals(pair.forward, copy.forward);
        assertEquals(pair.backward, copy.backward);
        assertSame(copy.backward, copy.forward.inverse());
        assertSame(copy.forward, copy.backward.inverse());
      }
    
      private static final class BiMapPair<K, V> implements Serializable {
        final BiMap<K, V> forward;
        final BiMap<V, K> backward;
    
        BiMapPair(BiMap<K, V> original) {
          this.forward = original;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 3.1K bytes
    - Viewed (0)
Back to top