2016-10-17 07:14:01 +03:00
|
|
|
package ast
|
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
|
|
|
|
|
|
|
"reflect"
|
|
|
|
"strings"
|
|
|
|
|
2020-08-06 20:58:47 +03:00
|
|
|
"github.com/antlr/antlr4/runtime/Go/antlr"
|
2020-08-23 14:16:16 +03:00
|
|
|
"github.com/neilotoole/sq/libsq/ast/internal/slq"
|
2016-10-17 07:14:01 +03:00
|
|
|
)
|
|
|
|
|
2020-08-06 20:58:47 +03:00
|
|
|
var _ Node = (*Segment)(nil)
|
|
|
|
|
2016-10-17 07:14:01 +03:00
|
|
|
// Segment models a segment of a query (the elements separated by pipes).
|
|
|
|
// For example, ".user | .uid, .username" is two segments (".user" and ".uid, .username").
|
|
|
|
type Segment struct {
|
2020-08-06 20:58:47 +03:00
|
|
|
bn baseNode
|
2016-10-17 07:14:01 +03:00
|
|
|
}
|
|
|
|
|
2021-09-13 01:14:30 +03:00
|
|
|
// Parent implements ast.Node.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) Parent() Node {
|
|
|
|
return s.bn.Parent()
|
|
|
|
}
|
|
|
|
|
2021-09-13 01:14:30 +03:00
|
|
|
// SetParent implements ast.Node.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) SetParent(parent Node) error {
|
|
|
|
ast, ok := parent.(*AST)
|
|
|
|
if !ok {
|
2020-08-06 20:58:47 +03:00
|
|
|
return errorf("%T requires parent of type %s", s, typeAST)
|
2016-10-17 07:14:01 +03:00
|
|
|
}
|
|
|
|
return s.bn.SetParent(ast)
|
|
|
|
}
|
|
|
|
|
2021-09-13 01:14:30 +03:00
|
|
|
// Children implements ast.Node.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) Children() []Node {
|
|
|
|
return s.bn.Children()
|
|
|
|
}
|
|
|
|
|
2021-09-13 01:14:30 +03:00
|
|
|
// AddChild implements ast.Node.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) AddChild(child Node) error {
|
|
|
|
s.bn.addChild(child)
|
|
|
|
return child.SetParent(s)
|
|
|
|
}
|
|
|
|
|
2021-09-13 01:14:30 +03:00
|
|
|
// SetChildren implements ast.Node.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) SetChildren(children []Node) error {
|
|
|
|
s.bn.setChildren(children)
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2021-09-13 01:14:30 +03:00
|
|
|
// Context implements ast.Node.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) Context() antlr.ParseTree {
|
|
|
|
return s.bn.Context()
|
|
|
|
}
|
|
|
|
|
2021-09-13 01:14:30 +03:00
|
|
|
// SetContext implements ast.Node.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) SetContext(ctx antlr.ParseTree) error {
|
|
|
|
segCtx, ok := ctx.(*slq.SegmentContext)
|
|
|
|
if !ok {
|
|
|
|
return errorf("expected *parser.SegmentContext, but got %T", ctx)
|
|
|
|
}
|
|
|
|
return s.bn.SetContext(segCtx)
|
|
|
|
}
|
|
|
|
|
|
|
|
// ChildType returns the expected Type of the segment's elements, based
|
|
|
|
// on the content of the segment's node's children. The type should be something
|
2020-08-06 20:58:47 +03:00
|
|
|
// like Selector|Func
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) ChildType() (reflect.Type, error) {
|
|
|
|
if len(s.Children()) == 0 {
|
|
|
|
return nil, nil
|
|
|
|
}
|
2020-08-06 20:58:47 +03:00
|
|
|
_, err := s.uniformChildren()
|
2016-10-17 07:14:01 +03:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
return reflect.TypeOf(s.Children()[0]), nil
|
|
|
|
}
|
|
|
|
|
2020-08-06 20:58:47 +03:00
|
|
|
// uniformChildren returns true if all the nodes of the segment
|
|
|
|
// are of a uniform type.
|
|
|
|
func (s *Segment) uniformChildren() (bool, error) {
|
2016-10-17 07:14:01 +03:00
|
|
|
if len(s.Children()) == 0 {
|
|
|
|
return true, nil
|
|
|
|
}
|
|
|
|
|
2020-08-06 20:58:47 +03:00
|
|
|
typs := map[string]struct{}{}
|
2016-10-17 07:14:01 +03:00
|
|
|
for _, elem := range s.Children() {
|
2020-08-06 20:58:47 +03:00
|
|
|
typs[reflect.TypeOf(elem).String()] = struct{}{}
|
2016-10-17 07:14:01 +03:00
|
|
|
}
|
|
|
|
|
2020-08-06 20:58:47 +03:00
|
|
|
if len(typs) > 1 {
|
|
|
|
var str []string
|
|
|
|
for typ := range typs {
|
|
|
|
str = append(str, typ)
|
2016-10-17 07:14:01 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
return false, fmt.Errorf("segment [%d] has more than one element node type: [%s]", s.SegIndex(), strings.Join(str, ", "))
|
|
|
|
}
|
|
|
|
|
|
|
|
return true, nil
|
|
|
|
}
|
|
|
|
|
2020-08-06 20:58:47 +03:00
|
|
|
// SegIndex returns the index of this segment.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) SegIndex() int {
|
|
|
|
for i, seg := range s.bn.parent.Children() {
|
|
|
|
if s == seg {
|
|
|
|
return i
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return -1
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s *Segment) String() string {
|
|
|
|
if len(s.Children()) == 1 {
|
|
|
|
return fmt.Sprintf("segment[%d]: [1 element]", s.SegIndex())
|
|
|
|
}
|
|
|
|
|
|
|
|
return fmt.Sprintf("segment[%d]: [%d elements]", s.SegIndex(), len(s.Children()))
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s *Segment) Text() string {
|
|
|
|
return s.bn.Context().GetText()
|
|
|
|
}
|
|
|
|
|
2020-08-06 20:58:47 +03:00
|
|
|
// Prev returns the previous segment, or nil if this is
|
|
|
|
// the first segment.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) Prev() *Segment {
|
|
|
|
parent := s.Parent()
|
|
|
|
children := parent.Children()
|
|
|
|
index := -1
|
|
|
|
|
|
|
|
for i, child := range children {
|
|
|
|
childSeg, ok := child.(*Segment)
|
|
|
|
if !ok {
|
|
|
|
// should never happen
|
|
|
|
panic("sibling is not *ast.Segment")
|
|
|
|
}
|
|
|
|
|
|
|
|
if childSeg == s {
|
|
|
|
index = i
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if index == -1 {
|
2020-08-06 20:58:47 +03:00
|
|
|
// Should never happen
|
2016-10-17 07:14:01 +03:00
|
|
|
panic(fmt.Sprintf("did not find index for this segment: %s", s))
|
|
|
|
}
|
|
|
|
|
|
|
|
if index == 0 {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
return children[index-1].(*Segment)
|
|
|
|
}
|
|
|
|
|
2020-08-06 20:58:47 +03:00
|
|
|
// Next returns the next segment, or nil if this is the last segment.
|
2016-10-17 07:14:01 +03:00
|
|
|
func (s *Segment) Next() *Segment {
|
|
|
|
for i, seg := range s.bn.parent.Children() {
|
|
|
|
if seg == s {
|
|
|
|
if i >= len(s.bn.parent.Children())-1 {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
return s.bn.parent.Children()[i+1].(*Segment)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|