Struct GREATEST_COMMON_DIVISOR

pub struct GREATEST_COMMON_DIVISOR { /* private fields */ }

Methods from Deref<Target = Program>

pub fn labelled_instructions(&self) -> Vec<LabelledInstruction>

pub fn is_breakpoint(&self, address: u64) -> bool

pub fn type_hints_at(&self, address: u64) -> Vec<TypeHint>

pub fn assertion_context_at(&self, address: u64) -> Option<AssertionContext>

pub fn to_bwords(&self) -> Vec<BFieldElement>

Turn the program into a sequence of BFieldElements. Each instruction is encoded as its opcode, followed by its argument (if any).

Note: This is almost (but not quite!) equivalent to encoding the program. For that, use encode() instead.

pub fn len_bwords(&self) -> usize

The total length of the program as BFieldElements. Double-word instructions contribute two BFieldElements.

pub fn is_empty(&self) -> bool

pub fn hash(&self) -> Digest

Produces the program’s canonical hash digest. Uses Tip5, the canonical hash function for Triton VM.

pub fn label_for_address(&self, address: u64) -> String

The label for the given address, or a deterministic, unique substitute if no label is found.

Trait Implementations

impl Deref for GREATEST_COMMON_DIVISOR

type Target = Program

The resulting type after dereferencing.

fn deref(&self) -> &Program

Dereferences the value.

impl LazyStatic for GREATEST_COMMON_DIVISOR