wip sorting

pkg/compiler/compiler_exec_test.go

@@ -1307,3 +1307,34 @@ func TestForLimit(t *testing.T) {
 		return values.NewInt(2), nil
 	}))
 }
+
+func TestForSort(t *testing.T) {
+	RunUseCases(t, []UseCase{
+		CaseArray(`
+LET users = [
+				{
+					active: true,
+					age: 31,
+					gender: "m"
+				},
+				{
+					active: true,
+					age: 29,
+					gender: "f"
+				},
+				{
+					active: true,
+					age: 36,
+					gender: "m"
+				}
+			]
+			FOR u IN users
+				SORT u.age
+				RETURN u
+`, []any{
+			map[string]any{"active": true, "age": 29, "gender": "f"},
+			map[string]any{"active": true, "age": 31, "gender": "m"},
+			map[string]any{"active": true, "age": 36, "gender": "m"},
+		}, "Should compile query with SORT statement"),
+	})
+}

pkg/compiler/loops.go

@@ -8,16 +8,19 @@ type (
 	LoopKind int
 
 	Loop struct {
-		Type     LoopType
-		Kind     LoopKind
-		Distinct bool
-		Allocate bool
-		Next     int
-		Src      runtime.Operand
-		Iterator runtime.Operand
-		Value    runtime.Operand
-		Key      runtime.Operand
-		Result   runtime.Operand
+		Type       LoopType
+		Kind       LoopKind
+		Distinct   bool
+		Allocate   bool
+		Jump       int
+		JumpOffset int
+		Src        runtime.Operand
+		Iterator   runtime.Operand
+		ValueName  string
+		Value      runtime.Operand
+		KeyName    string
+		Key        runtime.Operand
+		Result     runtime.Operand
 	}
 
 	LoopTable struct {
@@ -80,6 +83,8 @@ func (lt *LoopTable) EnterLoop(loopType LoopType, kind LoopKind, distinct bool)
 	return lt.loops[len(lt.loops)-1]
 }
 
+//func (lt *LoopTable) Fork() *Loop {}
+
 func (lt *LoopTable) Loop() *Loop {
 	if len(lt.loops) == 0 {
 		return nil