Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 541 - 550 of 1,761 for sysmem (0.37 seconds)

  1. src/test/java/org/codelibs/curl/CurlTest.java

            assertTrue(Curl.tmpDir.exists());
        }
    
        @Test
        public void test_TmpDirMatchesSystemProperty() {
            // ## Test that tmpDir matches system property ##
    
            // ## Act ##
            final String systemTmpDir = System.getProperty("java.io.tmpdir");
            final String curlTmpDir = Curl.tmpDir.getAbsolutePath();
    
            // ## Assert ##
    Created: Thu Apr 02 15:34:12 GMT 2026
    - Last Modified: Thu Nov 20 13:34:13 GMT 2025
    - 16.3K bytes
    - Click Count (0)
  2. docs/de/docs/tutorial/security/simple-oauth2.md

    Lassen Sie uns diese Daten zunächst in das Pydantic-Modell `UserInDB` einfügen.
    
    Sie sollten niemals Klartext-Passwörter speichern, daher verwenden wir ein (gefaktes) Passwort-Hashing-System.
    
    Wenn die Passwörter nicht übereinstimmen, geben wir denselben Fehler zurück.
    
    #### Passwort-Hashing { #password-hashing }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 11.1K bytes
    - Click Count (0)
  3. docs/fr/docs/environment-variables.md

    ```
    
    Cela signifie que le système doit rechercher les programmes dans les répertoires :
    
    * `/usr/local/bin`
    * `/usr/bin`
    * `/bin`
    * `/usr/sbin`
    * `/sbin`
    
    ////
    
    //// tab | Windows
    
    ```plaintext
    C:\Program Files\Python312\Scripts;C:\Program Files\Python312;C:\Windows\System32
    ```
    
    Cela signifie que le système doit rechercher les programmes dans les répertoires :
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 9.1K bytes
    - Click Count (0)
  4. docs/de/docs/tutorial/dependencies/sub-dependencies.md

    haben, wird **FastAPI** diese Unterabhängigkeit nur einmal pro <abbr title="Request – Anfrage: Daten, die der Client zum Server sendet">Request</abbr> aufrufen.
    
    Und es speichert den zurückgegebenen Wert in einem <dfn title="Hilfsprogramm/System zum Speichern berechneter/erzeugter Werte, um sie wiederzuverwenden, anstatt sie erneut zu berechnen.">„Cache“</dfn> und übergibt diesen gecachten Wert an alle „Dependanten“, die ihn in diesem spezifischen Request benötigen, anstatt die Abhängigkeit...
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Feb 14 07:57:30 GMT 2026
    - 4.5K bytes
    - Click Count (0)
  5. build-tools-internal/src/main/resources/forbidden/es-all-signatures.txt

    # This method is misleading, and uses lenient boolean parsing under the hood. If you intend to parse
    # a system property as a boolean, use
    # org.elasticsearch.core.Booleans#parseBoolean(java.lang.String) on the result of
    # java.lang.SystemProperty#getProperty(java.lang.String) instead. If you were not intending to parse
    # a system property as a boolean, but instead parse a string to a boolean, use
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Wed Sep 01 15:21:26 GMT 2021
    - 3.8K bytes
    - Click Count (0)
  6. src/test/java/jcifs/internal/smb1/trans/TransTransactNamedPipeTest.java

            // Verify correct portion of data is copied
            byte[] expectedData = new byte[partialLength];
            System.arraycopy(TEST_DATA, partialOffset, expectedData, 0, partialLength);
            byte[] copiedData = new byte[partialLength];
            System.arraycopy(dst, dstIndex, copiedData, 0, partialLength);
            assertArrayEquals(expectedData, copiedData);
        }
    
        @Test
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 9.7K bytes
    - Click Count (0)
  7. src/test/java/jcifs/smb/MIENameTest.java

            // MECH_OID
            System.arraycopy(oidDer, 0, buf, i, oidLen);
            i += oidLen;
            // NAME_LEN (4 bytes big-endian)
            buf[i++] = (byte) ((nameLen >>> 24) & 0xFF);
            buf[i++] = (byte) ((nameLen >>> 16) & 0xFF);
            buf[i++] = (byte) ((nameLen >>> 8) & 0xFF);
            buf[i++] = (byte) (nameLen & 0xFF);
            // NAME
            System.arraycopy(nameBytes, 0, buf, i, nameLen);
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 8.6K bytes
    - Click Count (0)
  8. build-logic-commons/gradle-plugin/src/main/kotlin/gradlebuild.test-retry.gradle.kts

     * See the License for the specific language governing permissions and
     * limitations under the License.
     */
    
    plugins {
        id("org.gradle.test-retry")
    }
    
    if (System.getenv().containsKey("CI")) {
        tasks.withType<Test>().configureEach {
            retry {
                maxRetries.set(2)
            }
        }
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed Apr 26 06:43:17 GMT 2023
    - 810 bytes
    - Click Count (0)
  9. android/guava-tests/test/com/google/common/math/TestPlatform.java

    /**
     * @author Chris Povirk
     */
    @GwtCompatible
    @NullUnmarked
    final class TestPlatform {
      static boolean intsCanGoOutOfRange() {
        return false;
      }
    
      static boolean isAndroid() {
        return System.getProperty("java.runtime.name", "").contains("Android");
      }
    
      private TestPlatform() {}
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Aug 10 19:54:19 GMT 2025
    - 1K bytes
    - Click Count (0)
  10. internal/logger/targets.go

    	sys := SystemTargets()
    	audit := AuditTargets()
    	res := make(map[string]types.TargetStats, len(sys)+len(audit))
    	cnt := make(map[string]int, len(sys)+len(audit))
    
    	// Add system and audit.
    	for _, t := range sys {
    		key := strings.ToLower(t.Type().String())
    		n := cnt[key]
    		cnt[key]++
    		key = fmt.Sprintf("sys_%s_%d", key, n)
    		res[key] = t.Stats()
    	}
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 6K bytes
    - Click Count (0)
Back to Top