create the Bug structure

1 files changed, 80 insertions, 14 deletions

diff --git a/bug/bug.go b/bug/bug.go
index ac99c164..807f614f 100644
--- a/bug/bug.go
+++ b/bug/bug.go
@@ -1,18 +1,84 @@
 package bug
 
-// Snapshot is a compiled form of the Bug data structure used for storage and merge
-type Snapshot struct {
-	Title    string
-	Comments []Comment
-	Labels   []Label
+import (
+	"github.com/kevinburke/go.uuid"
+)
+
+// Bug hold the data of a bug thread, organized in a way close to
+// how it will be persisted inside Git. This is the datastructure
+// used for merge of two different version.
+type Bug struct {
+	// Id used as unique identifier
+	Id uuid.UUID
+
+	// TODO: need a way to order bugs
+	// Probably a Lamport clock
+
+	Packs []OperationPack
+
+	Staging OperationPack
 }
 
-//func (bug Bug) Check() error {
-//	if bug.Operations.Len() == 0 {
-//		return "Empty operation log"
-//	}
-//
-//	if bug.Operations.Elems()
-//
-//	return true
-//}
+// Create a new Bug
+func NewBug() (*Bug, error) {
+
+	// Creating UUID Version 4
+	id, err := uuid.ID4()
+
+	if err != nil {
+		return nil, err
+	}
+
+	return &Bug{
+		Id: id,
+	}, nil
+}
+
+// IsValid check if the Bug data is valid
+func (bug *Bug) IsValid() bool {
+	// non-empty
+	if len(bug.Packs) == 0 {
+		return false
+	}
+
+	// check if each pack is valid
+	for _, pack := range bug.Packs {
+		if !pack.IsValid() {
+			return false
+		}
+	}
+
+	// The very first Op should be a CREATE
+	firstOp := bug.Packs[0].Operations[0]
+	if firstOp.OpType() != CREATE {
+		return false
+	}
+
+	// Check that there is no more CREATE op
+	it := NewOperationIterator(bug)
+	createCount := 0
+	for it.Next() {
+		if it.Value().OpType() == CREATE {
+			createCount++
+		}
+	}
+
+	if createCount != 1 {
+		return false
+	}
+
+	return true
+}
+
+func (bug *Bug) Append(op Operation) {
+	bug.Staging.Append(op)
+}
+
+func (bug *Bug) Commit() {
+	bug.Packs = append(bug.Packs, bug.Staging)
+	bug.Staging = OperationPack{}
+}
+
+func (bug *Bug) HumanId() string {
+	return bug.Id.String()
+}