- Sort Score
- Num 10 results
- Language All
Results 301 - 310 of 313 for edge (0.3 seconds)
-
src/main/webapp/css/admin/adminlte.min.css.map
margin-left: -$list-group-border-width;\n border-left-width: $list-group-border-width;\n }\n }\n }\n }\n }\n}\n\n\n// Flush list items\n//\n// Remove borders and border-radius to keep list group items edge-to-edge. Most\n// useful within other components (e.g., cards).\n\n.list-group-flush {\n @include border-radius(0);\n\n > .list-group-item {\n border-width: 0 0 $list-group-border-width;\n\n &:last-child {\n border-bottom-width: 0;\n }\n...
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Oct 26 01:49:09 GMT 2024 - 3.7M bytes - Click Count (3) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
private final boolean allowsSelfLoops; private final ElementOrder<N> nodeOrder; final MapIteratorCache<N, GraphConnections<N, V>> nodeConnections; long edgeCount; // must be updated when edges are added or removed /** Constructs a graph with the properties specified in {@code builder}. */ StandardValueGraph(AbstractGraphBuilder<? super N> builder) { this( builder,
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Apr 02 14:49:41 GMT 2026 - 6K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
if (connections == null) { return false; } if (allowsSelfLoops()) { // Remove self-loop (if any) first, so we don't get CME while removing incident edges. if (connections.removeSuccessor(node) != null) { connections.removePredecessor(node); --edgeCount; } } for (N successor : ImmutableList.copyOf(connections.successors())) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 6.3K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
maskLow52Bits = (1 << 52) - 1 return Element{ rand.Uint64() & maskLow52Bits, rand.Uint64() & maskLow52Bits, rand.Uint64() & maskLow52Bits, rand.Uint64() & maskLow52Bits, rand.Uint64() & maskLow52Bits, } } // weirdLimbs can be combined to generate a range of edge-case field elements. // 0 and -1 are intentionally more weighted, as they combine well. var ( weirdLimbs51 = []uint64{ 0, 0, 0, 0, 1, 19 - 1, 19, 0x2aaaaaaaaaaaa, 0x5555555555555, (1 << 51) - 20, (1 << 51) - 19, (1 << 51) - 1, (1 << 51) - 1, (1 <<...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
maskLow52Bits = (1 << 52) - 1 return Element{ rand.Uint64() & maskLow52Bits, rand.Uint64() & maskLow52Bits, rand.Uint64() & maskLow52Bits, rand.Uint64() & maskLow52Bits, rand.Uint64() & maskLow52Bits, } } // weirdLimbs can be combined to generate a range of edge-case field elements. // 0 and -1 are intentionally more weighted, as they combine well. var ( weirdLimbs51 = []uint64{ 0, 0, 0, 0, 1, 19 - 1, 19, 0x2aaaaaaaaaaaa, 0x5555555555555, (1 << 51) - 20, (1 << 51) - 19, (1 << 51) - 1, (1 << 51) - 1, (1 <<...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/Traverser.java
* </ul> * * @author Jens Nyman * @param <N> Node parameter type * @since 23.1 */ @DoNotMock( "Call forGraph or forTree, passing a lambda or a Graph with the desired edges (built with" + " GraphBuilder)") public abstract class Traverser<N> { private final SuccessorsFunction<N> successorFunction; private Traverser(SuccessorsFunction<N> successorFunction) {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 19.3K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/helper/UserAgentHelperTest.java
getMockRequest().addHeader("user-agent", "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/91.0.4472.124 Safari/537.36 Edg/91.0.864.59"); assertEquals(UserAgentType.CHROME, userAgentHelper.getUserAgentType()); } @Test public void test_getUserAgentType_firefoxMobile() {
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Wed Jan 14 14:29:07 GMT 2026 - 7.5K bytes - Click Count (0) -
okhttp/src/jvmTest/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat
channelsdvr.net u.channelsdvr.net // Fastly Inc. : http://www.fastly.com/ // Submitted by Fastly Security <******@****.***> edgecompute.app fastly-edge.com fastly-terrarium.com freetls.fastly.net map.fastly.net a.prod.fastly.net global.prod.fastly.net a.ssl.fastly.net b.ssl.fastly.net global.ssl.fastly.net fastlylb.net
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Dec 27 13:39:56 GMT 2024 - 309.7K bytes - Click Count (1) -
doc/go_mem.html
would never access <code>*p</code> or <code>*q</code>, but the rewritten program would. And if the call contained synchronizing operations, then the original program could establish happens before edges preceding the accesses to <code>*p</code> and <code>*q</code>, but the rewritten program would not. </p> <p> Not allowing a single read to observe multiple values means
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Tue Aug 05 15:41:37 GMT 2025 - 26.6K bytes - Click Count (0) -
src/main/webapp/js/jquery-3.7.1.min.map
3B,KAIGvH,GAAQiP,cAAgB1H,EAAEE,wBAAyBH,KAAQ0H,EAOzD1H,IAAM9I,GAAY8I,EAAElB,eAAiB6B,IACzCwD,EAAKpE,SAAUY,GAAcX,IACrB,EAOJC,IAAM/I,GAAY+I,EAAEnB,eAAiB6B,IACzCwD,EAAKpE,SAAUY,GAAcV,GACtB,EAIDc,EACJ5I,GAAQJ,KAAMgJ,EAAWf,GAAM7H,GAAQJ,KAAMgJ,EAAWd,GAC1D,EAGe,EAAVyH,GAAe,EAAI,KAGpBxQ,EAqpBR,IAAMuC,KAlpBN0K,EAAKjF,QAAU,SAAU0I,EAAMC,GAC9B,OAAO1D,EAAMyD,EAAM,KAAM,KAAMC,IAGhC1D,EAAK2D,gBAAkB,SAAU/M,EAAM6M,GAGtC,GAFAlE,EAAa3I,GAERkG,IACHQ,EAAwBmG,EAAO,QAC7B1G,IAAcA,EAAUnC,KAAM6I,IAEjC,IACC,IAAIlM,EAAMwD,EAA...
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Oct 26 01:07:52 GMT 2024 - 131.6K bytes - Click Count (0)