package rel

import (
	"reflect"
)

type AscendingNode OrderingNode

func (node AscendingNode) Eq(other AscendingNode) bool {
	return reflect.DeepEqual(node, other)
}

func (node *AscendingNode) Direction() string {
	return "ASC"
}

func (node *AscendingNode) Reverse() *DescendingNode {
	return &DescendingNode{Expr: node.Expr}
}

package rel

import (
	"reflect"
)

type AscendingNode OrderingNode

func (node AscendingNode) Eq(other AscendingNode) bool {
	return reflect.DeepEqual(node, other)
}

func (node AscendingNode) Direction() string {
	return "ASC"
}

func (node AscendingNode) Reverse() *DescendingNode {
	return &DescendingNode{Expr: node.Expr}
}

--- 
+++ 
@@ -10,10 +10,10 @@
 	return reflect.DeepEqual(node, other)
 }
 
-func (node AscendingNode) Direction() string {
+func (node *AscendingNode) Direction() string {
 	return "ASC"
 }
 
-func (node AscendingNode) Reverse() *DescendingNode {
+func (node *AscendingNode) Reverse() *DescendingNode {
 	return &DescendingNode{Expr: node.Expr}
 }
Use ptrs to ascending nodes
