- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 49 for odd (0.02 sec)
-
internal/hash/crc.go
odd := make([]uint64, 64) // odd-power-of-two zeros operator // put operator for one zero bit in odd odd[0] = poly // CRC-64 polynomial row := uint64(1) for n := 1; n < 64; n++ { odd[n] = row row <<= 1 } // put operator for two zero bits in even gf2MatrixSquare(even, odd) // put operator for four zero bits in odd gf2MatrixSquare(odd, even)
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Mon Jan 20 14:49:07 UTC 2025 - 5.8K bytes - Viewed (0) -
compat/maven-embedder/src/test/java/org/apache/maven/cli/CLIManagerDocumentationTest.java
StringBuilder sb = new StringBuilder(512); boolean odd = true; sb.append( "<table border='1' class='zebra-striped'><tr class='a'><th><b>Options</b></th><th><b>Description</b></th></tr>"); for (Option option : new CLIManagerExtension().getOptions()) { odd = !odd; sb.append("<tr class='"); sb.append(odd ? 'a' : 'b'); sb.append("'>");
Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Fri Jun 06 14:28:57 UTC 2025 - 4.1K bytes - Viewed (0) -
src/test/java/jcifs/internal/dfs/ReferralTest.java
} } // String Reading Tests @Test public void testOddBufferIndexAlignment() { // Create buffer with odd starting position ByteBuffer bb = ByteBuffer.wrap(testBuffer).order(ByteOrder.LITTLE_ENDIAN); // Start at position 1 (odd) bb.position(1); bb.putShort((short) 3); // version bb.putShort((short) 34); // sizeRegistered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 22K bytes - Viewed (0) -
src/cmd/asm/internal/arch/ppc64.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 // 64-bit PowerPC (PPC64) instruction set, to minimize its interaction // with the core of the assembler. package arch import ( "cmd/internal/obj" "cmd/internal/obj/ppc64" ) func jumpPPC64(word string) bool {
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Nov 21 18:27:17 UTC 2024 - 2.3K bytes - Viewed (0) -
internal/amztime/parse.go
"net/http" "time" ) // Supported amz date formats. var amzDateFormats = []string{ // Do not change this order, x-amz-date format is usually in // iso8601Format rest are meant for relaxed handling of other // odd SDKs that might be out there. "20060102T150405Z", time.RFC1123, time.RFC1123Z, // Add new AMZ date formats here. } // ErrMalformedDate always returned for dates that cannot be parsed.
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Thu Jan 18 07:03:17 UTC 2024 - 2.5K bytes - Viewed (0) -
src/cmd/asm/internal/arch/loong64.go
// Copyright 2022 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 // Loong64 (LoongArch64) instruction set, to minimize its interaction // with the core of the assembler. package arch import ( "cmd/internal/obj" "cmd/internal/obj/loong64" "errors" "fmt" )
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Tue Aug 05 17:31:25 UTC 2025 - 3.8K bytes - Viewed (0) -
src/cmd/asm/internal/arch/riscv64.go
// Copyright 2020 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 RISCV64 // instruction set, to minimize its interaction with the core of the // assembler. package arch import ( "cmd/internal/obj" "cmd/internal/obj/riscv" "fmt" )
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Fri Sep 12 08:12:45 UTC 2025 - 2.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/BigIntegerMathTest.java
for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) { int halfEven = BigIntegerMath.log2(x, HALF_EVEN); // Now figure out what rounding mode we should behave like (it depends if FLOOR was // odd/even). boolean floorWasEven = (BigIntegerMath.log2(x, FLOOR) & 1) == 0; assertEquals(BigIntegerMath.log2(x, floorWasEven ? HALF_DOWN : HALF_UP), halfEven); } } @GwtIncompatible // TODO
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Nov 19 01:35:24 UTC 2025 - 27.1K bytes - Viewed (0) -
docs/distributed/DESIGN.md
drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total. - *If total number of nodes are of odd number then GCD algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but...
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Wed Feb 26 09:25:50 UTC 2025 - 8K bytes - Viewed (2) -
src/test/java/jcifs/internal/smb1/ServerMessageBlockTest.java
} @Test @DisplayName("Test write string with odd Unicode alignment") void testWriteStringUnicodeAlignment() { testBlock.setUseUnicode(true); byte[] buffer = new byte[100]; String testString = "Test"; // Test odd Unicode alignment - headerStart affects alignmentRegistered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 36.2K bytes - Viewed (0)