Enum AllowedSet 

pub enum AllowedSet {
    Only(BTreeSet<u32>),
    Mask(Vec<bool>),
}

Which next-token ids a constraint permits at the current step.

Two shapes, because two very different constraints want very different storage:

• AllowedSet::Only — a sparse set: “only these handful of ids, mask everything else”. Right for a fixed tool-name enum over a 150k vocab, where listing the allowed ids is far cheaper than a 150k-entry bool vector.
• AllowedSet::Mask — a dense allow-mask, one bool per vocab id. Right for a structural constraint that has to test every candidate token anyway (see JsonStructure::allowed), so the per-id answer is already computed.

Variants

Only(BTreeSet<u32>)

Only these ids are allowed; every other id is masked.

Mask(Vec<bool>)

One bool per vocab id: mask[id] allowed iff true. An id past the end of the vector is treated as not allowed.

Implementations

impl AllowedSet

pub fn contains(&self, id: u32) -> bool

Is token id allowed by this set?

For AllowedSet::Mask, an id at or past the mask length is not allowed — a mask sized to a smaller vocab than the logits row can never accidentally green-light a token it never considered.

Trait Implementations

impl Clone for AllowedSet

fn clone(&self) -> AllowedSet

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AllowedSet

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for AllowedSet

impl PartialEq for AllowedSet

fn eq(&self, other: &AllowedSet) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for AllowedSet