Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 43 for mycomputer (0.09 seconds)

  1. src/main/java/jcifs/smb1/UniAddress.java

         *
         * @return the underlying address object
         */
    
        public Object getAddress() {
            return addr;
        }
    
        /**
         * Return the hostname of this address such as "MYCOMPUTER".
         *
         * @return the hostname of this address
         */
    
        public String getHostName() {
            if (addr instanceof NbtAddress) {
                return ((NbtAddress) addr).getHostName();
            }
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 17K bytes
    - Click Count (0)
  2. src/main/java/jcifs/smb/NtStatus.java

                "The format of the specified computer name is invalid.", "The pipe has been ended.",
                "The specified local group does not exist.",
                "Logon failure: the user has not been granted the requested logon type at this computer.",
                "The SAM database on the Windows NT Server does not have a computer account for this workstation trust relationship.",
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 14.9K bytes
    - Click Count (0)
  3. src/main/java/jcifs/smb1/smb1/NtStatus.java

                "The format of the specified computer name is invalid.", "The pipe has been ended.",
                "The specified local group does not exist.",
                "Logon failure: the user has not been granted the requested logon type at this computer.",
                "The SAM database on the Windows NT Server does not have a computer account for this workstation trust relationship.",
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 13.2K bytes
    - Click Count (0)
  4. docs/en/docs/async.md

    Asynchronous code just means that the language 💬 has a way to tell the computer / program 🤖 that at some point in the code, it 🤖 will have to wait for *something else* to finish somewhere else. Let's say that *something else* is called "slow-file" 📝.
    
    So, during that time, the computer can go and do some other work, while "slow-file" 📝 finishes.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 23.4K bytes
    - Click Count (0)
  5. src/test/java/jcifs/netbios/NodeStatusResponseTest.java

            addressArrayField.setAccessible(true);
            NbtAddress[] addresses = (NbtAddress[]) addressArrayField.get(response);
    
            // The name should be trimmed to "COMPUTER" without trailing spaces
            assertEquals("COMPUTER", addresses[0].hostName.name);
        }
    
        @Test
        void toString_shouldReturnFormattedString() {
            String result = response.toString();
            assertNotNull(result);
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 07:14:38 GMT 2025
    - 19.3K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/math/Stats.java

        double mean = values.next().doubleValue();
        while (values.hasNext()) {
          double value = values.next().doubleValue();
          count++;
          if (isFinite(value) && isFinite(mean)) {
            // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15)
            mean += (value - mean) / count;
          } else {
            mean = calculateNewMeanNonFinite(mean, value);
          }
        }
        return mean;
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Jul 08 18:32:10 GMT 2025
    - 25.1K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/math/DoubleMath.java

        long count = 1;
        double mean = checkFinite(values[0]);
        for (int index = 1; index < values.length; ++index) {
          checkFinite(values[index]);
          count++;
          // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15)
          mean += (values[index] - mean) / count;
        }
        return mean;
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 19.3K bytes
    - Click Count (0)
  8. docs/de/docs/async.md

    Asynchroner Code bedeutet lediglich, dass die Sprache 💬 eine Möglichkeit hat, dem Computer / Programm 🤖 mitzuteilen, dass es 🤖 an einem bestimmten Punkt im Code darauf warten muss, dass *etwas anderes* irgendwo anders fertig wird. Nehmen wir an, *etwas anderes* ist hier „Langsam-Datei“ 📝.
    
    Während der Zeit, die „Langsam-Datei“ 📝 benötigt, kann das System also andere Aufgaben erledigen.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 27.3K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/collect/Collections2.java

       *
       * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations
       * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7,
       * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
       * first permutation will be in ascending order, and the last will be in descending order.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 22.6K bytes
    - Click Count (0)
  10. LICENSE

    infringement under applicable copyright law, except executing it on a
    computer or modifying a private copy.  Propagation includes copying,
    distribution (with or without modification), making available to the
    public, and in some countries other activities as well.
    
      To "convey" a work means any kind of propagation that enables other
    parties to make or receive copies.  Mere interaction with a user through
    a computer network, with no transfer of a copy, is not conveying.
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Apr 23 18:58:53 GMT 2021
    - 33.7K bytes
    - Click Count (0)
Back to Top