Initial import

.gitignore

@@ -0,0 +1,6 @@
+*~
+*.swp
+*.swo
+*.tmp
+*.out
+.DS_Store

Acknowledgements.md

@@ -0,0 +1,163 @@
+# Acknowledgements
+
+Reconcile is made possible by the following open-source software projects:
+
+## Golang
+Website: [Golang](https://github.com/golang/go)
+
+Copyright (c) 2009 The Go Authors. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+   * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+   * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+   * Neither the name of Google Inc. nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+## Gorilla Web Toolkit
+
+Website: [Gorilla Web Toolkit](https://github.com/gorilla)
+
+Copyright (c) 2012 Rodrigo Moraes. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+* Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+
+* Neither the name of Google Inc. nor the names of its contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+## GopherJS
+
+Website: [GopherJS](https://github.com/gopherjs)
+
+Copyright (c) 2013 Richard Musiol. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+   * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+   * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+## Go JS DOM
+
+Website [go-js-dom](https://github.com/dominikh/go-js-dom)
+
+Copyright (c) 2014 Dominik Honnef
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+## Go Wade
+Website: [Go Wade](https://github.com/gowade)
+
+Copyright (c) 2015 Hai Thanh Nguyen and Michael Hanley.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+   * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+   * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+## Go Humble
+Website: [Go Humble](https://github.com/go-humble/)
+
+Copyright (C) 2015, Alex Browne and Soroush Pour
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+

LICENSE

@@ -0,0 +1,29 @@
+The UXToolkit Project
+Copyright (c) Wirecog, LLC. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+   * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+   * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+   * Neither the name of Wirecog, LLC. nor the names of its contributors
+may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+

Readme.md

@@ -0,0 +1,10 @@
+<p align="center"><a href="http://uxtoolkit.io" target="_blank"><img src="https://avatars3.githubusercontent.com/u/27899635?v=4&s=360"></a></p>
+
+# Reconcile
+
+[![Go Report Card](https://goreportcard.com/badge/github.com/uxtoolkit/reconcile)](https://goreportcard.com/report/github.com/uxtoolkit/reconcile)
+
+The reconcile package is used for DOM reconcilation in [Isomorphic Go](http://isomorphicgo.org) web applications.
+
+## License
+Reconcile is licensed under the BSD License. Read the [LICENSE](https://github.com/uxtoolkit/reconcile/blob/master/LICENSE) file for more information.

domnode.go

@@ -0,0 +1,170 @@
+// The UXToolkit Project
+// Copyright (c) Wirecog, LLC. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license, which can be found in the LICENSE file.
+
+package reconcile
+
+import (
+	"html"
+	"strconv"
+
+	"honnef.co/go/js/dom"
+)
+
+const (
+	ElementNodeType = iota
+	CommentNodeType
+	TextNodeType
+)
+
+type Positions struct {
+	startPosition      int
+	innerStartPosition int
+	endPosition        int
+	innerEndPosition   int
+}
+
+type Attribute struct {
+	Name  string
+	Value string
+}
+
+type DOMNode struct {
+	Positions
+	NodeType      int
+	Position      []int
+	ParentNode    *DOMNode
+	ChildNodes    []*DOMNode
+	Contents      []byte
+	Name          string
+	Value         []byte
+	IsSelfClosing bool
+	Attributes    []Attribute
+	tree          *ParseTree
+}
+
+func NewDOMNode(nodeType int) *DOMNode {
+
+	result := &DOMNode{}
+	result.innerEndPosition = -1
+	if nodeType == ElementNodeType {
+		result.NodeType = ElementNodeType
+	} else if nodeType == CommentNodeType {
+		result.NodeType = CommentNodeType
+	} else if nodeType == TextNodeType {
+		result.NodeType = TextNodeType
+	}
+
+	return result
+}
+
+func (dn *DOMNode) Create() dom.Node {
+
+	var result dom.Node = nil
+	d := dom.GetWindow().Document()
+
+	if dn.NodeType == CommentNodeType {
+
+		element := d.Underlying().Call("createComment", string(dn.Value))
+		result = dom.WrapNode(element)
+
+	} else if dn.NodeType == TextNodeType {
+
+		result = d.CreateTextNode(string(dn.Value))
+
+	} else if dn.NodeType == ElementNodeType {
+
+		element := d.CreateElement(dn.Name)
+		for _, attribute := range dn.Attributes {
+			element.SetAttribute(attribute.Name, attribute.Value)
+		}
+
+		element.SetInnerHTML(string(dn.GetHTMLContents(true)))
+		result = element
+	}
+
+	return result
+}
+
+func (dn *DOMNode) Locate(rootElement dom.Element) dom.Node {
+
+	result := rootElement.ChildNodes()[dn.Position[0]]
+	for _, index := range dn.Position[1:] {
+		result = result.ChildNodes()[index]
+	}
+	return result
+}
+
+func (dn *DOMNode) IsEqual(b DOMNode) bool {
+
+	if dn.NodeType != b.NodeType {
+		return false
+	}
+
+	if dn.NodeType == TextNodeType || dn.NodeType == CommentNodeType {
+		if string(dn.Value) != string(b.Value) {
+			return false
+		} else {
+			return true
+		}
+	}
+
+	if dn.NodeType == ElementNodeType {
+
+		if dn.Name != b.Name {
+			return false
+		}
+
+		attrs := dn.Attributes
+		otherAttrs := b.Attributes
+		if len(attrs) != len(otherAttrs) {
+			return false
+		}
+		for i, attr := range attrs {
+			otherAttr := otherAttrs[i]
+			if attr != otherAttr {
+				return false
+			}
+		}
+		return true
+	}
+
+	return false
+}
+
+func (dn *DOMNode) GetHTMLContents(innerContentsOnly bool) []byte {
+	if dn.IsSelfClosing == true {
+		return nil
+	} else {
+		contents := string(dn.tree.src[dn.innerStartPosition:dn.innerEndPosition])
+		return []byte(html.UnescapeString(contents))
+	}
+}
+
+func (dn *DOMNode) AttributesMap() map[string]string {
+
+	var result map[string]string
+
+	if dn.NodeType == ElementNodeType {
+		result = make(map[string]string)
+
+		for _, attribute := range dn.Attributes {
+			result[attribute.Name] = attribute.Value
+		}
+	} else {
+		result = nil
+	}
+
+	return result
+
+}
+
+func (dn *DOMNode) String() string {
+
+	s := "### DOMNODE ###\n"
+	s += "name: " + dn.Name + "\n"
+	s += "innerStartPosition: " + strconv.Itoa(dn.innerStartPosition) + "\n"
+	s += "innerEndPosition: " + strconv.Itoa(dn.innerEndPosition) + "\n"
+	return s
+}

parsetree.go

@@ -0,0 +1,253 @@
+// The UXToolkit Project
+// Copyright (c) Wirecog, LLC. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license, which can be found in the LICENSE file.
+
+package reconcile
+
+import (
+	"bytes"
+	"errors"
+	"io"
+
+	"golang.org/x/net/html"
+)
+
+// Declare considered empty HTML tags
+// Reference: https://developer.mozilla.org/en-US/docs/Glossary/Empty_element
+var emptyTags = map[string]int{"input": 1, "area": 1, "base": 1, "br": 1, "col": 1, "embed": 1, "hr": 1, "img": 1, "keygen": 1, "link": 1, "meta": 1, "param": 1, "source": 1, "track": 1, "wbr": 1}
+
+func IsEmptyElement(tag string) bool {
+	if _, ok := emptyTags[tag]; ok == true {
+		return true
+	} else {
+		return false
+	}
+}
+
+type ParseTree struct {
+	reader     io.Reader
+	src        []byte
+	ChildNodes []*DOMNode
+}
+
+func NewParseTree(src []byte) (*ParseTree, error) {
+	r := bytes.NewReader(src)
+	z := html.NewTokenizer(r)
+	tree := &ParseTree{src: src, reader: r}
+	var node *DOMNode = nil
+	for tokenType := z.Next(); tokenType != html.ErrorToken; tokenType = z.Next() {
+		token := z.Token()
+		if next, err := tree.parse(token, node, z); err != nil {
+			return nil, err
+		} else {
+			node = next
+		}
+	}
+	return tree, nil
+}
+
+func (pt *ParseTree) parse(token html.Token, current *DOMNode, tokenizer *html.Tokenizer) (next *DOMNode, err error) {
+
+	emptyElement := IsEmptyElement(token.Data)
+	offset := tokenizer.CurrentOffset()
+	var result *DOMNode
+	if token.Type == html.StartTagToken || token.Type == html.SelfClosingTagToken {
+
+		node := &DOMNode{}
+		node.NodeType = ElementNodeType
+		node.Name = token.Data
+		node.tree = pt
+
+		for _, attribute := range token.Attr {
+			node.Attributes = append(node.Attributes, Attribute{
+				Name:  attribute.Key,
+				Value: attribute.Val,
+			})
+		}
+
+		if current != nil {
+			node.Position = make([]int, len(current.Position)+1)
+			copy(node.Position, current.Position)
+			node.Position[len(current.Position)] = len(current.ChildNodes)
+			node.ParentNode = current
+			current.ChildNodes = append(current.ChildNodes, node)
+		} else {
+			node.Position = []int{len(pt.ChildNodes)}
+		}
+
+		node.startPosition, err = pt.ReverseFind(0, offset[0]-1, '<')
+
+		if err != nil {
+			return nil, err
+		}
+
+		node.innerStartPosition = offset[0]
+		next = node
+		result = node
+
+		if token.Type == html.SelfClosingTagToken || emptyElement == true {
+			current = node
+		}
+	}
+
+	if token.Type == html.EndTagToken || token.Type == html.SelfClosingTagToken || emptyElement == true {
+
+		offset := tokenizer.CurrentOffset()
+
+		if token.Type == html.SelfClosingTagToken || emptyElement == true {
+			current.IsSelfClosing = true
+
+			if current.ParentNode != nil {
+				next = current.ParentNode
+			} else {
+				next = nil
+			}
+
+		} else {
+			current.endPosition = offset[0]
+			closingTagLength := len(current.Name) + 3
+			current.innerEndPosition = offset[0] - closingTagLength
+
+			if current.ParentNode != nil {
+				next = current.ParentNode
+			} else {
+				next = nil
+			}
+
+		}
+	}
+
+	if token.Type == html.TextToken {
+
+		charData := token.Data
+		text := &DOMNode{}
+		text.NodeType = TextNodeType
+		text.Value = []byte(charData)
+		if current != nil {
+			text.Position = make([]int, len(current.Position)+1)
+			copy(text.Position, current.Position)
+			text.Position[len(current.Position)] = len(current.ChildNodes)
+			text.ParentNode = current
+			current.ChildNodes = append(current.ChildNodes, text)
+		} else {
+			text.Position = []int{len(pt.ChildNodes)}
+		}
+		result = text
+		next = current
+	} else if token.Type == html.CommentToken {
+
+		htmlComment := token.Data
+		comment := &DOMNode{}
+		comment.NodeType = CommentNodeType
+		comment.Value = []byte(htmlComment)
+		if current != nil {
+
+			comment.Position = make([]int, len(current.Position)+1)
+			copy(comment.Position, current.Position)
+			comment.Position[len(current.Position)] = len(current.ChildNodes)
+			comment.ParentNode = current
+			current.ChildNodes = append(current.ChildNodes, comment)
+		} else {
+
+			comment.Position = []int{len(pt.ChildNodes)}
+		}
+		result = comment
+		next = current
+	}
+
+	if result != nil && current == nil {
+
+		pt.ChildNodes = append(pt.ChildNodes, result)
+	}
+	return next, nil
+}
+
+func (t *ParseTree) Compare(other *ParseTree) (Changes, error) {
+
+	changes := []Reconciler{}
+	if err := compareNodes(&changes, t.ChildNodes, other.ChildNodes); err != nil {
+		return nil, err
+	}
+
+	return changes, nil
+}
+
+func compareAttributes(changes *[]Reconciler, a, b *DOMNode) {
+
+	bAttributes := b.AttributesMap()
+	aAttributes := a.AttributesMap()
+
+	for attributeName := range aAttributes {
+		if _, found := bAttributes[attributeName]; !found {
+
+			*changes = append(*changes, Reconciler{ActionType: RemoveNodeAttributeAction, ExistingNode: a, AttributeName: attributeName})
+		}
+	}
+
+	for name, bValue := range bAttributes {
+		value, found := aAttributes[name]
+		if !found {
+
+			*changes = append(*changes, Reconciler{ActionType: SetNodeAttributeAction, ExistingNode: a, AttributeName: name, AttributeValue: bValue})
+
+		} else if value != bValue {
+
+			*changes = append(*changes, Reconciler{ActionType: SetNodeAttributeAction, ExistingNode: a, AttributeName: name, AttributeValue: bValue})
+
+		}
+	}
+}
+
+func compareNodes(changes *[]Reconciler, a, b []*DOMNode) error {
+
+	bCount := len(b)
+	aCount := len(a)
+	minCount := bCount
+
+	if bCount > aCount {
+		for _, bNode := range b[aCount:] {
+
+			*changes = append(*changes, Reconciler{ActionType: AppendChildNodeAction, ParentNode: bNode.ParentNode, ChildNode: bNode})
+		}
+		minCount = aCount
+	} else if aCount > bCount {
+		for _, node := range a[bCount:] {
+
+			*changes = append(*changes, Reconciler{ActionType: RemoveNodeAction, ExistingNode: node})
+
+		}
+		minCount = bCount
+	}
+	for i := 0; i < minCount; i++ {
+		bNode := b[i]
+		n := a[i]
+		if n.IsEqual(*bNode) == false {
+
+			*changes = append(*changes, Reconciler{ActionType: ReplaceNodeAction, ExistingNode: n, NewNode: bNode})
+
+			continue
+		}
+		if bNode.NodeType == ElementNodeType {
+			node := n
+			compareAttributes(changes, node, bNode)
+			compareNodes(changes, n.ChildNodes, bNode.ChildNodes)
+		}
+	}
+	return nil
+}
+
+func (pt *ParseTree) ReverseFind(m int, n int, b byte) (int, error) {
+	if n >= len(pt.src) || n < m {
+		return -1, errors.New("invalid value for n")
+	}
+	if m >= len(pt.src) || m < 0 {
+		return -1, errors.New("invalid value for m")
+	}
+	for i := n; i >= m; i-- {
+		if pt.src[i] == b {
+			return i, nil
+		}
+	}
+	return -1, nil
+}

reconcile.go

@@ -0,0 +1,123 @@
+// The UXToolkit Project
+// Copyright (c) Wirecog, LLC. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license, which can be found in the LICENSE file.
+
+package reconcile
+
+import (
+	"errors"
+
+	"honnef.co/go/js/dom"
+)
+
+const (
+	SetNodeAttributeAction = iota
+	RemoveNodeAttributeAction
+	RemoveNodeAction
+	ReplaceNodeAction
+	AppendChildNodeAction
+)
+
+type ReconcileParams struct {
+}
+
+type Reconciler struct {
+	ActionType     int
+	ParentNode     *DOMNode
+	ChildNode      *DOMNode
+	ExistingNode   *DOMNode
+	NewNode        *DOMNode
+	AttributeName  string
+	AttributeValue string
+}
+
+func (r *Reconciler) ApplyChange(rootElement dom.Element) error {
+
+	switch r.ActionType {
+
+	case SetNodeAttributeAction:
+		r.SetNodeAttribute(rootElement)
+	case RemoveNodeAttributeAction:
+		r.RemoveNodeAttribute(rootElement)
+	case RemoveNodeAction:
+		r.RemoveNode(rootElement)
+	case ReplaceNodeAction:
+		r.ReplaceNode(rootElement)
+	case AppendChildNodeAction:
+		r.AppendChildNode(rootElement)
+	default:
+		return errors.New("Unknown action")
+	}
+	return nil
+}
+
+type Changes []Reconciler
+
+func (r *Reconciler) AppendChildNode(rootElement dom.Element) {
+	var parent dom.Node
+	if r.ParentNode != nil {
+		parent = r.ParentNode.Locate(rootElement)
+	} else {
+		parent = rootElement
+	}
+	child := r.ChildNode.Create()
+	parent.AppendChild(child)
+}
+
+func (r *Reconciler) ReplaceNode(rootElement dom.Element) {
+	var parent dom.Node
+	if r.ExistingNode.ParentNode != nil {
+		parent = r.ExistingNode.ParentNode.Locate(rootElement)
+	} else {
+		parent = rootElement
+	}
+	existingNode := r.ExistingNode.Locate(rootElement)
+	newNode := r.NewNode.Create()
+	parent.ReplaceChild(newNode, existingNode)
+}
+
+func (r *Reconciler) RemoveNode(rootElement dom.Element) {
+	var parent dom.Node
+	if r.ExistingNode.ParentNode != nil {
+		parent = r.ExistingNode.ParentNode.Locate(rootElement)
+	} else {
+		parent = rootElement
+	}
+	self := r.ExistingNode.Locate(rootElement)
+	parent.RemoveChild(self)
+	if r.ExistingNode.ParentNode != nil {
+		lastIndex := r.ExistingNode.Position[len(r.ExistingNode.Position)-1]
+		for _, sibling := range r.ExistingNode.ParentNode.ChildNodes[lastIndex:] {
+			switch sibling.NodeType {
+			case ElementNodeType:
+				sibling.Position[len(sibling.Position)-1] = sibling.Position[len(sibling.Position)-1] - 1
+			case TextNodeType:
+				sibling.Position[len(sibling.Position)-1] = sibling.Position[len(sibling.Position)-1] - 1
+			case CommentNodeType:
+				sibling.Position[len(sibling.Position)-1] = sibling.Position[len(sibling.Position)-1] - 1
+			default:
+				panic("Undetermined Node Type!")
+			}
+		}
+	}
+
+}
+
+func (r *Reconciler) RemoveNodeAttribute(rootElement dom.Element) {
+	self := r.ExistingNode.Locate(rootElement).(dom.Element)
+	self.RemoveAttribute(r.AttributeName)
+}
+
+func (r *Reconciler) SetNodeAttribute(rootElement dom.Element) {
+	self := r.ExistingNode.Locate(rootElement).(dom.Element)
+	self.SetAttribute(r.AttributeName, r.AttributeValue)
+}
+
+func (c Changes) ApplyChanges(rootElement dom.Element) {
+
+	for _, reconciler := range c {
+		reconciler.ApplyChange(rootElement)
+	}
+
+}

vendor/golang.org/x/net

@@ -0,0 +1 @@
+Subproject commit 1c05540f6879653db88113bc4a2b70aec4bd491f