mirror of
https://github.com/hanzoai/graph.git
synced 2026-10-30 18:35:37 +00:00
Derived from Dgraph (github.com/dgraph-io/dgraph) at commit 64804bd2, Apache-2.0. See NOTICE. WHAT THIS IS. The graph engine as a Go library: posting lists, the DQL parser, the type and tokenizer system, the index and schema layers, and the wire types. 39,170 lines of the upstream's 166,337. THE STORE is github.com/luxfi/zapdb, a Badger fork that kept the package name, the subpackages (options, pb, y) and the API — Open, OpenManaged, DB, Options — so the 74 import sites are aliased rather than rewritten. THE CODEC is ZAP. zapdb serializes with ZAP, not protobuf: its pb package builds the ZAP types by default and the protobuf ones only under `-tags grpc`, a path that does not compile (table/builder.go calls pb.Marshal, which that tag removes). One call site in posting needed converting; every other type here is Hanzo's own protobuf and is untouched. NO TRANSPORT. An embedded engine dials nothing, so nothing here imports google.golang.org/grpc. Removed: 20 transport functions in x, the generated service stubs for Raft, Zero and Worker (1,657 lines), and the JWT helper — identity belongs to IAM. The core called none of them. NOT KEPT: worker, conn, raftwal, the cluster commands, the GraphQL layer and the test harnesses. `query`, the DQL execution engine, went with them because it depends on worker; parsing DQL is available here, executing it is not. The history of the upstream project lives at github.com/dgraph-io/dgraph. This repository begins at the derivation because three quarters of that history describes code this fork does not carry.
217 lines
4.7 KiB
Go
217 lines
4.7 KiB
Go
/*
|
|
* SPDX-FileCopyrightText: © 2017-2026 Istari Digital, Inc.
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*/
|
|
|
|
package schema
|
|
|
|
import (
|
|
"github.com/hanzoai/graph/lex"
|
|
)
|
|
|
|
// Constants representing type of different graphql lexed items.
|
|
const (
|
|
itemText lex.ItemType = 5 + iota // plain text
|
|
itemNumber // number
|
|
itemLeftCurl // left curly bracket
|
|
itemRightCurl // right curly bracket
|
|
itemColon // colon
|
|
itemLeftRound // left round bracket
|
|
itemRightRound // right round bracket
|
|
itemAt // '@'
|
|
itemComma // ','
|
|
itemNewLine // carriage-return or line-feed.
|
|
itemDot // '.'
|
|
itemLeftSquare // '['
|
|
itemRightSquare // ']'
|
|
itemExclamationMark // '!'
|
|
itemQuote // double quote char: '"'
|
|
itemQuotedText // See Lexer.LexQuotedString()
|
|
)
|
|
|
|
func lexText(l *lex.Lexer) lex.StateFn {
|
|
Loop:
|
|
for {
|
|
switch r := l.Next(); {
|
|
case r == lex.EOF:
|
|
break Loop
|
|
case isNameBegin(r):
|
|
l.Backup()
|
|
return lexWord
|
|
case isSpace(r):
|
|
l.Ignore()
|
|
case lex.IsEndOfLine(r):
|
|
l.Emit(itemNewLine)
|
|
case r == '.':
|
|
l.Emit(itemDot)
|
|
case r == '#':
|
|
return lexTextComment
|
|
case r == ',':
|
|
l.Emit(itemComma)
|
|
case r == '<':
|
|
if err := lex.IRIRef(l, itemText); err != nil {
|
|
return l.Errorf("Invalid schema: %v", err)
|
|
}
|
|
case r == '{':
|
|
l.Emit(itemLeftCurl)
|
|
case r == '}':
|
|
l.Emit(itemRightCurl)
|
|
case r == '(':
|
|
l.Emit(itemLeftRound)
|
|
case r == ')':
|
|
l.Emit(itemRightRound)
|
|
case r == ':':
|
|
l.Emit(itemColon)
|
|
case r == '@':
|
|
l.Emit(itemAt)
|
|
case r == '[':
|
|
l.Emit(itemLeftSquare)
|
|
case r == ']':
|
|
l.Emit(itemRightSquare)
|
|
case r == '!':
|
|
l.Emit(itemExclamationMark)
|
|
case r == '_':
|
|
// Predicates can start with _.
|
|
return lexWord
|
|
case isDigit(r):
|
|
nextRunes := l.PeekTwo()
|
|
if r == '0' && isHexseparator(nextRunes[0]) && isHexadecimal(nextRunes[1]) {
|
|
l.Backup()
|
|
return lexHexNumber
|
|
} else {
|
|
l.Backup()
|
|
return lexNumber
|
|
}
|
|
case r == '"':
|
|
if err := l.LexQuotedString(); err != nil {
|
|
return l.Errorf("Invalid schema: %v", err)
|
|
}
|
|
l.Emit(itemQuotedText)
|
|
default:
|
|
return l.Errorf("Invalid schema. Unexpected %s", l.Input[l.Start:l.Pos])
|
|
}
|
|
}
|
|
if l.Pos > l.Start {
|
|
l.Emit(itemText)
|
|
}
|
|
l.Emit(lex.ItemEOF)
|
|
return nil
|
|
}
|
|
|
|
func lexWord(l *lex.Lexer) lex.StateFn {
|
|
for {
|
|
// The caller already checked isNameBegin, and absorbed one rune.
|
|
r := l.Next()
|
|
if isNameSuffix(r) {
|
|
continue
|
|
}
|
|
l.Backup()
|
|
l.Emit(itemText)
|
|
break
|
|
}
|
|
return lexText
|
|
}
|
|
|
|
func lexNumber(l *lex.Lexer) lex.StateFn {
|
|
for {
|
|
// The caller already checked isNumber, and absorbed one rune.
|
|
r := l.Next()
|
|
if isDigit(r) {
|
|
continue
|
|
}
|
|
l.Backup()
|
|
l.Emit(itemNumber)
|
|
break
|
|
}
|
|
return lexText
|
|
}
|
|
|
|
func lexHexNumber(l *lex.Lexer) lex.StateFn {
|
|
// It satisfies 0[xX] then process the input as hexadecimal.
|
|
l.Next()
|
|
l.Next() // Absorb 0[xX]
|
|
for {
|
|
// The caller already checked isHexadecimal, and absorbed one rune.
|
|
r := l.Next()
|
|
if isHexadecimal(r) {
|
|
continue
|
|
}
|
|
l.Backup()
|
|
l.Emit(itemNumber)
|
|
break
|
|
}
|
|
return lexText
|
|
}
|
|
|
|
// lexTextComment lexes a comment text inside a schema.
|
|
func lexTextComment(l *lex.Lexer) lex.StateFn {
|
|
for {
|
|
r := l.Next()
|
|
if r == lex.EOF {
|
|
l.Ignore()
|
|
l.Emit(lex.ItemEOF)
|
|
break
|
|
}
|
|
if !lex.IsEndOfLine(r) {
|
|
continue
|
|
}
|
|
l.Ignore()
|
|
l.Emit(itemNewLine)
|
|
break
|
|
}
|
|
return lexText
|
|
}
|
|
|
|
// isNameBegin returns true if the rune is an alphabet.
|
|
func isNameBegin(r rune) bool {
|
|
switch {
|
|
case r >= 'a' && r <= 'z':
|
|
return true
|
|
case r >= 'A' && r <= 'Z':
|
|
return true
|
|
default:
|
|
return false
|
|
}
|
|
}
|
|
|
|
func isNameSuffix(r rune) bool {
|
|
if isNameBegin(r) {
|
|
return true
|
|
}
|
|
if r >= '0' && r <= '9' {
|
|
return true
|
|
}
|
|
if r == '_' || r == '.' || r == '-' { // Use by freebase.
|
|
return true
|
|
}
|
|
return false
|
|
}
|
|
|
|
// isHexadecimal returns true if the rune is hexadecimal.
|
|
func isHexadecimal(r rune) bool {
|
|
switch {
|
|
case r >= 'a' && r <= 'f':
|
|
return true
|
|
case r >= 'A' && r <= 'F':
|
|
return true
|
|
case isDigit(r):
|
|
return true
|
|
default:
|
|
return false
|
|
}
|
|
}
|
|
|
|
func isHexseparator(r rune) bool {
|
|
return r == 'x' || r == 'X'
|
|
}
|
|
|
|
// isDigit returns true if the rune is digit.
|
|
func isDigit(r rune) bool {
|
|
return r >= '0' && r <= '9'
|
|
}
|
|
|
|
// isSpace returns true if the rune is a tab or space.
|
|
func isSpace(r rune) bool {
|
|
return r == '\u0009' || r == '\u0020'
|
|
}
|