| // Licensed to the Apache Software Foundation (ASF) under one |
| // or more contributor license agreements. See the NOTICE file |
| // distributed with this work for additional information |
| // regarding copyright ownership. The ASF licenses this file |
| // to you 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. |
| // |
| // automatically generated by the FlatBuffers compiler, do not modify |
| |
| package org.apache.arrow.flatbuf; |
| |
| import java.nio.*; |
| import java.lang.*; |
| import java.util.*; |
| import com.google.flatbuffers.*; |
| |
| @SuppressWarnings("unused") |
| /** |
| * A Map is a logical nested type that is represented as |
| * |
| * List<entries: Struct<key: K, value: V>> |
| * |
| * In this layout, the keys and values are each respectively contiguous. We do |
| * not constrain the key and value types, so the application is responsible |
| * for ensuring that the keys are hashable and unique. Whether the keys are sorted |
| * may be set in the metadata for this field. |
| * |
| * In a field with Map type, the field has a child Struct field, which then |
| * has two children: key type and the second the value type. The names of the |
| * child fields may be respectively "entries", "key", and "value", but this is |
| * not enforced. |
| * |
| * Map |
| * ```text |
| * - child[0] entries: Struct |
| * - child[0] key: K |
| * - child[1] value: V |
| * ``` |
| * Neither the "entries" field nor the "key" field may be nullable. |
| * |
| * The metadata is structured so that Arrow systems without special handling |
| * for Map can make Map an alias for List. The "layout" attribute for the Map |
| * field must have the same contents as a List. |
| */ |
| public final class Map extends Table { |
| public static void ValidateVersion() { Constants.FLATBUFFERS_1_12_0(); } |
| public static Map getRootAsMap(ByteBuffer _bb) { return getRootAsMap(_bb, new Map()); } |
| public static Map getRootAsMap(ByteBuffer _bb, Map obj) { _bb.order(ByteOrder.LITTLE_ENDIAN); return (obj.__assign(_bb.getInt(_bb.position()) + _bb.position(), _bb)); } |
| public void __init(int _i, ByteBuffer _bb) { __reset(_i, _bb); } |
| public Map __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; } |
| |
| /** |
| * Set to true if the keys within each value are sorted |
| */ |
| public boolean keysSorted() { int o = __offset(4); return o != 0 ? 0!=bb.get(o + bb_pos) : false; } |
| |
| public static int createMap(FlatBufferBuilder builder, |
| boolean keysSorted) { |
| builder.startTable(1); |
| Map.addKeysSorted(builder, keysSorted); |
| return Map.endMap(builder); |
| } |
| |
| public static void startMap(FlatBufferBuilder builder) { builder.startTable(1); } |
| public static void addKeysSorted(FlatBufferBuilder builder, boolean keysSorted) { builder.addBoolean(0, keysSorted, false); } |
| public static int endMap(FlatBufferBuilder builder) { |
| int o = builder.endTable(); |
| return o; |
| } |
| |
| public static final class Vector extends BaseVector { |
| public Vector __assign(int _vector, int _element_size, ByteBuffer _bb) { __reset(_vector, _element_size, _bb); return this; } |
| |
| public Map get(int j) { return get(new Map(), j); } |
| public Map get(Map obj, int j) { return obj.__assign(__indirect(__element(j), bb), bb); } |
| } |
| } |
| |