Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

rdf

package

Go to main page

Versions in this module

v0

v0.15.1

Aug 16, 2024

v0.15.0

Mar 15, 2024

v0.14.0

Aug 19, 2023

v0.13.0

Apr 24, 2023

v0.12.0

Sep 2, 2022

v0.11.0

Mar 16, 2022

Changes in this version

+ var ErrIncomplete = errors.New("incomplete N-Quad")

+ var ErrIncompleteTerm = errors.New("incomplete term")

+ var ErrInvalid = errors.New("invalid N-Quad")

+ var ErrInvalidTerm = errors.New("invalid term")

+ func ConnectedByAny(e graph.Edge, with func(*Statement) bool) bool

+ func IsoCanonicalHashes(statements []*Statement, decomp, dist bool, h hash.Hash, zero []byte) (hashes map[string][]byte, terms map[string]map[string]bool)

+ func Isomorphic(a, b []*Statement, decomp bool, h hash.Hash) bool

+ type Decoder struct

+ func NewDecoder(r io.Reader) *Decoder

+ func (dec *Decoder) Reset(r io.Reader)

+ func (dec *Decoder) Terms() map[string]int64

+ func (dec *Decoder) Unmarshal() (*Statement, error)

+ type Graph struct

+ func NewGraph() *Graph

+ func (g *Graph) AddStatement(s *Statement)

+ func (g *Graph) AllStatements() *Statements

+ func (g *Graph) Edge(uid, vid int64) graph.Edge

+ func (g *Graph) Edges() graph.Edges

+ func (g *Graph) From(id int64) graph.Nodes

+ func (g *Graph) FromSubject(t Term) graph.Nodes

+ func (g *Graph) HasEdgeBetween(xid, yid int64) bool

+ func (g *Graph) HasEdgeFromTo(uid, vid int64) bool

+ func (g *Graph) Lines(uid, vid int64) graph.Lines

+ func (g *Graph) Node(id int64) graph.Node

+ func (g *Graph) Nodes() graph.Nodes

+ func (g *Graph) Predicates() []Term

+ func (g *Graph) Query(from ...Term) Query

+ func (g *Graph) RemoveStatement(s *Statement)

+ func (g *Graph) RemoveTerm(t Term)

+ func (g *Graph) Statements(uid, vid int64) *Statements

+ func (g *Graph) TermFor(text string) (term Term, ok bool)

+ func (g *Graph) To(id int64) graph.Nodes

+ func (g *Graph) ToObject(t Term) graph.Nodes

+ type Kind int

+ const Blank

+ const IRI

+ const Invalid

+ const Literal

+ func (i Kind) String() string

+ type Query struct

+ func NewQuery(g graph.Directed, from ...Term) Query

+ func (q Query) And(p Query) Query

+ func (q Query) HasAllIn(fn func(s *Statement) bool) Query

+ func (q Query) HasAllOut(fn func(s *Statement) bool) Query

+ func (q Query) HasAnyIn(fn func(s *Statement) bool) Query

+ func (q Query) HasAnyOut(fn func(s *Statement) bool) Query

+ func (q Query) In(fn func(s *Statement) bool) Query

+ func (q Query) Len() int

+ func (q Query) Not(p Query) Query

+ func (q Query) Or(p Query) Query

+ func (q Query) Out(fn func(s *Statement) bool) Query

+ func (q Query) Repeat(fn func(Query) (q Query, ok bool)) Query

+ func (q Query) Result() []Term

+ func (q Query) Unique() Query

+ type Statement struct

+ Label Term

+ Object Term

+ Predicate Term

+ Subject Term

+ func C14n(dst, src []*Statement, terms map[string]map[string]bool) ([]*Statement, error)

+ func Deduplicate(s []*Statement) []*Statement

+ func Lean(g []*Statement) ([]*Statement, error)

+ func ParseNQuad(statement string) (*Statement, error)

+ func URDNA2015(dst, src []*Statement) ([]*Statement, error)

+ func URGNA2012(dst, src []*Statement) ([]*Statement, error)

+ func (s *Statement) From() graph.Node

+ func (s *Statement) ID() int64

+ func (s *Statement) ReversedEdge() graph.Edge

+ func (s *Statement) ReversedLine() graph.Line

+ func (s *Statement) String() string

+ func (s *Statement) To() graph.Node

+ type Statements struct

+ func (s *Statements) Next() bool

+ func (s *Statements) Statement() *Statement

+ type Term struct

+ UID int64

+ Value string

+ func NewBlankTerm(label string) (Term, error)

+ func NewIRITerm(iri string) (Term, error)

+ func NewLiteralTerm(text, qual string) (Term, error)

+ func (t Term) ID() int64

+ func (t Term) Parts() (text, qual string, kind Kind, err error)

v0.9.3

Jun 30, 2021

v0.9.2

Jun 17, 2021

v0.9.1

Mar 29, 2021

v0.9.0

Mar 10, 2021