bit-vec-method-uses.txt

stable-vec-0.3.2/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
paillier-0.2.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
contest-algorithms-0.1.2/README.md:- [Basic graph representations](src/graph/mod.rs): adjacency lists, minimum spanning tree, Euler path, disjoint set union 
gdpr_consent-0.4.0/LICENSE-APACHE:      "Legal Entity" shall mean the union of the acting entity and all
partitions-0.2.4/LICENSE.txt:"Legal Entity" shall mean the union of the acting entity and all
partitions-0.2.4/Cargo.toml:description = "A disjoint-sets/union-find implementation that allows for efficient iteration over elements of a set."
partitions-0.2.4/Cargo.toml:keywords = ["union-find", "disjoint-sets"]
bitarray-set-0.4.1/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
partitions-0.2.4/README.md:A [disjoint-sets/union-find] implementation of a vector partitioned in sets that
partitions-0.2.4/README.md:[`union`] method.
partitions-0.2.4/README.md:The [`union`] and [`same_set`] methods are extremely fast and have an amortized
partitions-0.2.4/README.md:[disjoint-sets/union-find]: https://en.wikipedia.org/wiki/Disjoint-set_data_structure
partitions-0.2.4/README.md:[`union`]: https://docs.rs/partitions/0.2.0/partitions/partition_vec/struct.PartitionVec.html#method.union
partitions-0.2.4/Cargo.toml.orig:description = "A disjoint-sets/union-find implementation that allows for efficient iteration over elements of a set."
partitions-0.2.4/Cargo.toml.orig:keywords = ["union-find", "disjoint-sets"]
huffman-compress-0.6.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
sysfs-rs-0.0.12/LICENSE-APACHE:      "Legal Entity" shall mean the union of the acting entity and all
bellman_ce-0.3.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
ordered_iter-0.1.1/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
img_hash-2.1.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
type-operators-0.3.5/LICENSE-APACHE:"Legal Entity" shall mean the union of the acting entity and all
bellperson-0.2.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
rcgen-0.3.1/LICENSE:      "Legal Entity" shall mean the union of the acting entity and all
bit-array-0.4.4/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
bellman-0.1.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
bit-set-0.5.1/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
multibloom-0.2.0/LICENSE-APACHE:      "Legal Entity" shall mean the union of the acting entity and all
bit-matrix-0.3.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
mysql_async-0.19.1/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
postgres-0.16.0-rc.1/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
cfg-0.3.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
bip39-0.6.0-beta.1/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
bitarray-0.1.2/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
rckad-0.0.2/LICENSE-APACHE:      "Legal Entity" shall mean the union of the acting entity and all
smallbitvec-2.4.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
mysql_common-0.17.1/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
batsat-0.3.1/src/clause.rs:/// a slice of a `union` type rather than pure literals
batsat-0.3.1/src/clause.rs:pub(crate) union ClauseData {
partitions-0.2.4/src/lib.rs://! A [disjoint-sets/union-find] implementation of a vector partitioned in sets that allows
partitions-0.2.4/src/lib.rs://! The elements each start in their own set and sets can be joined with the [`union`] method.
partitions-0.2.4/src/lib.rs://! The [`union`] and [`same_set`] methods are extremely fast and have an amortized complexity of
partitions-0.2.4/src/lib.rs://! [disjoint-sets/union-find]: https://en.wikipedia.org/wiki/Disjoint-set_data_structure
partitions-0.2.4/src/lib.rs://! [`union`]: partition_vec/struct.PartitionVec.html#method.union
bellman_ce-0.3.0/src/cs.rs:        coeff.negate();
ferrous_threads-0.1.1/src/task_runner.rs://! done. Here we negate the cost of thread startup by using a fixed amount of threads
bitarray-set-0.4.1/src/lib.rs:    /// Iterator over each usize stored in `self` union `other`.
bitarray-set-0.4.1/src/lib.rs:    /// for x in a.union(&b) {
bitarray-set-0.4.1/src/lib.rs:    pub fn union<'a>(&'a self, other: &'a Self) -> Union<'a, B> {
bitarray-set-0.4.1/src/lib.rs:    /// Iterator over each usize stored in `self` intersect `other`.
bitarray-set-0.4.1/src/lib.rs:        // Check that `self` intersect `other` is self
bitarray-set-0.4.1/src/lib.rs:        not.bit_array.negate();
bitarray-set-0.4.1/src/lib.rs:        let actual: Vec<_> = a.union(&b).collect();
partitions-0.2.4/src/partition_vec.rs://! A [disjoint-sets/union-find] implementation of a vector partitioned in sets.
partitions-0.2.4/src/partition_vec.rs://! [disjoint-sets/union-find]: https://en.wikipedia.org/wiki/Disjoint-set_data_structure
partitions-0.2.4/src/partition_vec.rs:/// A [disjoint-sets/union-find] implementation of a vector partitioned in sets.
partitions-0.2.4/src/partition_vec.rs:/// Initially each element has its own set but sets can be joined with the `union` method.
partitions-0.2.4/src/partition_vec.rs:/// partition_vec.union(1, 2);
partitions-0.2.4/src/partition_vec.rs:/// partition_vec.union(2, 3);
partitions-0.2.4/src/partition_vec.rs:/// [disjoint-sets/union-find]: https://en.wikipedia.org/wiki/Disjoint-set_data_structure
partitions-0.2.4/src/partition_vec.rs:                    partition_vec.union(index, last_index);
partitions-0.2.4/src/partition_vec.rs:    /// partition_vec.union(1, 2);
partitions-0.2.4/src/partition_vec.rs:    /// partition_vec.union(2, 3);
partitions-0.2.4/src/partition_vec.rs:    pub fn union(&mut self, first_index: usize, second_index: usize) {
partitions-0.2.4/src/partition_vec.rs:    /// partition_vec.union(1, 3);
partitions-0.2.4/src/partition_vec.rs:    /// partition_vec.union(0, 1);
partitions-0.2.4/src/partition_vec.rs:    /// partition_vec.union(1, 3);
partitions-0.2.4/src/partition_vec.rs:    /// partition_vec.union(0, 1);
partitions-0.2.4/src/partition_vec.rs:    /// partition_vec.union(1, 3);
partitions-0.2.4/src/partition_vec.rs:    /// partition_vec.union(0, 2);
bellperson-0.2.0/src/lib.rs:        coeff.negate();
bloom-0.3.2/src/bloom.rs:    fn intersect(&mut self, other: &BloomFilter) -> bool {
bloom-0.3.2/src/bloom.rs:        self.bits.intersect(&other.bits)
bloom-0.3.2/src/bloom.rs:    /// Calculates the union of two BloomFilters.  Items inserted into
bloom-0.3.2/src/bloom.rs:    fn union(&mut self, other: &BloomFilter) -> bool {
bloom-0.3.2/src/bloom.rs:        self.bits.union(&other.bits)
bloom-0.3.2/src/bloom.rs:    fn intersect() {
bloom-0.3.2/src/bloom.rs:        b1.intersect(&b2);
bloom-0.3.2/src/bloom.rs:    fn union() {
bloom-0.3.2/src/bloom.rs:        b1.union(&b2);
bloom-0.3.2/src/lib.rs:    fn intersect(&mut self, other: &Self) -> bool;
bloom-0.3.2/src/lib.rs:    fn union(&mut self, other: &Self) -> bool;
locustdb-0.2.1/src/storage_format.capnp:    range: union {
locustdb-0.2.1/src/storage_format.capnp:    union {
locustdb-0.2.1/src/storage_format.capnp:    union {
bit-array-0.4.4/src/bench.rs:        b1.union(&b2)
bellman-0.1.0/src/lib.rs:        coeff.negate();
bit-set-0.5.1/src/lib.rs:    /// Iterator over each usize stored in `self` union `other`.
bit-set-0.5.1/src/lib.rs:    /// for x in a.union(&b) {
bit-set-0.5.1/src/lib.rs:    pub fn union<'a>(&'a self, other: &'a Self) -> Union<'a, B> {
bit-set-0.5.1/src/lib.rs:    /// Iterator over each usize stored in `self` intersect `other`.
bit-set-0.5.1/src/lib.rs:        // Check that `self` intersect `other` is self
bit-set-0.5.1/src/lib.rs:        let actual: Vec<_> = a.union(&b).collect();
bit-array-0.4.4/src/lib.rs:// FIXME(tbu-): `BitVec`'s methods shouldn't be `union`, `intersection`, but
bit-array-0.4.4/src/lib.rs:/// bv.negate();
bit-array-0.4.4/src/lib.rs:    /// bv.negate();
bit-array-0.4.4/src/lib.rs:    pub fn negate(&mut self) {
bit-array-0.4.4/src/lib.rs:    /// Calculates the union of two bitarrays. This acts like the bitwise `or`
bit-array-0.4.4/src/lib.rs:    /// Sets `self` to the union of `self` and `other`. Both bitarrays must be
bit-array-0.4.4/src/lib.rs:    /// assert!(a.union(&b));
bit-array-0.4.4/src/lib.rs:    pub fn union(&mut self, other: &Self) -> bool {
bit-array-0.4.4/src/lib.rs:    /// assert!(a.intersect(&b));
bit-array-0.4.4/src/lib.rs:    pub fn intersect(&mut self, other: &Self) -> bool {
cfg-0.3.0/src/cycles.rs:                        // Get the union of `n`th row and column.
bitarray-0.1.2/benches/bench.rs:    b.iter(|| b1.union(&b2))
bitarray-0.1.2/src/lib.rs:// FIXME(tbu-): `BitVec`'s methods shouldn't be `union`, `intersection`, but
bitarray-0.1.2/src/lib.rs:/// bv.negate();
bitarray-0.1.2/src/lib.rs:    /// bv.negate();
bitarray-0.1.2/src/lib.rs:    pub fn negate(&mut self) {
bitarray-0.1.2/src/lib.rs:    /// Calculates the union of two bitarrays. This acts like the bitwise `or`
bitarray-0.1.2/src/lib.rs:    /// Sets `self` to the union of `self` and `other`. Both bitarrays must be
bitarray-0.1.2/src/lib.rs:    /// assert!(a.union(&b));
bitarray-0.1.2/src/lib.rs:    pub fn union(&mut self, other: &Self) -> bool {
bitarray-0.1.2/src/lib.rs:    /// assert!(a.intersect(&b));
bitarray-0.1.2/src/lib.rs:    pub fn intersect(&mut self, other: &Self) -> bool {
rtps-rs-0.1.1/LICENSE.md:      "Legal Entity" shall mean the union of the acting entity and all
contest-algorithms-0.1.2/src/graph/mod.rs:/// Represents a union of disjoint sets. Each set's elements are arranged in a
contest-algorithms-0.1.2/src/graph/mod.rs:    /// union. Returns true if u and v were previously in different sets.
exonum-0.11.0/src/storage/mod.rs://! that their key spaces do not intersect. Isolation is commonly achieved with the help
bellman_ce-0.3.0/src/tests/dummy_engine.rs:    fn negate(&mut self) {
bellman_ce-0.3.0/src/tests/dummy_engine.rs:    fn negate(&mut self) {
bellman_ce-0.3.0/src/tests/dummy_engine.rs:        <Fr as Field>::negate(self);
bellman_ce-0.3.0/src/tests/dummy_engine.rs:    fn negate(&mut self) {
bellman_ce-0.3.0/src/tests/dummy_engine.rs:        <Fr as Field>::negate(self);
bellman_ce-0.3.0/src/groth16/verifier.rs:    gamma.negate();
bellman_ce-0.3.0/src/groth16/verifier.rs:    delta.negate();
bellperson-0.2.0/src/groth16/verifier.rs:    gamma.negate();
bellperson-0.2.0/src/groth16/verifier.rs:    delta.negate();
bellman_ce-0.3.0/src/sonic/util.rs:    b.negate();
bellman_ce-0.3.0/src/sonic/util.rs:    neg_x_n_minus_d_precomp.negate();
bellman_ce-0.3.0/src/sonic/util.rs:    z_neg.negate();
bellman-0.1.0/src/groth16/verifier.rs:    gamma.negate();
bellman-0.1.0/src/groth16/verifier.rs:    delta.negate();
cfg-0.3.0/src/sequence/mod.rs:    /// The union of `Trailing` and `Proper`. In other words, the trailing separator may or may not
bip39-0.6.0-beta.1/src/langs/french.txt:union
bellman_ce-0.3.0/src/sonic/helped/helper.rs:        value.negate();
bellman_ce-0.3.0/src/sonic/helped/helper.rs:            value.negate();
bellman_ce-0.3.0/src/sonic/helped/helper.rs:        value.negate();
bellman_ce-0.3.0/src/sonic/helped/poly.rs:            new.negate();
bellman_ce-0.3.0/src/sonic/helped/poly.rs:            tmp.negate();
bellman_ce-0.3.0/src/sonic/helped/batch.rs:                tmp.negate();
bellman_ce-0.3.0/src/sonic/helped/batch.rs:                tmp.negate();
bellman_ce-0.3.0/src/sonic/helped/batch.rs:        r.negate();
bellman_ce-0.3.0/src/sonic/helped/prover.rs:        open.negate();
bellman_ce-0.3.0/src/sonic/helped/prover.rs:    poly[4].negate();
bellman_ce-0.3.0/src/sonic/helped/prover.rs:    neg_x_n_minus_d_precomp.negate();
bellman_ce-0.3.0/src/sonic/helped/prover.rs:    z_neg.negate();
bellman_ce-0.3.0/src/sonic/unhelped/s2_proof.rs:            poly[0].negate();
bellman_ce-0.3.0/src/sonic/unhelped/s2_proof.rs:            poly[0].negate();
bellman_ce-0.3.0/src/sonic/unhelped/s2_proof.rs:        h_prep.negate();
bellman_ce-0.3.0/src/sonic/helped/parameters.rs:                tmp.negate();
bellman_ce-0.3.0/src/sonic/helped/parameters.rs:                tmp.negate();
bellman_ce-0.3.0/src/sonic/unhelped/wellformed_argument.rs:        h_prep.negate();
bellman_ce-0.3.0/src/sonic/cs/lc.rs:                with.negate();
bellman_ce-0.3.0/src/sonic/cs/lc.rs:                a.negate();
bellman_ce-0.3.0/src/sonic/helped/generator.rs:            tmp.negate();
bellman_ce-0.3.0/src/sonic/helped/generator.rs:            tmp.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:            constant_term.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:                tmp.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        e_val.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        f_val.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        e_val.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        f_val.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        h_x_n_plus_one_precomp.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        h_prep.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        yz_neg.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        h_prep.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        minus_y.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        minus_z.negate();
bellman_ce-0.3.0/src/sonic/unhelped/grand_product_argument.rs:        minus_z_inv.negate();
bellperson-0.2.0/src/groth16/tests/dummy_engine.rs:    fn negate(&mut self) {
bellperson-0.2.0/src/groth16/tests/dummy_engine.rs:    fn negate(&mut self) {
bellperson-0.2.0/src/groth16/tests/dummy_engine.rs:        <Fr as Field>::negate(self);
bellperson-0.2.0/src/groth16/tests/dummy_engine.rs:    fn negate(&mut self) {
bellperson-0.2.0/src/groth16/tests/dummy_engine.rs:        <Fr as Field>::negate(self);
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        v_neg.negate();
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        s_zy_neg.negate();
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        // h_prep.negate();
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        //     minus_z_prime.negate();
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        //     minus_yz.negate();
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        h_prep.negate();
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        minus_yz.negate();
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        minus_z_prime.negate();
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        h_prep.negate();
bellman_ce-0.3.0/src/sonic/unhelped/permutation_argument.rs:        minus_z.negate();
bellman-0.1.0/src/groth16/tests/dummy_engine.rs:    fn negate(&mut self) {
bellman-0.1.0/src/groth16/tests/dummy_engine.rs:    fn negate(&mut self) {
bellman-0.1.0/src/groth16/tests/dummy_engine.rs:        <Fr as Field>::negate(self);
bellman-0.1.0/src/groth16/tests/dummy_engine.rs:    fn negate(&mut self) {
bellman-0.1.0/src/groth16/tests/dummy_engine.rs:        <Fr as Field>::negate(self);
locustdb-0.2.1/src/engine/planning/query_plan.rs:                        bail!(QueryError::TypeError, "Found negate({:?}), expected negate(integer)", &t)