- Sort Score
- Result 10 results
- Languages All
Results 2281 - 2290 of 2,834 for canf (0.1 sec)
-
src/test/java/jcifs/audit/SecurityAuditLoggerTest.java
/* * © 2025 jcifs Project * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 8.6K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/testers/MapPutTester.java
return getMap().put(entry.getKey(), entry.getValue()); } /** * Returns the {@link Method} instance for {@link #testPut_nullKeyUnsupported()} so that tests of * {@link java.util.TreeMap} can suppress it with {@code * FeatureSpecificTestSuiteBuilder.suppressing()} until <a * href="https://bugs.openjdk.org/browse/JDK-5045147">JDK-5045147</a> is fixed. */ @J2ktIncompatible
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 9.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionList.java
// is likely to be a bug anyway. // N.B. All writes to the list and the next pointers must have happened before the above // synchronized block, so we can iterate the list without the lock held here. RunnableExecutorPair reversedList = null; while (list != null) { RunnableExecutorPair tmp = list; list = list.next; tmp.next = reversedList;Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 6.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/ImmutableGraph.java
* .putEdge(FRANCE, GERMANY) * .putEdge(FRANCE, BELGIUM) * .putEdge(GERMANY, BELGIUM) * .addNode(ICELAND) * .build(); * } * * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build * multiple graphs in series. Each new graph contains all the elements of the ones created before * it. * * @since 28.0 */
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 7.2K bytes - Viewed (0) -
internal/event/target/nsq.go
// Copyright (c) 2015-2023 MinIO, Inc. // // This file is part of MinIO Object Storage stack // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU Affero General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Mar 30 00:56:02 UTC 2025 - 7.1K bytes - Viewed (0) -
internal/bucket/lifecycle/expiration.go
// Copyright (c) 2015-2021 MinIO, Inc. // // This file is part of MinIO Object Storage stack // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU Affero General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Mar 30 00:56:02 UTC 2025 - 6.6K bytes - Viewed (0) -
src/cmd/asm/internal/arch/arm64.go
// Copyright 2015 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // This file encapsulates some of the odd characteristics of the ARM64 // instruction set, to minimize its interaction with the core of the // assembler. package arch import ( "cmd/internal/obj" "cmd/internal/obj/arm64" "errors" ) var arm64LS = map[string]uint8{
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Oct 16 00:35:29 UTC 2025 - 6.3K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now). // We could do that by doubling _W * n times,...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0) -
src/bufio/scan_test.go
// Copyright 2013 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package bufio_test import ( . "bufio" "bytes" "errors" "io" "strings" "testing" "unicode" "unicode/utf8" ) const smallMaxTokenSize = 256 // Much smaller for more efficient testing. // Test white space table matches the Unicode definition.
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Fri Sep 22 16:22:42 UTC 2023 - 14.3K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/service/CrawlingInfoService.java
* This method performs batch deletion of both parameters and session records. * * @param activeSessionId the session ID to exclude from deletion (can be null) * @param name optional name filter for sessions to delete (can be null or blank) * @param date the expiration time threshold - sessions expired before this time will be deleted */Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 19.9K bytes - Viewed (0)