1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
// Copyright (C) 2019-2023 Aleo Systems Inc.
// This file is part of the snarkVM library.
// The snarkVM library is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// The snarkVM library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with the snarkVM library. If not, see <https://www.gnu.org/licenses/>.
pub trait ToBits: Sized {
/// Returns `self` as a boolean array in little-endian order.
fn to_bits_le(&self) -> Vec<bool>;
/// Returns `self` as a boolean array in big-endian order.
fn to_bits_be(&self) -> Vec<bool>;
}
/********************/
/****** Tuples ******/
/********************/
/// A helper macro to implement `ToBits` for a tuple of `ToBits` circuits.
macro_rules! to_bits_tuple {
(($t0:ident, $i0:tt), $(($ty:ident, $idx:tt)),+) => {
impl<$t0: ToBits, $($ty: ToBits),+> ToBits for ($t0, $($ty),+) {
/// A helper method to return a concatenated list of little-endian bits from the circuits.
#[inline]
fn to_bits_le(&self) -> Vec<bool> {
// The tuple is order-preserving, meaning the first circuit in is the first circuit bits out.
self.$i0.to_bits_le().into_iter()
$(.chain(self.$idx.to_bits_le().into_iter()))+
.collect()
}
/// A helper method to return a concatenated list of big-endian bits from the circuits.
#[inline]
fn to_bits_be(&self) -> Vec<bool> {
// The tuple is order-preserving, meaning the first circuit in is the first circuit bits out.
self.$i0.to_bits_be().into_iter()
$(.chain(self.$idx.to_bits_be().into_iter()))+
.collect()
}
}
impl<'a, $t0: ToBits, $($ty: ToBits),+> ToBits for &'a ($t0, $($ty),+) {
/// A helper method to return a concatenated list of little-endian bits from the circuits.
#[inline]
fn to_bits_le(&self) -> Vec<bool> {
// The tuple is order-preserving, meaning the first circuit in is the first circuit bits out.
self.$i0.to_bits_le().into_iter()
$(.chain(self.$idx.to_bits_le().into_iter()))+
.collect()
}
/// A helper method to return a concatenated list of big-endian bits from the circuits.
#[inline]
fn to_bits_be(&self) -> Vec<bool> {
// The tuple is order-preserving, meaning the first circuit in is the first circuit bits out.
self.$i0.to_bits_be().into_iter()
$(.chain(self.$idx.to_bits_be().into_iter()))+
.collect()
}
}
}
}
to_bits_tuple!((C0, 0), (C1, 1));
to_bits_tuple!((C0, 0), (C1, 1), (C2, 2));
to_bits_tuple!((C0, 0), (C1, 1), (C2, 2), (C3, 3));
to_bits_tuple!((C0, 0), (C1, 1), (C2, 2), (C3, 3), (C4, 4));
to_bits_tuple!((C0, 0), (C1, 1), (C2, 2), (C3, 3), (C4, 4), (C5, 5));
to_bits_tuple!((C0, 0), (C1, 1), (C2, 2), (C3, 3), (C4, 4), (C5, 5), (C6, 6));
to_bits_tuple!((C0, 0), (C1, 1), (C2, 2), (C3, 3), (C4, 4), (C5, 5), (C6, 6), (C7, 7));
to_bits_tuple!((C0, 0), (C1, 1), (C2, 2), (C3, 3), (C4, 4), (C5, 5), (C6, 6), (C7, 7), (C8, 8));
to_bits_tuple!((C0, 0), (C1, 1), (C2, 2), (C3, 3), (C4, 4), (C5, 5), (C6, 6), (C7, 7), (C8, 8), (C9, 9));
to_bits_tuple!((C0, 0), (C1, 1), (C2, 2), (C3, 3), (C4, 4), (C5, 5), (C6, 6), (C7, 7), (C8, 8), (C9, 9), (C10, 10));
/********************/
/****** Arrays ******/
/********************/
impl<C: ToBits> ToBits for Vec<C> {
/// A helper method to return a concatenated list of little-endian bits.
#[inline]
fn to_bits_le(&self) -> Vec<bool> {
// The vector is order-preserving, meaning the first variable in is the first variable bits out.
self.as_slice().to_bits_le()
}
/// A helper method to return a concatenated list of big-endian bits.
#[inline]
fn to_bits_be(&self) -> Vec<bool> {
// The vector is order-preserving, meaning the first variable in is the first variable bits out.
self.as_slice().to_bits_be()
}
}
impl<C: ToBits, const N: usize> ToBits for [C; N] {
/// A helper method to return a concatenated list of little-endian bits.
#[inline]
fn to_bits_le(&self) -> Vec<bool> {
// The slice is order-preserving, meaning the first variable in is the first variable bits out.
self.as_slice().to_bits_le()
}
/// A helper method to return a concatenated list of big-endian bits.
#[inline]
fn to_bits_be(&self) -> Vec<bool> {
// The slice is order-preserving, meaning the first variable in is the first variable bits out.
self.as_slice().to_bits_be()
}
}
impl<C: ToBits> ToBits for &[C] {
/// A helper method to return a concatenated list of little-endian bits.
#[inline]
fn to_bits_le(&self) -> Vec<bool> {
// The slice is order-preserving, meaning the first variable in is the first variable bits out.
self.iter().flat_map(|c| c.to_bits_le()).collect()
}
/// A helper method to return a concatenated list of big-endian bits.
#[inline]
fn to_bits_be(&self) -> Vec<bool> {
// The slice is order-preserving, meaning the first variable in is the first variable bits out.
self.iter().flat_map(|c| c.to_bits_be()).collect()
}
}