wehub-resource-sync
347 lines
9.7 KiB
Go
347 lines
9.7 KiB
Go
// Copyright 2022-2023 Dolthub, Inc.
|
|
//
|
|
// 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.
|
|
|
|
// Code generated by the FlatBuffers compiler. DO NOT EDIT.
|
|
|
|
package serial
|
|
|
|
import (
|
|
flatbuffers "github.com/dolthub/flatbuffers/v23/go"
|
|
)
|
|
|
|
type VectorIndexNode struct {
|
|
_tab flatbuffers.Table
|
|
}
|
|
|
|
func InitVectorIndexNodeRoot(o *VectorIndexNode, buf []byte, offset flatbuffers.UOffsetT) error {
|
|
n := flatbuffers.GetUOffsetT(buf[offset:])
|
|
return o.Init(buf, n+offset)
|
|
}
|
|
|
|
func TryGetRootAsVectorIndexNode(buf []byte, offset flatbuffers.UOffsetT) (*VectorIndexNode, error) {
|
|
x := &VectorIndexNode{}
|
|
return x, InitVectorIndexNodeRoot(x, buf, offset)
|
|
}
|
|
|
|
func TryGetSizePrefixedRootAsVectorIndexNode(buf []byte, offset flatbuffers.UOffsetT) (*VectorIndexNode, error) {
|
|
x := &VectorIndexNode{}
|
|
return x, InitVectorIndexNodeRoot(x, buf, offset+flatbuffers.SizeUint32)
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) Init(buf []byte, i flatbuffers.UOffsetT) error {
|
|
rcv._tab.Bytes = buf
|
|
rcv._tab.Pos = i
|
|
if VectorIndexNodeNumFields < rcv.Table().NumFields() {
|
|
return flatbuffers.ErrTableHasUnknownFields
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) Table() flatbuffers.Table {
|
|
return rcv._tab
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) KeyItems(j int) byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(4))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.GetByte(a + flatbuffers.UOffsetT(j*1))
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) KeyItemsLength() int {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(4))
|
|
if o != 0 {
|
|
return rcv._tab.VectorLen(o)
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) KeyItemsBytes() []byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(4))
|
|
if o != 0 {
|
|
return rcv._tab.ByteVector(o + rcv._tab.Pos)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateKeyItems(j int, n byte) bool {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(4))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.MutateByte(a+flatbuffers.UOffsetT(j*1), n)
|
|
}
|
|
return false
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) KeyOffsets(j int) uint32 {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(6))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.GetUint32(a + flatbuffers.UOffsetT(j*4))
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) KeyOffsetsLength() int {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(6))
|
|
if o != 0 {
|
|
return rcv._tab.VectorLen(o)
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateKeyOffsets(j int, n uint32) bool {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(6))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.MutateUint32(a+flatbuffers.UOffsetT(j*4), n)
|
|
}
|
|
return false
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) ValueItems(j int) byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(8))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.GetByte(a + flatbuffers.UOffsetT(j*1))
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) ValueItemsLength() int {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(8))
|
|
if o != 0 {
|
|
return rcv._tab.VectorLen(o)
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) ValueItemsBytes() []byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(8))
|
|
if o != 0 {
|
|
return rcv._tab.ByteVector(o + rcv._tab.Pos)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateValueItems(j int, n byte) bool {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(8))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.MutateByte(a+flatbuffers.UOffsetT(j*1), n)
|
|
}
|
|
return false
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) ValueOffsets(j int) uint32 {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(10))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.GetUint32(a + flatbuffers.UOffsetT(j*4))
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) ValueOffsetsLength() int {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(10))
|
|
if o != 0 {
|
|
return rcv._tab.VectorLen(o)
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateValueOffsets(j int, n uint32) bool {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(10))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.MutateUint32(a+flatbuffers.UOffsetT(j*4), n)
|
|
}
|
|
return false
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) AddressArray(j int) byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(12))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.GetByte(a + flatbuffers.UOffsetT(j*1))
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) AddressArrayLength() int {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(12))
|
|
if o != 0 {
|
|
return rcv._tab.VectorLen(o)
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) AddressArrayBytes() []byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(12))
|
|
if o != 0 {
|
|
return rcv._tab.ByteVector(o + rcv._tab.Pos)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateAddressArray(j int, n byte) bool {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(12))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.MutateByte(a+flatbuffers.UOffsetT(j*1), n)
|
|
}
|
|
return false
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) SubtreeCounts(j int) byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(14))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.GetByte(a + flatbuffers.UOffsetT(j*1))
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) SubtreeCountsLength() int {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(14))
|
|
if o != 0 {
|
|
return rcv._tab.VectorLen(o)
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) SubtreeCountsBytes() []byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(14))
|
|
if o != 0 {
|
|
return rcv._tab.ByteVector(o + rcv._tab.Pos)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateSubtreeCounts(j int, n byte) bool {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(14))
|
|
if o != 0 {
|
|
a := rcv._tab.Vector(o)
|
|
return rcv._tab.MutateByte(a+flatbuffers.UOffsetT(j*1), n)
|
|
}
|
|
return false
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) TreeCount() uint64 {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(16))
|
|
if o != 0 {
|
|
return rcv._tab.GetUint64(o + rcv._tab.Pos)
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateTreeCount(n uint64) bool {
|
|
return rcv._tab.MutateUint64Slot(16, n)
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) TreeLevel() byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(18))
|
|
if o != 0 {
|
|
return rcv._tab.GetByte(o + rcv._tab.Pos)
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateTreeLevel(n byte) bool {
|
|
return rcv._tab.MutateByteSlot(18, n)
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) LogChunkSize() byte {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(20))
|
|
if o != 0 {
|
|
return rcv._tab.GetByte(o + rcv._tab.Pos)
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateLogChunkSize(n byte) bool {
|
|
return rcv._tab.MutateByteSlot(20, n)
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) DistanceType() DistanceType {
|
|
o := flatbuffers.UOffsetT(rcv._tab.Offset(22))
|
|
if o != 0 {
|
|
return DistanceType(rcv._tab.GetByte(o + rcv._tab.Pos))
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func (rcv *VectorIndexNode) MutateDistanceType(n DistanceType) bool {
|
|
return rcv._tab.MutateByteSlot(22, byte(n))
|
|
}
|
|
|
|
const VectorIndexNodeNumFields = 10
|
|
|
|
func VectorIndexNodeStart(builder *flatbuffers.Builder) {
|
|
builder.StartObject(VectorIndexNodeNumFields)
|
|
}
|
|
func VectorIndexNodeAddKeyItems(builder *flatbuffers.Builder, keyItems flatbuffers.UOffsetT) {
|
|
builder.PrependUOffsetTSlot(0, flatbuffers.UOffsetT(keyItems), 0)
|
|
}
|
|
func VectorIndexNodeStartKeyItemsVector(builder *flatbuffers.Builder, numElems int) flatbuffers.UOffsetT {
|
|
return builder.StartVector(1, numElems, 1)
|
|
}
|
|
func VectorIndexNodeAddKeyOffsets(builder *flatbuffers.Builder, keyOffsets flatbuffers.UOffsetT) {
|
|
builder.PrependUOffsetTSlot(1, flatbuffers.UOffsetT(keyOffsets), 0)
|
|
}
|
|
func VectorIndexNodeStartKeyOffsetsVector(builder *flatbuffers.Builder, numElems int) flatbuffers.UOffsetT {
|
|
return builder.StartVector(4, numElems, 4)
|
|
}
|
|
func VectorIndexNodeAddValueItems(builder *flatbuffers.Builder, valueItems flatbuffers.UOffsetT) {
|
|
builder.PrependUOffsetTSlot(2, flatbuffers.UOffsetT(valueItems), 0)
|
|
}
|
|
func VectorIndexNodeStartValueItemsVector(builder *flatbuffers.Builder, numElems int) flatbuffers.UOffsetT {
|
|
return builder.StartVector(1, numElems, 1)
|
|
}
|
|
func VectorIndexNodeAddValueOffsets(builder *flatbuffers.Builder, valueOffsets flatbuffers.UOffsetT) {
|
|
builder.PrependUOffsetTSlot(3, flatbuffers.UOffsetT(valueOffsets), 0)
|
|
}
|
|
func VectorIndexNodeStartValueOffsetsVector(builder *flatbuffers.Builder, numElems int) flatbuffers.UOffsetT {
|
|
return builder.StartVector(4, numElems, 4)
|
|
}
|
|
func VectorIndexNodeAddAddressArray(builder *flatbuffers.Builder, addressArray flatbuffers.UOffsetT) {
|
|
builder.PrependUOffsetTSlot(4, flatbuffers.UOffsetT(addressArray), 0)
|
|
}
|
|
func VectorIndexNodeStartAddressArrayVector(builder *flatbuffers.Builder, numElems int) flatbuffers.UOffsetT {
|
|
return builder.StartVector(1, numElems, 1)
|
|
}
|
|
func VectorIndexNodeAddSubtreeCounts(builder *flatbuffers.Builder, subtreeCounts flatbuffers.UOffsetT) {
|
|
builder.PrependUOffsetTSlot(5, flatbuffers.UOffsetT(subtreeCounts), 0)
|
|
}
|
|
func VectorIndexNodeStartSubtreeCountsVector(builder *flatbuffers.Builder, numElems int) flatbuffers.UOffsetT {
|
|
return builder.StartVector(1, numElems, 1)
|
|
}
|
|
func VectorIndexNodeAddTreeCount(builder *flatbuffers.Builder, treeCount uint64) {
|
|
builder.PrependUint64Slot(6, treeCount, 0)
|
|
}
|
|
func VectorIndexNodeAddTreeLevel(builder *flatbuffers.Builder, treeLevel byte) {
|
|
builder.PrependByteSlot(7, treeLevel, 0)
|
|
}
|
|
func VectorIndexNodeAddLogChunkSize(builder *flatbuffers.Builder, logChunkSize byte) {
|
|
builder.PrependByteSlot(8, logChunkSize, 0)
|
|
}
|
|
func VectorIndexNodeAddDistanceType(builder *flatbuffers.Builder, distanceType DistanceType) {
|
|
builder.PrependByteSlot(9, byte(distanceType), 0)
|
|
}
|
|
func VectorIndexNodeEnd(builder *flatbuffers.Builder) flatbuffers.UOffsetT {
|
|
return builder.EndObject()
|
|
}
|