Merge pull request #52 from soluchok/improves_performance

perf: Improves performance for big documents

Author: kazarena

ld/api_normalize.go

@@ -279,11 +279,12 @@ func (na *NormalisationAlgorithm) Main(dataset *RDFDataset, opts *JsonLdOptions)
 			return nil, NewJsonLdError(UnknownFormat, opts.Format)
 		}
 	}
-	rval := ""
+	var rval []byte
 	for _, n := range na.lines {
-		rval += n
+		rval = append(rval, []byte(n)...)
 	}
-	return ParseNQuads(rval)
+
+	return ParseNQuads(string(rval))
 }
 
 // Sort interface

ld/context.go

@@ -24,7 +24,7 @@ import (
 var (
 	ignoredKeywordPattern = regexp.MustCompile("^@[a-zA-Z]+$")
 	invalidPrefixPattern  = regexp.MustCompile(":|/")
-	iriLikeTermPattern = regexp.MustCompile(`(?::[^:])|\/`)
+	iriLikeTermPattern    = regexp.MustCompile(`(?::[^:])|\/`)
 
 	nonTermDefKeys = map[string]bool{
 		"@base":      true,
@@ -696,7 +696,7 @@ func (c *Context) createTermDefinition(context map[string]interface{}, term stri
 				termHasSuffix := false
 				if len(res) > 0 {
 					switch res[len(res)-1] {
-					case ':', '/', '?', '#', '[', ']','@':
+					case ':', '/', '?', '#', '[', ']', '@':
 						termHasSuffix = true
 					default:
 						termHasSuffix = false

ld/node.go

@@ -59,12 +59,12 @@ func NewLiteral(value string, datatype string, language string) *Literal {
 }
 
 // GetValue returns the node's value.
-func (l Literal) GetValue() string {
+func (l *Literal) GetValue() string {
 	return l.Value
 }
 
 // Equal returns true id this node is equal to the given node.
-func (l Literal) Equal(n Node) bool {
+func (l *Literal) Equal(n Node) bool {
 	ol, ok := n.(*Literal)
 	if !ok {
 		return false
@@ -100,12 +100,12 @@ func NewIRI(iri string) *IRI {
 }
 
 // GetValue returns the node's value.
-func (iri IRI) GetValue() string {
+func (iri *IRI) GetValue() string {
 	return iri.Value
 }
 
 // Equal returns true id this node is equal to the given node.
-func (iri IRI) Equal(n Node) bool {
+func (iri *IRI) Equal(n Node) bool {
 	if oiri, ok := n.(*IRI); ok {
 		return iri.Value == oiri.Value
 	}
@@ -128,12 +128,12 @@ func NewBlankNode(attribute string) *BlankNode {
 }
 
 // GetValue returns the node's value.
-func (bn BlankNode) GetValue() string {
+func (bn *BlankNode) GetValue() string {
 	return bn.Attribute
 }
 
 // Equal returns true id this node is equal to the given node.
-func (bn BlankNode) Equal(n Node) bool {
+func (bn *BlankNode) Equal(n Node) bool {
 	if obn, ok := n.(*BlankNode); ok {
 		return bn.Attribute == obn.Attribute
 	}

ld/rdf_dataset.go

@@ -52,7 +52,7 @@ func NewQuad(subject Node, predicate Node, object Node, graph string) *Quad {
 }
 
 // Equal returns true if this quad is equal to the given quad.
-func (q Quad) Equal(o *Quad) bool {
+func (q *Quad) Equal(o *Quad) bool {
 	if o == nil {
 		return false
 	}
@@ -64,7 +64,7 @@ func (q Quad) Equal(o *Quad) bool {
 	return q.Subject.Equal(o.Subject) && q.Predicate.Equal(o.Predicate) && q.Object.Equal(o.Object)
 }
 
-func (q Quad) Valid() bool {
+func (q *Quad) Valid() bool {
 	if q.Subject != nil {
 		if InvalidNode(q.Subject) {
 			return false