one

Author: rinarakaki

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "repr"
-version = "0.6.0"
+version = "0.7.0"
 edition = "2021"
 description = "The regular-expression-as-linear-logic interpretation and its implementation"
 license = "MIT/Apache-2.0"

src/exponential.rs

@@ -1 +1 @@
-//! TODO(rnarkk) construct DFA from NFA
+//! TODO(rinarakaki) construct DFA from NFA

src/interval.rs

@@ -14,7 +14,7 @@ use crate::repr::Repr::{self, Or, Zero};
 use crate::traits::Integral;
 
 #[unconst]
-// TODO(rnarkk) Does negative Interval (self.1 < self.0) have use case?
+// TODO(rinarakaki) Does negative Interval (self.1 < self.0) have use case?
 #[derive_const(Clone, Default, PartialEq, PartialOrd, Ord)]
 #[derive(Copy, Debug, Eq)]
 pub struct Interval<I: ~const Integral>(pub I, pub I);
@@ -116,7 +116,7 @@ impl<I: ~const Integral> Interval<I> {
     //     Self::full().sub(self)
     // }
 
-    // TODO(rnarkk) Why not simply `other.0 <= self.0 && self.1 <= other.1`
+    // TODO(rinarakaki) Why not simply `other.0 <= self.0 && self.1 <= other.1`
     /// a ⊆ b
     pub const fn le(&self, other: &Self) -> bool {
         (other.0 <= self.0 && self.0 <= other.1) && (other.0 <= self.1 && self.1 <= other.1)

src/lib.rs

@@ -1,4 +1,5 @@
 // #![no_std]
+#![feature(exact_size_is_empty)]
 #![feature(pattern)]
 #![feature(step_trait)]
 #![feature(stmt_expr_attributes)]
@@ -22,9 +23,7 @@ mod context;
 mod conversion;
 mod functor;
 mod interval;
-mod operators;
 // mod partition;
-// mod pattern;
 // mod pool;
 // mod process;
 mod regex;

src/partition.rs

@@ -1,7 +1,7 @@
 //! <https://en.m.wikipedia.org/wiki/Partition_of_a_set>
 //! <https://en.m.wikipedia.org/wiki/Covering_problems>
 //! <https://en.m.wikipedia.org/wiki/Exact_cover>
-//! 
+//!
 //! <https://en.wikipedia.org/wiki/Interval_tree>
 //! <https://en.wikipedia.org/wiki/Segment_tree>
 //! <https://en.wikipedia.org/wiki/Range_tree>
@@ -11,8 +11,8 @@
 //! <https://en.wikipedia.org/wiki/Suffix_tree>
 //! <https://en.wikipedia.org/wiki/Suffix_automaton>
 //! <https://en.wikipedia.org/wiki/LCP_array>
-//! 
-//! TODO(rnarkk)
+//!
+//! TODO(rinarakaki)
 //! - Uniqueness
 
 use core::iter::FusedIterator;

src/quotient/search.rs

@@ -13,7 +13,7 @@ fn build_aho_corasick(parsed: &Parsed<I>) -> Option<AhoCorasick<u32>> {
     if parsed.reprs.len() != 1 {
         return None;
     }
-    // TODO(rnarkk)
+    // TODO(rinarakaki)
     // let lits = match or_constants(&parsed.reprs[0]) {
     //     None => return None,
     //     Some(lits) => lits,

src/regex.rs

@@ -1,7 +1,7 @@
 use regex::{Captures, Regex};
 use unconst::unconst;
 
-use crate::{wrappers::empty, Repr};
+use crate::{wrappers::one, Repr};
 
 #[unconst]
 impl Repr<char> {
@@ -34,7 +34,7 @@ impl Repr<char> {
             },
             Repr::Interval(i) => format!("[{}-{}]", i.0, i.1),
             Repr::Mul(lhs, rhs) => format!("{}{}", lhs.to_regex_string(), rhs.to_regex_string()),
-            Repr::Or(lhs, rhs) if lhs.as_ref() == &empty() => {
+            Repr::Or(lhs, rhs) if lhs.as_ref() == &one() => {
                 format!("({})?", rhs.to_regex_string())
             }
             Repr::Or(lhs, rhs) => format!("({}|{})", lhs.to_regex_string(), rhs.to_regex_string()),