Compare commits
No commits in common. "main" and "v0.0.10" have entirely different histories.
@ -6,5 +6,4 @@ import (
|
|||||||
|
|
||||||
var (
|
var (
|
||||||
ErrNothingToUnread = adverr.NewErrTmpl("ErrNothingToUnread", "Unreading failed because there wasn't any Read yet")
|
ErrNothingToUnread = adverr.NewErrTmpl("ErrNothingToUnread", "Unreading failed because there wasn't any Read yet")
|
||||||
ErrPopFailed = adverr.NewErrTmpl("ErrPopFailed", "stack cannot be popped. It was never pushed")
|
|
||||||
)
|
)
|
||||||
|
9
go.mod
9
go.mod
@ -1,11 +1,8 @@
|
|||||||
module git.tordarus.net/tordarus/bufr
|
module git.milar.in/milarin/bufr
|
||||||
|
|
||||||
go 1.19
|
go 1.19
|
||||||
|
|
||||||
require (
|
require (
|
||||||
git.tordarus.net/tordarus/adverr v1.1.0
|
git.milar.in/milarin/adverr v1.1.0
|
||||||
git.tordarus.net/tordarus/ds v0.0.2
|
git.milar.in/milarin/ds v0.0.2
|
||||||
git.tordarus.net/tordarus/slices v0.0.8
|
|
||||||
)
|
)
|
||||||
|
|
||||||
require git.tordarus.net/tordarus/gmath v0.0.3 // indirect
|
|
||||||
|
8
go.sum
8
go.sum
@ -1,8 +1,8 @@
|
|||||||
git.milar.in/milarin/adverr v1.1.0 h1:jD9WnOvs40lfMhvqQ7cllOaRJNBMWr1f07/s9jAadp0=
|
git.milar.in/milarin/adverr v1.1.0 h1:jD9WnOvs40lfMhvqQ7cllOaRJNBMWr1f07/s9jAadp0=
|
||||||
git.milar.in/milarin/adverr v1.1.0/go.mod h1:joU9sBb7ySyNv4SpTXB0Z4o1mjXsArBw4N27wjgzj9E=
|
git.milar.in/milarin/adverr v1.1.0/go.mod h1:joU9sBb7ySyNv4SpTXB0Z4o1mjXsArBw4N27wjgzj9E=
|
||||||
|
git.milar.in/milarin/ds v0.0.0-20230120204927-7dc44b9cd222 h1:r7gcMqltPqk9U2/+LzEN5dooZ5wiQ8C7SI/nK6T0KjA=
|
||||||
|
git.milar.in/milarin/ds v0.0.0-20230120204927-7dc44b9cd222/go.mod h1:HJK7QERcRvV9j7xzEocrKUtW+1q4JB1Ly4Bj54chfwI=
|
||||||
|
git.milar.in/milarin/ds v0.0.1 h1:ov4Rp+QiB3xtmV0a4eC+LluxWEOvbykgW+wCchYEp9o=
|
||||||
|
git.milar.in/milarin/ds v0.0.1/go.mod h1:HJK7QERcRvV9j7xzEocrKUtW+1q4JB1Ly4Bj54chfwI=
|
||||||
git.milar.in/milarin/ds v0.0.2 h1:vCA3mDxZUNfvHpzrdz7SeBUKiPn74NTopo915IUG7I0=
|
git.milar.in/milarin/ds v0.0.2 h1:vCA3mDxZUNfvHpzrdz7SeBUKiPn74NTopo915IUG7I0=
|
||||||
git.milar.in/milarin/ds v0.0.2/go.mod h1:HJK7QERcRvV9j7xzEocrKUtW+1q4JB1Ly4Bj54chfwI=
|
git.milar.in/milarin/ds v0.0.2/go.mod h1:HJK7QERcRvV9j7xzEocrKUtW+1q4JB1Ly4Bj54chfwI=
|
||||||
git.milar.in/milarin/gmath v0.0.3 h1:ii6rKNItS55O/wtIFhD1cTN2BMwDZjTBmiOocKURvxM=
|
|
||||||
git.milar.in/milarin/gmath v0.0.3/go.mod h1:HDLftG5RLpiNGKiIWh+O2G1PYkNzyLDADO8Cd/1abiE=
|
|
||||||
git.milar.in/milarin/slices v0.0.8 h1:qN9TE3tkArdTixMKSnwvNPcApwAjxpLVwA5a9k1rm2s=
|
|
||||||
git.milar.in/milarin/slices v0.0.8/go.mod h1:qMhdtMnfWswc1rHpwgNw33lB84aNEkdBn5BDiYA+G3k=
|
|
||||||
|
@ -10,7 +10,7 @@ func (p *Position) Advance(rn rune) {
|
|||||||
p.Index++
|
p.Index++
|
||||||
if rn == '\n' {
|
if rn == '\n' {
|
||||||
p.Line++
|
p.Line++
|
||||||
p.Column = 1
|
p.Column = 0
|
||||||
} else {
|
} else {
|
||||||
p.Column++
|
p.Column++
|
||||||
}
|
}
|
||||||
|
104
reader.go
104
reader.go
@ -6,13 +6,10 @@ import (
|
|||||||
"strings"
|
"strings"
|
||||||
|
|
||||||
"git.milar.in/milarin/ds"
|
"git.milar.in/milarin/ds"
|
||||||
"git.milar.in/milarin/slices"
|
|
||||||
)
|
)
|
||||||
|
|
||||||
type Reader struct {
|
type Reader struct {
|
||||||
buf ds.Stack[posRune]
|
buf ds.Stack[posRune]
|
||||||
indices ds.Stack[uint64]
|
|
||||||
index uint64
|
|
||||||
src *bufio.Reader
|
src *bufio.Reader
|
||||||
pos *Position
|
pos *Position
|
||||||
}
|
}
|
||||||
@ -21,9 +18,7 @@ func New(r io.Reader) *Reader {
|
|||||||
return &Reader{
|
return &Reader{
|
||||||
buf: ds.NewArrayStack[posRune](),
|
buf: ds.NewArrayStack[posRune](),
|
||||||
src: bufio.NewReader(r),
|
src: bufio.NewReader(r),
|
||||||
pos: &Position{Index: 0, Line: 1, Column: 1},
|
pos: &Position{},
|
||||||
index: 0,
|
|
||||||
indices: ds.NewArrayStack[uint64](),
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -38,8 +33,8 @@ func (r *Reader) psrn(rn rune) posRune {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func (r *Reader) Pos() Position {
|
func (r *Reader) Pos() (index, line, column int) {
|
||||||
return *r.pos
|
return r.pos.Index, r.pos.Line, r.pos.Column
|
||||||
}
|
}
|
||||||
|
|
||||||
// Rune returns the next rune in r
|
// Rune returns the next rune in r
|
||||||
@ -48,15 +43,10 @@ func (r *Reader) Rune() (rune, error) {
|
|||||||
if err == nil {
|
if err == nil {
|
||||||
r.buf.Push(r.psrn(rn))
|
r.buf.Push(r.psrn(rn))
|
||||||
r.pos.Advance(rn)
|
r.pos.Advance(rn)
|
||||||
r.index++
|
|
||||||
}
|
}
|
||||||
return rn, err
|
return rn, err
|
||||||
}
|
}
|
||||||
|
|
||||||
func (r *Reader) Buffered() int {
|
|
||||||
return r.src.Buffered()
|
|
||||||
}
|
|
||||||
|
|
||||||
// PeekRune returns the next rune in r without advancing reader position.
|
// PeekRune returns the next rune in r without advancing reader position.
|
||||||
// The next read will return the same rune again.
|
// The next read will return the same rune again.
|
||||||
func (r *Reader) PeekRune() (rune, error) {
|
func (r *Reader) PeekRune() (rune, error) {
|
||||||
@ -105,8 +95,6 @@ func (r *Reader) UnreadRune() error {
|
|||||||
r.src = prependRune(rn.Rune, r.src)
|
r.src = prependRune(rn.Rune, r.src)
|
||||||
}
|
}
|
||||||
|
|
||||||
r.index--
|
|
||||||
|
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -216,86 +204,8 @@ func (r *Reader) ExpectRune(f ...RuneFunc) (bool, error) {
|
|||||||
return findFirstTrue(rn, f), nil
|
return findFirstTrue(rn, f), nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// ExpectString calls ExpectRune for each rune in str successively.
|
// Commit clears the internal buffer and therefore removes all data which were already read.
|
||||||
// If the expected string was not found, all read runes will be unread
|
// After calling Commit any unreads will return ErrNothingToUnread until another read occured.
|
||||||
func (r *Reader) ExpectString(str string) (bool, error) {
|
func (r *Reader) Commit() {
|
||||||
read := 0
|
r.buf.Clear()
|
||||||
for _, rn := range str {
|
|
||||||
ok, err := r.ExpectRune(Is(rn))
|
|
||||||
if err != nil {
|
|
||||||
return false, err
|
|
||||||
}
|
|
||||||
|
|
||||||
read++
|
|
||||||
|
|
||||||
if !ok {
|
|
||||||
if err := r.UnreadRunes(read); err != nil {
|
|
||||||
return false, err
|
|
||||||
}
|
|
||||||
return false, nil
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return true, nil
|
|
||||||
}
|
|
||||||
|
|
||||||
// ExpectOneOfString calls ExpectString for each string successively
|
|
||||||
// and returns the string which first matched.
|
|
||||||
// The boolean value is true if any string was found.
|
|
||||||
// The returned string will not be unread.
|
|
||||||
func (r *Reader) ExpectOneOfString(str ...string) (string, bool, error) {
|
|
||||||
for _, s := range str {
|
|
||||||
ok, err := r.ExpectString(s)
|
|
||||||
if err != nil {
|
|
||||||
return "", false, err
|
|
||||||
}
|
|
||||||
|
|
||||||
if ok {
|
|
||||||
return s, true, nil
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return "", false, nil
|
|
||||||
}
|
|
||||||
|
|
||||||
func (r *Reader) Push() {
|
|
||||||
r.indices.Push(r.index)
|
|
||||||
}
|
|
||||||
|
|
||||||
func (r *Reader) Pop() ([]rune, error) {
|
|
||||||
if r.indices.Empty() {
|
|
||||||
return nil, ErrPopFailed.New()
|
|
||||||
}
|
|
||||||
|
|
||||||
lastIndex := r.indices.Pop()
|
|
||||||
currentIndex := r.index
|
|
||||||
if lastIndex < currentIndex {
|
|
||||||
values := make([]rune, 0, int(currentIndex-lastIndex))
|
|
||||||
for i := 0; i < int(currentIndex-lastIndex); i++ {
|
|
||||||
err := r.UnreadRune()
|
|
||||||
if err != nil {
|
|
||||||
return nil, err
|
|
||||||
}
|
|
||||||
|
|
||||||
value, err := r.PeekRune()
|
|
||||||
if err != nil {
|
|
||||||
return nil, err
|
|
||||||
}
|
|
||||||
|
|
||||||
values = append(values, value)
|
|
||||||
}
|
|
||||||
return slices.Reverse(values), nil
|
|
||||||
} else if lastIndex > currentIndex {
|
|
||||||
values := make([]rune, 0, int(lastIndex-currentIndex))
|
|
||||||
for i := 0; i < int(lastIndex-currentIndex); i++ {
|
|
||||||
value, err := r.Rune()
|
|
||||||
if err != nil {
|
|
||||||
return nil, err
|
|
||||||
}
|
|
||||||
values = append(values, value)
|
|
||||||
}
|
|
||||||
return values, nil
|
|
||||||
}
|
|
||||||
|
|
||||||
return []rune{}, nil
|
|
||||||
}
|
}
|
||||||
|
@ -11,8 +11,8 @@ func TestPos(t *testing.T) {
|
|||||||
|
|
||||||
unread := false
|
unread := false
|
||||||
for rn, err := r.Rune(); err == nil; rn, err = r.Rune() {
|
for rn, err := r.Rune(); err == nil; rn, err = r.Rune() {
|
||||||
pos := r.Pos()
|
index, line, col := r.Pos()
|
||||||
fmt.Println(string(rn), pos.Index, pos.Line, pos.Column)
|
fmt.Println(string(rn), index, line, col)
|
||||||
|
|
||||||
if !unread && rn == '\n' {
|
if !unread && rn == '\n' {
|
||||||
for i := 0; i < 5; i++ {
|
for i := 0; i < 5; i++ {
|
||||||
|
@ -12,12 +12,8 @@ func IsSpace(rn rune) bool {
|
|||||||
return rn == ' '
|
return rn == ' '
|
||||||
}
|
}
|
||||||
|
|
||||||
func IsTab(rn rune) bool {
|
|
||||||
return rn == '\t'
|
|
||||||
}
|
|
||||||
|
|
||||||
func IsWhitespace(rn rune) bool {
|
func IsWhitespace(rn rune) bool {
|
||||||
return IsSpace(rn) || IsTab(rn) || IsNewLine(rn)
|
return IsSpace(rn) || IsNewLine(rn)
|
||||||
}
|
}
|
||||||
|
|
||||||
func And(f ...RuneFunc) RuneFunc {
|
func And(f ...RuneFunc) RuneFunc {
|
||||||
|
Loading…
x
Reference in New Issue
Block a user