aboutsummaryrefslogtreecommitdiff
path: root/pkg/field/field.go
diff options
context:
space:
mode:
authorJulien Dessaux2021-09-14 17:56:04 +0200
committerJulien Dessaux2021-09-14 17:56:04 +0200
commit4bacbc23754a63109a2cbe68d272376a3f6847f5 (patch)
tree101e32c601ca9aabb68cf666299d761d468667a2 /pkg/field/field.go
parentInitial import (diff)
downloadgofunge98-4bacbc23754a63109a2cbe68d272376a3f6847f5.tar.gz
gofunge98-4bacbc23754a63109a2cbe68d272376a3f6847f5.tar.bz2
gofunge98-4bacbc23754a63109a2cbe68d272376a3f6847f5.zip
Began implementing the befunge field data structure
Diffstat (limited to '')
-rw-r--r--pkg/field/field.go81
1 files changed, 81 insertions, 0 deletions
diff --git a/pkg/field/field.go b/pkg/field/field.go
new file mode 100644
index 0000000..fde478a
--- /dev/null
+++ b/pkg/field/field.go
@@ -0,0 +1,81 @@
+package field
+
+import (
+ "bytes"
+ "io"
+)
+
+// 32-bit Befunge-98
+// =================
+// |-2,147,483,648
+// |
+// | x
+// -----+-----
+// -2,147,483,648 | 2,147,483,647
+// |
+// y|2,147,483,647
+
+type Field struct {
+ firstLineIndex int
+ length int
+ lines []Line
+}
+
+type Line struct {
+ firstColumnIndex int
+ length int
+ columns []byte
+}
+
+func LoadFile(fd io.Reader) (*Field, error) {
+ f := new(Field)
+ l := new(Line)
+ trailingSpaces := 0
+ for {
+ data := make([]byte, 4096)
+ if n, errRead := fd.Read(data); errRead != nil {
+ if errRead == io.EOF {
+ if f.length == 0 && l.length == 0 {
+ return nil, newDecodeError("No instruction on the first line of the file produces an unusable program in Befunge98")
+ }
+ if l.length > 0 {
+ f.length++
+ f.lines = append(f.lines, *l)
+ }
+ break
+ } else {
+ return nil, newReadError(errRead)
+ }
+ } else {
+ for i := 0; i < n; i++ {
+ if data[i] == '\n' || data[i] == '\r' {
+ if f.length == 0 && l.length == 0 {
+ return nil, newDecodeError("No instruction on the first line of the file produces an unusable program in Befunge98")
+ }
+ f.length++
+ f.lines = append(f.lines, *l)
+ l = new(Line)
+ trailingSpaces = 0
+ if i+1 < n && data[i] == '\r' && data[i+1] == '\n' {
+ i++
+ }
+ } else {
+ if l.length == 0 && data[i] == ' ' {
+ l.firstColumnIndex++ // trim leading spaces
+ } else {
+ if data[i] == ' ' {
+ trailingSpaces++
+ } else {
+ l.columns = append(l.columns, bytes.Repeat([]byte{' '}, trailingSpaces)...)
+ l.length += trailingSpaces
+ trailingSpaces = 0
+ l.length++
+ l.columns = append(l.columns, data[i])
+ }
+ }
+ }
+ }
+ }
+ }
+ return f, nil
+}