SergeychWorks/lyng
1
0
Fork 0
Code Issues 4 Pull Requests Actions Packages Projects 1 Releases 14 Wiki Activity

added random bitArray

Browse Source
This commit is contained in:
Sergey Chernov 2025-11-01 22:17:13 +01:00
parent f00631cd88
commit 9d222be924
1 changed files with 21 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
lynglib/src/commonMain/kotlin/net/sergeych/lynon/bit_tools.kt
View File

@ -17,6 +17,8 @@
package net.sergeych.lynon
import kotlin.random.Random
/**
* Hoq many tetrades needed to store the value. It is faster to use this function
* than to use sizeInBits
@ -35,7 +37,7 @@ fun sizeInTetrades(value: ULong): Int {
}
/**
* How many bits needed to store the value. Size for 0 is 1,
* Calculates ow many bits needed to store the value. Size for 0, for example, is 1.
*/
@Suppress("unused")
fun sizeInBits(value: ULong): Int {
@ -50,3 +52,20 @@ fun sizeInBits(value: ULong): Int {
}
fun sizeInBits(value: Int): Int = sizeInBits(value.toULong())
/**
* Generates a random BitArray of the specified size. Important: this is
* __not cryptographically secure__. Use random from [crypto2](https://gitea.sergeych.net/sergeych/crypto2),
* `randomInt()`, `randomUBytes()`, etc., for cryptographically secure random data.
*
* @param sizeInBits The size of the BitArray to generate in bits.
* @return A BitArray of the specified size filled with random bits.
*/
@Suppress("unused")
fun BitArray.Companion.random(sizeInBits: Int): BitArray {
val result = BitArray.withBitSize(sizeInBits.toLong())
for (i in 0..<sizeInBits) {
result[i.toLong()] = Random.nextInt() and 1
}
return result
}