MCPcopy Create free account

hub / github.com/advancedresearch/pocket_prover / functions

Functions209 in github.com/advancedresearch/pocket_prover

↓ 80 callersFunctionimply
First argument implies the second.
src/lib.rs:1324
↓ 59 callersFunctionconstruct
(input: TokenStream)
pocket_prover-derive/src/lib.rs:49
↓ 56 callersFunctioncall
(mut fun: impl FnMut() -> u64)
src/lib.rs:828
↓ 37 callersFunctionand
Returns `true` if all arguments are `true`.
src/lib.rs:1316
↓ 35 callersFunctionnot
If input is `true`, returns `false` and vice versa.
src/lib.rs:1307
↓ 24 callersFunctionor
Returns `true` if at least one argument is `true`.
src/lib.rs:1318
↓ 18 callersFunctionqubit
Prepares a qubit using a proposition as seed.
src/lib.rs:648
↓ 14 callersFunctioneq
Returns `true` if arguments are equal.
src/lib.rs:1322
↓ 8 callersFunctionand3
An AND relation of 3 argument.
src/lib.rs:1369
↓ 7 callersFunctionand4
An AND relation of 4 arguments.
src/lib.rs:1371
↓ 6 callersFunctionand5
An AND relation of 5 arguments.
src/lib.rs:1373
↓ 6 callersFunctioncountn
Counts the number of solutions of an n-argument boolean function.
src/lib.rs:903
↓ 6 callersFunctionor3
An OR relation of 3 arguments.
src/lib.rs:1416
↓ 6 callersFunctionor4
An OR relation of 4 arguments.
src/lib.rs:1418
↓ 5 callersFunctionhom_f
Path semantical function `f_n(a, b)` up to some homotopy level `n`.
src/lib.rs:688
↓ 5 callersFunctionor5
An OR relation of 5 arguments.
src/lib.rs:1420
↓ 3 callersFunctionand6
An AND relation of 6 arguments.
src/lib.rs:1375
↓ 3 callersFunctionand7
An AND relation of 7 arguments.
src/lib.rs:1379
↓ 3 callersFunctionand8
An AND relation of 8 arguments.
src/lib.rs:1383
↓ 3 callersFunctionand9
An AND relation of 9 arguments.
src/lib.rs:1387
↓ 3 callersFunctionaqual
Path semantical aquality `a ~¬~ b`. For more information, see [paper](https://github.com/advancedresearch/path_semantics/blob/master/papers-wip2/path
src/lib.rs:678
↓ 3 callersFunctioncount1
Counts the number of solutions of a 1-argument boolean function.
src/lib.rs:837
↓ 3 callersFunctioncount2
Counts the number of solutions of a 2-argument boolean function.
src/lib.rs:841
↓ 3 callersFunctionqual
Path semantical quality `a ~~ b`.
src/lib.rs:673
↓ 2 callersFunctionand10
An AND relation of 10 arguments.
src/lib.rs:1391
↓ 2 callersFunctioncount10
Counts the number of solutions of a 10-argument boolean function.
src/lib.rs:884
↓ 2 callersFunctioncount3
Counts the number of solutions of a 3-argument boolean function.
src/lib.rs:845
↓ 2 callersFunctioncount4
Counts the number of solutions of a 4-argument boolean function.
src/lib.rs:849
↓ 2 callersFunctioncount5
Counts the number of solutions of a 5-argument boolean function.
src/lib.rs:853
↓ 2 callersFunctioncount6
Counts the number of solutions of a 6-argument boolean function.
src/lib.rs:857
↓ 2 callersFunctioncount7
Counts the number of solutions of a 7-argument boolean function.
src/lib.rs:861
↓ 2 callersFunctioncount8
Counts the number of solutions of an 8-argument boolean function.
src/lib.rs:866
↓ 2 callersFunctioncount9
Counts the number of solutions of a 9-argument boolean function.
src/lib.rs:873
↓ 2 callersMethodfull_rules
(&self)
src/lib.rs:1949
↓ 2 callersFunctionhom_eq
Aligns equality of qubits up to some homotopy level.
src/lib.rs:706
↓ 2 callersMethodinner
(&self)
src/lib.rs:1788
↓ 2 callersFunctionmeasure
Measures result repeatedly.
src/lib.rs:820
↓ 2 callersFunctionor10
An OR relation of 10 arguments.
src/lib.rs:1436
↓ 2 callersFunctionor6
An OR relation of 6 arguments.
src/lib.rs:1422
↓ 2 callersFunctionor7
An OR relation of 7 arguments.
src/lib.rs:1424
↓ 2 callersFunctionor8
An OR relation of 8 arguments.
src/lib.rs:1428
↓ 2 callersFunctionor9
An OR relation of 9 arguments.
src/lib.rs:1432
↓ 2 callersFunctionpath1_count10
Path Semantical Logic: Counts the number of solutions of a 10-argument boolean function, For more information, see the section "Path Semantical Logic
src/lib.rs:1083
↓ 2 callersFunctionpath1_count3
Path Semantical Logic: Counts the number of solutions of a 3-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:973
↓ 2 callersFunctionpath1_count4
Path Semantical Logic: Counts the number of solutions of a 4-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:982
↓ 2 callersFunctionpath1_count5
Path Semantical Logic: Counts the number of solutions of a 5-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:992
↓ 2 callersFunctionpath1_count6
Path Semantical Logic: Counts the number of solutions of a 6-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:1003
↓ 2 callersFunctionpath1_count7
Path Semantical Logic: Counts the number of solutions of a 7-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:1015
↓ 2 callersFunctionpath1_count8
Path Semantical Logic: Counts the number of solutions of a 8-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:1028
↓ 2 callersFunctionpath1_count9
Path Semantical Logic: Counts the number of solutions of a 9-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:1050
↓ 2 callersFunctionpath1_countnm
Path Semantical Logic: Counts the number of solutions of a n+m-argument boolean function, For more information, see the section "Path Semantical Logi
src/lib.rs:1153
↓ 2 callersFunctionpath1_lennm
Path Semantical Logic: Computes number of cases. For proof of formula, see https://github.com/advancedresearch/path_semantics/blob/master/papers-wip/
src/lib.rs:1287
↓ 2 callersFunctionxor
Returns `true` if only one argument is `true`.
src/lib.rs:1320
↓ 2 callersFunctionxor3
An XOR relation of 3 arguments.
src/lib.rs:1461
↓ 2 callersFunctionxor4
An XOR relation of 4 arguments.
src/lib.rs:1468
↓ 2 callersFunctionxor5
An XOR relation of 5 arguments.
src/lib.rs:1475
↓ 2 callersFunctionxor6
An XOR relation of 6 arguments.
src/lib.rs:1482
↓ 2 callersFunctionxor7
An XOR relation of 7 arguments.
src/lib.rs:1489
↓ 2 callersFunctionxor8
An XOR relation of 8 arguments.
src/lib.rs:1496
↓ 2 callersFunctionxor9
An XOR relation of 9 arguments.
src/lib.rs:1503
↓ 1 callersMethodcore_rules
(&self)
src/lib.rs:1793
↓ 1 callersMethodextend_rules
(&self, _: &Self::Inner)
src/lib.rs:1789
↓ 1 callersFunctionimpl_construct
(ast: &syn::DeriveInput)
pocket_prover-derive/src/lib.rs:63
↓ 1 callersFunctionimply10
An IMPLY chain of 10 arguments.
src/lib.rs:1570
↓ 1 callersFunctionimply3
An IMPLY chain of 3 arguments.
src/lib.rs:1543
↓ 1 callersFunctionimply4
An IMPLY chain of 4 arguments.
src/lib.rs:1545
↓ 1 callersFunctionimply5
An IMPLY chain of 5 arguments.
src/lib.rs:1549
↓ 1 callersFunctionimply6
An IMPLY chain of 6 arguments.
src/lib.rs:1553
↓ 1 callersFunctionimply7
An IMPLY chain of 7 arguments.
src/lib.rs:1557
↓ 1 callersFunctionimply8
An IMPLY chain of 8 arguments.
src/lib.rs:1561
↓ 1 callersFunctionimply9
An IMPLY chain of 9 arguments.
src/lib.rs:1565
↓ 1 callersFunctionis_groupoid_n
Defines an n-groupoid relation from `x` to `a` and `b`.
src/lib.rs:794
↓ 1 callersFunctionis_prop
Defines a proposition relation of proposition `x` to potential proofs `a` and `b`.
src/lib.rs:770
↓ 1 callersMethodmin_energy
(self, other: bool)
src/lib.rs:590
↓ 1 callersFunctionorn
An OR relation of variable number of arguments.
src/lib.rs:1443
↓ 1 callersFunctionpath1_count1
Path Semantical Logic: Counts the number of solutions of a 1-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:961
↓ 1 callersFunctionpath1_count2
Path Semantical Logic: Counts the number of solutions of a 2-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:967
↓ 1 callersFunctionpath1_countn
Path Semantical Logic: Counts the number of solutions of a n-argument boolean function, For more information, see the section "Path Semantical Logic"
src/lib.rs:1129
↓ 1 callersFunctionprove1
Returns `true` if proposition is correct, `false` otherwise.
src/lib.rs:1186
↓ 1 callersFunctionprove2
Returns `true` if proposition is correct, `false` otherwise.
src/lib.rs:1188
↓ 1 callersFunctionps_acore
Assumes the path semantical acore axiom. This is the same as the path semantical core axiom, but using aquality instead of quality. For more informa
src/lib.rs:736
↓ 1 callersFunctionps_acore_eq
Assumes a strong version of the path semantical acore axiom. This is the same as the strong version of path semantical core axiom, but using aquality
src/lib.rs:751
↓ 1 callersFunctionps_core
Assumes the path semantical core axiom.
src/lib.rs:726
↓ 1 callersFunctionps_core_eq
Assumes a strong version of the path semantical core axiom.
src/lib.rs:741
↓ 1 callersFunctionun_sesh
Removes Sesh property from a proposition. Sesh is the property that `!~a == ~!a`, which holds for `qubit` (`~`). Sometimes you want to get rid of thi
src/lib.rs:604
↓ 1 callersFunctionxor10
An XOR relation of 10 arguments.
src/lib.rs:1510
Functionall
Enumerates the type, checking that all outputs are true.
src/lib.rs:1639
Functionamplify
Amplify a "wavefunction" of a proposition using its qubit transform.
src/lib.rs:662
Functionandn
An AND relation of variable number of arguments.
src/lib.rs:1398
Functionany
Enumerates the type, checking that at least one output is true.
src/lib.rs:1629
Functionatom
(a: u64, atom: u64)
examples/molecule.rs:28
Functionbar_a_b
()
pocket_prover-derive/tests/lib.rs:29
Functionbar_bar_foo_a_b
()
pocket_prover-derive/tests/lib.rs:47
Functionbar_foo_a_b
()
pocket_prover-derive/tests/lib.rs:37
Functionbit
Converts a boolean to a bit.
src/extract.rs:34
Functionbitf
If the bit argument is `0`, returns `not`, else `id`.
src/extract.rs:40
Functionbitv
Converts a bit to a boolean.
src/extract.rs:37
Functionbond
(a: u64, b: u64, bond: u64)
examples/molecule.rs:29
Methodconstruct
(_vs: &[u64])
src/lib.rs:2056
Functioncont
Path semantical continuous map `a ~> b`.
src/lib.rs:670
next →1–100 of 209, ranked by callers