Revision 3715a431c2e9f1048e782b29a06a9518579e146a authored by Iddan Aaronsohn on 17 March 2020, 22:59:54 UTC, committed by GitHub on 17 March 2020, 22:59:54 UTC
1 parent fac5464
single.go
// Copyright 2014 The Cayley Authors. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package writer
import (
"github.com/cayleygraph/cayley/graph"
"github.com/cayleygraph/quad"
)
func init() {
graph.RegisterWriter("single", NewSingleReplication)
}
type Single struct {
qs graph.QuadStore
ignoreOpts graph.IgnoreOpts
}
func NewSingle(qs graph.QuadStore, opts graph.IgnoreOpts) (graph.QuadWriter, error) {
return &Single{
qs: qs,
ignoreOpts: opts,
}, nil
}
func NewSingleReplication(qs graph.QuadStore, opts graph.Options) (graph.QuadWriter, error) {
ignoreMissing, err := opts.BoolKey("ignore_missing", graph.IgnoreMissing)
if err != nil {
return nil, err
}
ignoreDuplicate, err := opts.BoolKey("ignore_duplicate", graph.IgnoreDuplicates)
if err != nil {
return nil, err
}
return NewSingle(qs, graph.IgnoreOpts{
IgnoreMissing: ignoreMissing,
IgnoreDup: ignoreDuplicate,
})
}
func (s *Single) AddQuad(q quad.Quad) error {
deltas := make([]graph.Delta, 1)
deltas[0] = graph.Delta{
Quad: q,
Action: graph.Add,
}
return s.qs.ApplyDeltas(deltas, s.ignoreOpts)
}
func (s *Single) AddQuadSet(set []quad.Quad) error {
tx := graph.NewTransactionN(len(set))
for _, q := range set {
tx.AddQuad(q)
}
return s.qs.ApplyDeltas(tx.Deltas, s.ignoreOpts)
}
func (s *Single) RemoveQuad(q quad.Quad) error {
deltas := make([]graph.Delta, 1)
deltas[0] = graph.Delta{
Quad: q,
Action: graph.Delete,
}
return s.qs.ApplyDeltas(deltas, s.ignoreOpts)
}
// RemoveNode removes all quads with the given value.
//
// It returns ErrNodeNotExists if node is missing.
func (s *Single) RemoveNode(v quad.Value) error {
gv := s.qs.ValueOf(v)
if gv == nil {
return graph.ErrNodeNotExists
}
del := graph.NewRemover(s)
defer del.Close()
total := 0
// TODO(dennwc): QuadStore may remove node without iterations. Consider optional interface for this.
for _, d := range []quad.Direction{quad.Subject, quad.Predicate, quad.Object, quad.Label} {
r := graph.NewResultReader(s.qs, s.qs.QuadIterator(d, gv).Iterate())
n, err := quad.Copy(del, r)
r.Close()
if err != nil {
return err
}
total += n
}
if err := del.Flush(); err != nil {
return err
}
if total == 0 {
return graph.ErrNodeNotExists
}
return nil
}
func (s *Single) Close() error {
// Nothing to clean up locally.
return nil
}
func (s *Single) ApplyTransaction(t *graph.Transaction) error {
return s.qs.ApplyDeltas(t.Deltas, s.ignoreOpts)
}
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...