bytes/bytes.go

@@ -1,16 +0,0 @@
-package bytes
-
-import (
-	"git.codemonkeysoftware.net/b/gigaparsec"
-)
-
-func Token[Out, WSOut any](whitespace gigaparsec.Parser[byte, WSOut]) func(p gigaparsec.Parser[byte, Out]) gigaparsec.Parser[byte, Out] {
-	mappedWS := gigaparsec.Map(whitespace, func(WSOut) struct{} { return struct{}{} })
-	var ignoreWS gigaparsec.Parser[byte, struct{}] = func(s gigaparsec.State[byte]) (gigaparsec.Result[byte, struct{}], error) {
-		result, err := mappedWS(s)
-		return result.Consume(false), err
-	}
-	return func(p gigaparsec.Parser[byte, Out]) gigaparsec.Parser[byte, Out] {
-		return gigaparsec.Seq2(p, gigaparsec.Repeat(0, ignoreWS), func(val Out, _ []struct{}) Out { return val })
-	}
-}

gigaparsec.go

@@ -194,17 +194,6 @@ func (p Parser[In, Out]) Label(label string) Parser[In, Out] {
 	}
 }
 
-func (p Parser[In, Out]) Where(pred func(Out) bool) Parser[In, Out] {
-	return func(s State[In]) (Result[In, Out], error) {
-		result, err := p(s)
-		if result.success && !pred(result.value) {
-			result.success = false
-			result.message.got = "failed Where predicate"
-		}
-		return result, err
-	}
-}
-
 type ParseError Message
 
 func (pe ParseError) Error() string {
@@ -414,16 +403,3 @@ func Repeat[In, Out any](minCount int, p Parser[In, Out]) Parser[In, []Out] {
 		}
 	}
 }
-
-// Lazy delays creating a parser from p until the parser is called.
-// This is useful for preventing recursive function calls in the
-// definition of a recursive parser.
-func Lazy[In, Out any](p func() Parser[In, Out]) Parser[In, Out] {
-	return func(s State[In]) (Result[In, Out], error) {
-		return p()(s)
-	}
-}
-
-func Bracket[In, Out, LOut, ROut any](left Parser[In, LOut], p Parser[In, Out], right Parser[In, ROut]) Parser[In, Out] {
-	return Seq3(left, p, right, func(_ LOut, val Out, _ ROut) Out { return val })
-}

parser_test.go

@@ -210,11 +210,3 @@ func TestRepeat(t *testing.T) {
 		test.False(t, succeeded)
 	})
 }
-
-func TestBracket(t *testing.T) {
-	Todo(t)
-}
-
-func TestWhere(t *testing.T) {
-	Todo(t)
-}