Documentation
¶
Overview ¶
Package storage_service_proto is a generated protocol buffer package.
It is generated from these files:
kythe/proto/storage_service.proto
It has these top-level messages:
Index ¶
- func RegisterGraphStoreServer(s *grpc.Server, srv GraphStoreServer)
- func RegisterShardedGraphStoreServer(s *grpc.Server, srv ShardedGraphStoreServer)
- type GraphStoreClient
- type GraphStoreServer
- type GraphStore_ReadClient
- type GraphStore_ReadServer
- type GraphStore_ScanClient
- type GraphStore_ScanServer
- type ShardedGraphStoreClient
- type ShardedGraphStoreServer
- type ShardedGraphStore_ShardClient
- type ShardedGraphStore_ShardServer
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func RegisterGraphStoreServer ¶
func RegisterGraphStoreServer(s *grpc.Server, srv GraphStoreServer)
func RegisterShardedGraphStoreServer ¶
func RegisterShardedGraphStoreServer(s *grpc.Server, srv ShardedGraphStoreServer)
Types ¶
type GraphStoreClient ¶
type GraphStoreClient interface { // Read responds with all Entry messages that match the given ReadRequest. // The Read operation should be implemented with time complexity proportional // to the size of the return set. Read(ctx context.Context, in *kythe_proto.ReadRequest, opts ...grpc.CallOption) (GraphStore_ReadClient, error) // Scan responds with all Entry messages matching the given ScanRequest. If a // ScanRequest field is empty, any entry value for that field matches and will // be returned. Scan is similar to Read, but with no time complexity // restrictions. Scan(ctx context.Context, in *kythe_proto.ScanRequest, opts ...grpc.CallOption) (GraphStore_ScanClient, error) // Write atomically inserts or updates a collection of entries into the store. // Each update is a tuple of the form (kind, target, fact, value). For each // such update, an entry (source, kind, target, fact, value) is written into // the store, replacing any existing entry (source, kind, target, fact, // value') that may exist. Note that this operation cannot delete any data // from the store; entries are only ever inserted or updated. Apart from // acting atomically, no other constraints are placed on the implementation. Write(ctx context.Context, in *kythe_proto.WriteRequest, opts ...grpc.CallOption) (*kythe_proto.WriteReply, error) }
func NewGraphStoreClient ¶
func NewGraphStoreClient(cc *grpc.ClientConn) GraphStoreClient
type GraphStoreServer ¶
type GraphStoreServer interface { // Read responds with all Entry messages that match the given ReadRequest. // The Read operation should be implemented with time complexity proportional // to the size of the return set. Read(*kythe_proto.ReadRequest, GraphStore_ReadServer) error // Scan responds with all Entry messages matching the given ScanRequest. If a // ScanRequest field is empty, any entry value for that field matches and will // be returned. Scan is similar to Read, but with no time complexity // restrictions. Scan(*kythe_proto.ScanRequest, GraphStore_ScanServer) error // Write atomically inserts or updates a collection of entries into the store. // Each update is a tuple of the form (kind, target, fact, value). For each // such update, an entry (source, kind, target, fact, value) is written into // the store, replacing any existing entry (source, kind, target, fact, // value') that may exist. Note that this operation cannot delete any data // from the store; entries are only ever inserted or updated. Apart from // acting atomically, no other constraints are placed on the implementation. Write(context.Context, *kythe_proto.WriteRequest) (*kythe_proto.WriteReply, error) }
type GraphStore_ReadClient ¶
type GraphStore_ReadClient interface { Recv() (*kythe_proto.Entry, error) grpc.ClientStream }
type GraphStore_ReadServer ¶
type GraphStore_ReadServer interface { Send(*kythe_proto.Entry) error grpc.ServerStream }
type GraphStore_ScanClient ¶
type GraphStore_ScanClient interface { Recv() (*kythe_proto.Entry, error) grpc.ClientStream }
type GraphStore_ScanServer ¶
type GraphStore_ScanServer interface { Send(*kythe_proto.Entry) error grpc.ServerStream }
type ShardedGraphStoreClient ¶
type ShardedGraphStoreClient interface { // Count returns the number of entries in the given shard. Count(ctx context.Context, in *kythe_proto.CountRequest, opts ...grpc.CallOption) (*kythe_proto.CountReply, error) // Shard responds with each Entry in the given shard. Shard(ctx context.Context, in *kythe_proto.ShardRequest, opts ...grpc.CallOption) (ShardedGraphStore_ShardClient, error) }
func NewShardedGraphStoreClient ¶
func NewShardedGraphStoreClient(cc *grpc.ClientConn) ShardedGraphStoreClient
type ShardedGraphStoreServer ¶
type ShardedGraphStoreServer interface { // Count returns the number of entries in the given shard. Count(context.Context, *kythe_proto.CountRequest) (*kythe_proto.CountReply, error) // Shard responds with each Entry in the given shard. Shard(*kythe_proto.ShardRequest, ShardedGraphStore_ShardServer) error }
type ShardedGraphStore_ShardClient ¶
type ShardedGraphStore_ShardClient interface { Recv() (*kythe_proto.Entry, error) grpc.ClientStream }
type ShardedGraphStore_ShardServer ¶
type ShardedGraphStore_ShardServer interface { Send(*kythe_proto.Entry) error grpc.ServerStream }
Click to show internal directories.
Click to hide internal directories.