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
// 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/>.
use super::*;
use std::rc::Rc;
impl<E: Environment> Not for Boolean<E> {
type Output = Boolean<E>;
/// Returns `(NOT a)`.
fn not(self) -> Self::Output {
(&self).not()
}
}
impl<E: Environment> Not for &Boolean<E> {
type Output = Boolean<E>;
/// Returns `(NOT a)`.
fn not(self) -> Self::Output {
// The `NOT` operation behaves as follows:
// Case 1: If `(self == 0)`, then `(1 - self) == 1`.
// Case 2: If `(self == 1)`, then `(1 - self) == 0`.
match self.is_constant() {
// Constant case.
true => Boolean(E::one() - &self.0),
// Public and private cases.
// Note: We directly instantiate a public variable to correctly represent a boolean in a linear combination.
// For more information, see `LinearCombination::is_boolean_type`.
false => Boolean(Variable::Public(0, Rc::new(E::BaseField::one())) - &self.0),
}
}
}
impl<E: Environment> Metrics<dyn Not<Output = Boolean<E>>> for Boolean<E> {
type Case = Mode;
fn count(_case: &Self::Case) -> Count {
Count::is(0, 0, 0, 0)
}
}
impl<E: Environment> OutputMode<dyn Not<Output = Boolean<E>>> for Boolean<E> {
type Case = Mode;
fn output_mode(case: &Self::Case) -> Mode {
match case {
Mode::Constant => Mode::Constant,
_ => Mode::Private,
}
}
}
#[cfg(test)]
mod tests {
use super::*;
use snarkvm_circuit_environment::Circuit;
fn check_not(name: &str, expected: bool, candidate_input: Boolean<Circuit>) {
Circuit::scope(name, || {
let mode = candidate_input.mode();
let candidate_output = !candidate_input;
assert_eq!(expected, candidate_output.eject_value());
assert_count!(Not(Boolean) => Boolean, &mode);
assert_output_mode!(Not(Boolean) => Boolean, &mode, candidate_output);
});
}
#[test]
fn test_not_constant() {
// NOT false
let expected = true;
let candidate_input = Boolean::<Circuit>::new(Mode::Constant, false);
check_not("NOT false", expected, candidate_input);
// NOT true
let expected = false;
let candidate_input = Boolean::<Circuit>::new(Mode::Constant, true);
check_not("NOT true", expected, candidate_input);
}
#[test]
fn test_not_public() {
// NOT false
let expected = true;
let candidate_input = Boolean::<Circuit>::new(Mode::Public, false);
check_not("NOT false", expected, candidate_input);
// NOT true
let expected = false;
let candidate_input = Boolean::<Circuit>::new(Mode::Public, true);
check_not("NOT true", expected, candidate_input);
}
#[test]
fn test_not_private() {
// NOT false
let expected = true;
let candidate_input = Boolean::<Circuit>::new(Mode::Private, false);
check_not("NOT false", expected, candidate_input);
// NOT true
let expected = false;
let candidate_input = Boolean::<Circuit>::new(Mode::Private, true);
check_not("NOT true", expected, candidate_input);
}
}