Struct KeywordSet 

pub struct KeywordSet(/* private fields */);

A const bitset giving every Keyword discriminant its own bit.

Backed by [u64; KEYWORD_WORDS] rather than a single u64, so reservation stays a one-bit-test per-position lookup while scaling past 64 keywords with no representation change. Membership and union are O(1) and const, so the per-position sets fold at compile time.

Implementations

impl KeywordSet

pub const EMPTY: Self

The empty keyword set.

pub const fn from_keywords(keywords: &[Keyword]) -> Self

Build a set from keywords.

pub const fn union(self, other: Self) -> Self

The union of two sets — the per-position reject sets are built by unioning the generated kwlist.h category bitsets (e.g. a ColId rejects type_func_name ∪ reserved), so this must be const.

pub const fn difference(self, other: Self) -> Self

The set difference self \ other — every keyword in self that is not in other. Carves a small allowlist out of a broad reserved set (MySQL admits its reserved window-function names — ROW_NUMBER, RANK, … — as call heads via a dedicated grammar, so its function-name reject set is the reserved set minus those), so it must be const to fold at compile time alongside union.

pub const fn contains(self, keyword: Keyword) -> bool

True if keyword is present.

Trait Implementations

impl Clone for KeywordSet

fn clone(&self) -> KeywordSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for KeywordSet

impl Debug for KeywordSet

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

Formats the value using the given formatter.

impl Eq for KeywordSet

impl PartialEq for KeywordSet

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for KeywordSet