nodesproto

type GraphHeader struct {
	// LastID is a last node ID used by ID allocator for this graph. Implementation may reserve some
	// IDs space by setting LastID > max(nodes.ID). If not set, max(nodes.ID) is assumed.
	// Tools that manipulate the graph, but want to preserve IDs of the nodes should allocate IDs
	// starting from LastID+1.
	LastId uint64 `protobuf:"varint,1,opt,name=last_id,json=lastId,proto3" json:"last_id,omitempty"`
	// Root is an optional ID of a global root for this graph. This field is used to preserve
	// compatibility with tools that expect a tree-shaped data.
	// Implementation may also store multiple roots by referencing an Array node, or may store
	// multiple named roots by referencing an Object node.
	// If not set explicitly, implementations that expect a tree should search the graph for
	// unused nodes of type Object or Array and treat them as an array of roots.
	Root uint64 `protobuf:"varint,2,opt,name=root,proto3" json:"root,omitempty"`
	// Metadata is an optional ID for a metadata node for this file. Should reference an Object.
	// If set, implementations that expect a tree should exclude it from the list of roots.
	Metadata uint64 `protobuf:"varint,3,opt,name=metadata,proto3" json:"metadata,omitempty"`
}

type Node struct {
	// ID is a unique file-local ID of the node.
	// To implement global IDs, application should write additional data to the graph
	// or keep a mapping from file-local IDs to global ones.
	Id uint64 `protobuf:"varint,1,opt,name=id,proto3" json:"id,omitempty"`
	// Value is a union for primitive value types.
	// These values are always leaf nodes, they should never store any references to other nodes,
	// or other graph-specific information.
	// It is assumed that encoded Value can be copied to a different Graph without any changes.
	//
	// Types that are valid to be assigned to Value:
	//	*Node_String_
	//	*Node_Int
	//	*Node_Uint
	//	*Node_Float
	//	*Node_Bool
	Value isNode_Value `protobuf_oneof:"value"`
	// Keys is an ordered set of Object keys. Coresponding values are stored in Values field.
	Keys []uint64 `protobuf:"varint,7,rep,packed,name=keys" json:"keys,omitempty"`
	// KeysFrom can refer to a node ID previously seen on wire. In this case, Keys from that node
	// are copied to Keys field of current node. Thus, full list of Keys can be omited.
	KeysFrom uint64 `protobuf:"varint,10,opt,name=keys_from,json=keysFrom,proto3" json:"keys_from,omitempty"`
	// Values stores an ordered list of node IDs. Zero ID represents a null node.
	// For Array node this field represent an array itself, and for Object nodes
	// this field is a set of values that coresponds to keys defined by Keys or KeysFrom.
	Values []uint64 `protobuf:"varint,8,rep,packed,name=values" json:"values,omitempty"`
	// IsObject is a helper field to distinguish between empty arrays and empty objects.
	IsObject bool `protobuf:"varint,9,opt,name=is_object,json=isObject,proto3" json:"is_object,omitempty"`
	// ValuesOffs is an offset added to all value IDs. Used for compression.
	ValuesOffs uint64 `protobuf:"varint,11,opt,name=values_offs,json=valuesOffs,proto3" json:"values_offs,omitempty"`
}

type Node_Bool struct {
	Bool bool `protobuf:"varint,6,opt,name=bool,proto3,oneof"`
}

type Node_Float struct {
	Float float64 `protobuf:"fixed64,5,opt,name=float,proto3,oneof"`
}

type Node_Int struct {
	Int int64 `protobuf:"varint,3,opt,name=int,proto3,oneof"`
}

type Node_String_ struct {
	String_ string `protobuf:"bytes,2,opt,name=string,proto3,oneof"`
}

type Node_Uint struct {
	Uint uint64 `protobuf:"varint,4,opt,name=uint,proto3,oneof"`
}

type RawGraph struct {
	Root  uint64             `json:"root,omitempty"`
	Meta  uint64             `json:"meta,omitempty"`
	Last  uint64             `json:"last,omitempty"`
	Nodes map[uint64]RawNode `json:"nodes"`
}

type RawNode struct {
	ID     uint64      `json:"id"`
	Kind   nodes.Kind  `json:"kind"`
	Value  nodes.Value `json:"val,omitempty"`
	Keys   []uint64    `json:"keys,omitempty"`
	Values []uint64    `json:"values,omitempty"`
}