Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 257 for computer (0.17 sec)

  1. 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.",
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 13.2K bytes
    - Viewed (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.",
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 14.9K bytes
    - Viewed (0)
  3. 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.
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 24K bytes
    - Viewed (0)
  4. 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);
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 19.3K bytes
    - Viewed (0)
  5. 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;
      }
    
      /**
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 24.8K bytes
    - Viewed (0)
  6. 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.
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Sep 20 15:10:09 UTC 2025
    - 27.9K bytes
    - Viewed (0)
  7. 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.
       *
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 22.6K bytes
    - Viewed (0)
  8. 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.
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Apr 23 18:58:53 UTC 2021
    - 33.7K bytes
    - Viewed (0)
  9. docs/en/docs/virtual-environments.md

    ## Where are Packages Installed { #where-are-packages-installed }
    
    When you install Python, it creates some directories with some files in your computer.
    
    Some of these directories are the ones in charge of having all the packages you install.
    
    When you run:
    
    <div class="termy">
    
    ```console
    // Don't run this now, it's just an example 🤓
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Tue Dec 02 05:09:25 UTC 2025
    - 22.8K bytes
    - Viewed (0)
  10. guava/src/com/google/common/math/PairedStatsAccumulator.java

      private double sumOfProductsOfDeltas = 0.0;
    
      /** Adds the given pair of values to the dataset. */
      public void add(double x, double y) {
        // We extend the recursive expression for the one-variable case at Art of Computer Programming
        // vol. 2, Knuth, 4.2.2, (16) to the two-variable case. We have two value series x_i and y_i.
        // We define the arithmetic means X_n = 1/n \sum_{i=1}^n x_i, and Y_n = 1/n \sum_{i=1}^n y_i.
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Sep 08 18:35:13 UTC 2025
    - 10.4K bytes
    - Viewed (0)
Back to top