package treerack

type choiceDefinition struct {
	name     string
	id       int
	commit   CommitType
	elements []string
}

type choiceParser struct {
	name       string
	id         int
	commit     CommitType
	elements   []parser
	includedBy []parser
}

func newChoice(name string, ct CommitType, elements []string) *choiceDefinition {
	return &choiceDefinition{
		name:     name,
		commit:   ct,
		elements: elements,
	}
}

func (d *choiceDefinition) nodeName() string { return d.name }
func (d *choiceDefinition) nodeID() int      { return d.id }
func (d *choiceDefinition) setID(id int)     { d.id = id }

func (d *choiceDefinition) parser(r *registry, parsers *idSet) (parser, error) {
	p, ok := r.parser(d.name)
	if ok {
		return p, nil
	}

	cp := &choiceParser{
		name:   d.name,
		id:     d.id,
		commit: d.commit,
	}

	r.setParser(cp)

	var elements []parser
	parsers.set(d.id)
	defer parsers.unset(d.id)
	for _, e := range d.elements {
		element, ok := r.parser(e)
		if ok {
			elements = append(elements, element)
			element.setIncludedBy(cp, parsers)
			continue
		}

		elementDefinition, ok := r.definition(e)
		if !ok {
			return nil, parserNotFound(e)
		}

		element, err := elementDefinition.parser(r, parsers)
		if err != nil {
			return nil, err
		}

		element.setIncludedBy(cp, parsers)
		elements = append(elements, element)
	}

	cp.elements = elements
	return cp, nil
}

func (d *choiceDefinition) commitType() CommitType {
	return d.commit
}

func (p *choiceParser) nodeName() string { return p.name }
func (p *choiceParser) nodeID() int      { return p.id }

func (p *choiceParser) setIncludedBy(includedBy parser, parsers *idSet) {
	if parsers.has(p.id) {
		return
	}

	p.includedBy = append(p.includedBy, includedBy)
}

func (p *choiceParser) storeIncluded(c *context, n *Node) {
	if !c.excluded(n.From, p.id) {
		return
	}

	nc := newNode(p.name, p.id, n.From, n.To, p.commit)
	nc.append(n)
	c.store.set(nc.From, p.id, nc)

	for _, includedBy := range p.includedBy {
		includedBy.storeIncluded(c, nc)
	}
}

func (p *choiceParser) parse(t Trace, c *context) {
	// t = t.Extend(p.name)
	// t.Out1("parsing choice", c.offset)

	if p.commit&Documentation != 0 {
		// t.Out1("fail, doc")
		c.fail(c.offset)
		return
	}

	if _, ok := c.fromStore(p.id); ok {
		// t.Out1("found in store, match:", m)
		return
	}

	if c.excluded(c.offset, p.id) {
		// t.Out1("excluded")
		c.fail(c.offset)
		return
	}

	c.exclude(c.offset, p.id)
	initialOffset := c.offset

	node := newNode(p.name, p.id, c.offset, c.offset, p.commit)
	var match bool

	for {
		elements := p.elements
		var foundMatch bool

		for len(elements) > 0 {
			elements[0].parse(t, c)
			elements = elements[1:]
			c.offset = node.From

			if !c.match || match && c.node.tokenLength() <= node.tokenLength() {
				continue
			}

			match = true
			foundMatch = true
			node = newNode(p.name, p.id, c.offset, c.offset, p.commit)
			node.append(c.node)

			c.store.set(node.From, p.id, node)
			for _, includedBy := range p.includedBy {
				includedBy.storeIncluded(c, node)
			}
		}

		if !foundMatch {
			break
		}
	}

	if match {
		// t.Out1("choice, success")
		c.success(node)
		c.include(initialOffset, p.id) // TODO: test if can be optimized
		return
	}

	// t.Out1("fail")
	c.store.set(node.From, p.id, nil)
	c.fail(node.From)
	c.include(initialOffset, p.id) // TODO: test if can be optimized
}