Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 330 for chad (0.32 sec)

  1. src/main/java/jcifs/util/SecureCredentialStorage.java

        }
    
        /**
         * Convert char array to byte array (UTF-8)
         */
        private byte[] charsToBytes(char[] chars) {
            if (chars == null) {
                return null;
            }
    
            // Use UTF-8 encoding
            byte[] bytes = new byte[chars.length * 3]; // Max 3 bytes per char in UTF-8
            int byteIndex = 0;
    
            for (char c : chars) {
                if (c < 0x80) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 12.7K bytes
    - Viewed (0)
  2. cmd/perf-tests.go

    	defer n.Unlock()
    	n.RX = 0
    	n.RXSample = 0
    	n.lastToConnect = time.Time{}
    	n.firstToDisconnect = time.Time{}
    }
    
    // Reader to read random data.
    type netperfReader struct {
    	n   uint64
    	eof chan struct{}
    	buf []byte
    }
    
    func (m *netperfReader) Read(b []byte) (int, error) {
    	select {
    	case <-m.eof:
    		return 0, io.EOF
    	default:
    	}
    	n := copy(b, m.buf)
    	atomic.AddUint64(&m.n, uint64(n))
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 11.7K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/graph/TraverserTest.java

        for (String edge : edges) {
          checkArgument(
              edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge);
          char node1 = edge.charAt(0);
          char node2 = edge.charAt(1);
          graphMapBuilder.put(node1, node2);
          if (!directed) {
            graphMapBuilder.put(node2, node1);
          }
        }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 47.5K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/graph/TraverserTest.java

        for (String edge : edges) {
          checkArgument(
              edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge);
          char node1 = edge.charAt(0);
          char node2 = edge.charAt(1);
          graphMapBuilder.put(node1, node2);
          if (!directed) {
            graphMapBuilder.put(node2, node1);
          }
        }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 47.5K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/base/Preconditions.java

       *
       * @since 20.0 (varargs overload since 2.0)
       */
      public static void checkArgument(
          boolean expression, String errorMessageTemplate, char p1, char p2) {
        if (!expression) {
          throw new IllegalArgumentException(lenientFormat(errorMessageTemplate, p1, p2));
        }
      }
    
      /**
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 10 22:11:00 UTC 2025
    - 53K bytes
    - Viewed (0)
  6. src/test/java/jcifs/smb/NtlmPasswordAuthenticatorSecurityTest.java

            Field passwordField = NtlmPasswordAuthenticator.class.getDeclaredField("password");
            passwordField.setAccessible(true);
    
            char[] originalPassword = (char[]) passwordField.get(authenticator);
            char[] clonedPassword = (char[]) passwordField.get(cloned);
    
            assertNotSame(originalPassword, clonedPassword, "Cloned password should be a different array instance");
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  7. mockwebserver/README.md

      HttpUrl baseUrl = server.url("/v1/chat/");
    
      // Exercise your application code, which should make those HTTP requests.
      // Responses are returned in the same order that they are enqueued.
      Chat chat = new Chat(baseUrl);
    
      chat.loadMore();
      assertEquals("hello, world!", chat.messages());
    
      chat.loadMore();
      chat.loadMore();
      assertEquals(""
          + "hello, world!\n"
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Jul 19 13:40:52 UTC 2025
    - 8.1K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/suggest/normalizer/HankakuKanaToZenkakuKana.java

                final char originalChar1 = sb.charAt(i);
                final char originalChar2 = sb.charAt(i + 1);
                final char margedChar = mergeChar(originalChar1, originalChar2);
                if (margedChar != originalChar1) {
                    sb.setCharAt(i, margedChar);
                    sb.deleteCharAt(i + 1);
                } else {
    Registered: Fri Sep 19 09:08:11 UTC 2025
    - Last Modified: Fri Jul 04 14:00:23 UTC 2025
    - 6.8K bytes
    - Viewed (0)
  9. src/test/java/jcifs/smb/NtlmPasswordAuthenticatorTest.java

        }
    
        /**
         * Test password in equals method
         */
        @Test
        public void testEqualsWithSecurePassword() {
            char[] password1 = "TestPass123!".toCharArray();
            char[] password2 = "TestPass123!".toCharArray();
            char[] password3 = "DifferentPass!".toCharArray();
    
            NtlmPasswordAuthenticator auth1 = new NtlmPasswordAuthenticator("DOMAIN", "user", password1);
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  10. guava/src/com/google/common/primitives/Chars.java

          "The hash code of a char is the int version of the char itself, so it's simplest to return"
              + " that.")
      public static int hashCode(char value) {
        return value;
      }
    
      /**
       * Returns the {@code char} value that is equal to {@code value}, if possible.
       *
       * @param value any value in the range of the {@code char} type
       * @return the {@code char} value that equals {@code value}
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 24.2K bytes
    - Viewed (0)
Back to top