Eric Salo
2 years ago
committed by
Copybara-Service
parent
e42c1780a0
commit
07fba1da07
52 changed files with 386 additions and 413 deletions
@ -1,98 +1,17 @@ |
||||
// Protocol Buffers - Google's data interchange format
|
||||
// Copyright 2023 Google LLC. All rights reserved.
|
||||
// https://developers.google.com/protocol-buffers/
|
||||
//
|
||||
// Redistribution and use in source and binary forms, with or without
|
||||
// modification, are permitted provided that the following conditions are
|
||||
// met:
|
||||
//
|
||||
// * Redistributions of source code must retain the above copyright
|
||||
// notice, this list of conditions and the following disclaimer.
|
||||
// * Redistributions in binary form must reproduce the above
|
||||
// copyright notice, this list of conditions and the following disclaimer
|
||||
// in the documentation and/or other materials provided with the
|
||||
// distribution.
|
||||
// * Neither the name of Google LLC nor the names of its
|
||||
// contributors may be used to endorse or promote products derived from
|
||||
// this software without specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file or at
|
||||
// https://developers.google.com/open-source/licenses/bsd
|
||||
|
||||
// Temporary hack to fix gRPC. Do not use.
|
||||
|
||||
#ifndef UPB_COLLECTIONS_ARRAY_H_ |
||||
#define UPB_COLLECTIONS_ARRAY_H_ |
||||
|
||||
#include <stddef.h> |
||||
|
||||
#include "upb/base/descriptor_constants.h" |
||||
#include "upb/mem/arena.h" |
||||
#include "upb/message/value.h" // IWYU pragma: export |
||||
|
||||
// Must be last.
|
||||
#include "upb/port/def.inc" |
||||
|
||||
typedef struct upb_Array upb_Array; |
||||
|
||||
#ifdef __cplusplus |
||||
extern "C" { |
||||
#endif |
||||
|
||||
// Creates a new array on the given arena that holds elements of this type.
|
||||
UPB_API upb_Array* upb_Array_New(upb_Arena* a, upb_CType type); |
||||
|
||||
// Returns the number of elements in the array.
|
||||
UPB_API size_t upb_Array_Size(const upb_Array* arr); |
||||
|
||||
// Returns the given element, which must be within the array's current size.
|
||||
UPB_API upb_MessageValue upb_Array_Get(const upb_Array* arr, size_t i); |
||||
|
||||
// Sets the given element, which must be within the array's current size.
|
||||
UPB_API void upb_Array_Set(upb_Array* arr, size_t i, upb_MessageValue val); |
||||
|
||||
// Appends an element to the array. Returns false on allocation failure.
|
||||
UPB_API bool upb_Array_Append(upb_Array* array, upb_MessageValue val, |
||||
upb_Arena* arena); |
||||
|
||||
// Moves elements within the array using memmove().
|
||||
// Like memmove(), the source and destination elements may be overlapping.
|
||||
UPB_API void upb_Array_Move(upb_Array* array, size_t dst_idx, size_t src_idx, |
||||
size_t count); |
||||
|
||||
// Inserts one or more empty elements into the array.
|
||||
// Existing elements are shifted right.
|
||||
// The new elements have undefined state and must be set with `upb_Array_Set()`.
|
||||
// REQUIRES: `i <= upb_Array_Size(arr)`
|
||||
UPB_API bool upb_Array_Insert(upb_Array* array, size_t i, size_t count, |
||||
upb_Arena* arena); |
||||
|
||||
// Deletes one or more elements from the array.
|
||||
// Existing elements are shifted left.
|
||||
// REQUIRES: `i + count <= upb_Array_Size(arr)`
|
||||
UPB_API void upb_Array_Delete(upb_Array* array, size_t i, size_t count); |
||||
|
||||
// Changes the size of a vector. New elements are initialized to NULL/0.
|
||||
// Returns false on allocation failure.
|
||||
UPB_API bool upb_Array_Resize(upb_Array* array, size_t size, upb_Arena* arena); |
||||
|
||||
// Returns pointer to array data.
|
||||
UPB_API const void* upb_Array_DataPtr(const upb_Array* arr); |
||||
|
||||
// Returns mutable pointer to array data.
|
||||
UPB_API void* upb_Array_MutableDataPtr(upb_Array* arr); |
||||
|
||||
#ifdef __cplusplus |
||||
} /* extern "C" */ |
||||
#endif |
||||
|
||||
#include "upb/port/undef.inc" |
||||
// IWYU pragma: begin_exports
|
||||
#include "upb/message/array.h" |
||||
// IWYU pragma: end_exports
|
||||
|
||||
#endif /* UPB_COLLECTIONS_ARRAY_H_ */ |
||||
|
||||
@ -1,147 +1,17 @@ |
||||
// Protocol Buffers - Google's data interchange format
|
||||
// Copyright 2023 Google LLC. All rights reserved.
|
||||
// https://developers.google.com/protocol-buffers/
|
||||
//
|
||||
// Redistribution and use in source and binary forms, with or without
|
||||
// modification, are permitted provided that the following conditions are
|
||||
// met:
|
||||
//
|
||||
// * Redistributions of source code must retain the above copyright
|
||||
// notice, this list of conditions and the following disclaimer.
|
||||
// * Redistributions in binary form must reproduce the above
|
||||
// copyright notice, this list of conditions and the following disclaimer
|
||||
// in the documentation and/or other materials provided with the
|
||||
// distribution.
|
||||
// * Neither the name of Google LLC nor the names of its
|
||||
// contributors may be used to endorse or promote products derived from
|
||||
// this software without specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file or at
|
||||
// https://developers.google.com/open-source/licenses/bsd
|
||||
|
||||
// Temporary hack to fix gRPC. Do not use.
|
||||
|
||||
#ifndef UPB_COLLECTIONS_MAP_H_ |
||||
#define UPB_COLLECTIONS_MAP_H_ |
||||
|
||||
#include <stddef.h> |
||||
|
||||
#include "upb/base/descriptor_constants.h" |
||||
#include "upb/mem/arena.h" |
||||
#include "upb/message/value.h" // IWYU pragma: export |
||||
|
||||
// Must be last.
|
||||
#include "upb/port/def.inc" |
||||
|
||||
typedef struct upb_Map upb_Map; |
||||
|
||||
#ifdef __cplusplus |
||||
extern "C" { |
||||
#endif |
||||
|
||||
// Creates a new map on the given arena with the given key/value size.
|
||||
UPB_API upb_Map* upb_Map_New(upb_Arena* a, upb_CType key_type, |
||||
upb_CType value_type); |
||||
|
||||
// Returns the number of entries in the map.
|
||||
UPB_API size_t upb_Map_Size(const upb_Map* map); |
||||
|
||||
// Stores a value for the given key into |*val| (or the zero value if the key is
|
||||
// not present). Returns whether the key was present. The |val| pointer may be
|
||||
// NULL, in which case the function tests whether the given key is present.
|
||||
UPB_API bool upb_Map_Get(const upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue* val); |
||||
|
||||
// Removes all entries in the map.
|
||||
UPB_API void upb_Map_Clear(upb_Map* map); |
||||
|
||||
typedef enum { |
||||
kUpb_MapInsertStatus_Inserted = 0, |
||||
kUpb_MapInsertStatus_Replaced = 1, |
||||
kUpb_MapInsertStatus_OutOfMemory = 2, |
||||
} upb_MapInsertStatus; |
||||
|
||||
// Sets the given key to the given value, returning whether the key was inserted
|
||||
// or replaced. If the key was inserted, then any existing iterators will be
|
||||
// invalidated.
|
||||
UPB_API upb_MapInsertStatus upb_Map_Insert(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue val, |
||||
upb_Arena* arena); |
||||
|
||||
// Sets the given key to the given value. Returns false if memory allocation
|
||||
// failed. If the key is newly inserted, then any existing iterators will be
|
||||
// invalidated.
|
||||
UPB_API_INLINE bool upb_Map_Set(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue val, upb_Arena* arena) { |
||||
return upb_Map_Insert(map, key, val, arena) != |
||||
kUpb_MapInsertStatus_OutOfMemory; |
||||
} |
||||
|
||||
// Deletes this key from the table. Returns true if the key was present.
|
||||
// If present and |val| is non-NULL, stores the deleted value.
|
||||
UPB_API bool upb_Map_Delete(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue* val); |
||||
|
||||
// (DEPRECATED and going away soon. Do not use.)
|
||||
UPB_INLINE bool upb_Map_Delete2(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue* val) { |
||||
return upb_Map_Delete(map, key, val); |
||||
} |
||||
|
||||
// Map iteration:
|
||||
//
|
||||
// size_t iter = kUpb_Map_Begin;
|
||||
// upb_MessageValue key, val;
|
||||
// while (upb_Map_Next(map, &key, &val, &iter)) {
|
||||
// ...
|
||||
// }
|
||||
|
||||
#define kUpb_Map_Begin ((size_t)-1) |
||||
|
||||
// Advances to the next entry. Returns false if no more entries are present.
|
||||
// Otherwise returns true and populates both *key and *value.
|
||||
UPB_API bool upb_Map_Next(const upb_Map* map, upb_MessageValue* key, |
||||
upb_MessageValue* val, size_t* iter); |
||||
|
||||
// Sets the value for the entry pointed to by iter.
|
||||
// WARNING: this does not currently work for string values!
|
||||
UPB_API void upb_Map_SetEntryValue(upb_Map* map, size_t iter, |
||||
upb_MessageValue val); |
||||
|
||||
// DEPRECATED iterator, slated for removal.
|
||||
|
||||
/* Map iteration:
|
||||
* |
||||
* size_t iter = kUpb_Map_Begin; |
||||
* while (upb_MapIterator_Next(map, &iter)) { |
||||
* upb_MessageValue key = upb_MapIterator_Key(map, iter); |
||||
* upb_MessageValue val = upb_MapIterator_Value(map, iter); |
||||
* } |
||||
*/ |
||||
|
||||
// Advances to the next entry. Returns false if no more entries are present.
|
||||
UPB_API bool upb_MapIterator_Next(const upb_Map* map, size_t* iter); |
||||
|
||||
// Returns true if the iterator still points to a valid entry, or false if the
|
||||
// iterator is past the last element. It is an error to call this function with
|
||||
// kUpb_Map_Begin (you must call next() at least once first).
|
||||
UPB_API bool upb_MapIterator_Done(const upb_Map* map, size_t iter); |
||||
|
||||
// Returns the key and value for this entry of the map.
|
||||
UPB_API upb_MessageValue upb_MapIterator_Key(const upb_Map* map, size_t iter); |
||||
UPB_API upb_MessageValue upb_MapIterator_Value(const upb_Map* map, size_t iter); |
||||
|
||||
#ifdef __cplusplus |
||||
} /* extern "C" */ |
||||
#endif |
||||
|
||||
#include "upb/port/undef.inc" |
||||
// IWYU pragma: begin_exports
|
||||
#include "upb/message/map.h" |
||||
// IWYU pragma: end_exports
|
||||
|
||||
#endif /* UPB_COLLECTIONS_MAP_H_ */ |
||||
|
||||
@ -0,0 +1,98 @@ |
||||
// Protocol Buffers - Google's data interchange format
|
||||
// Copyright 2023 Google LLC. All rights reserved.
|
||||
// https://developers.google.com/protocol-buffers/
|
||||
//
|
||||
// Redistribution and use in source and binary forms, with or without
|
||||
// modification, are permitted provided that the following conditions are
|
||||
// met:
|
||||
//
|
||||
// * Redistributions of source code must retain the above copyright
|
||||
// notice, this list of conditions and the following disclaimer.
|
||||
// * Redistributions in binary form must reproduce the above
|
||||
// copyright notice, this list of conditions and the following disclaimer
|
||||
// in the documentation and/or other materials provided with the
|
||||
// distribution.
|
||||
// * Neither the name of Google LLC nor the names of its
|
||||
// contributors may be used to endorse or promote products derived from
|
||||
// this software without specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
#ifndef UPB_MESSAGE_ARRAY_H_ |
||||
#define UPB_MESSAGE_ARRAY_H_ |
||||
|
||||
#include <stddef.h> |
||||
|
||||
#include "upb/base/descriptor_constants.h" |
||||
#include "upb/mem/arena.h" |
||||
#include "upb/message/value.h" // IWYU pragma: export |
||||
|
||||
// Must be last.
|
||||
#include "upb/port/def.inc" |
||||
|
||||
typedef struct upb_Array upb_Array; |
||||
|
||||
#ifdef __cplusplus |
||||
extern "C" { |
||||
#endif |
||||
|
||||
// Creates a new array on the given arena that holds elements of this type.
|
||||
UPB_API upb_Array* upb_Array_New(upb_Arena* a, upb_CType type); |
||||
|
||||
// Returns the number of elements in the array.
|
||||
UPB_API size_t upb_Array_Size(const upb_Array* arr); |
||||
|
||||
// Returns the given element, which must be within the array's current size.
|
||||
UPB_API upb_MessageValue upb_Array_Get(const upb_Array* arr, size_t i); |
||||
|
||||
// Sets the given element, which must be within the array's current size.
|
||||
UPB_API void upb_Array_Set(upb_Array* arr, size_t i, upb_MessageValue val); |
||||
|
||||
// Appends an element to the array. Returns false on allocation failure.
|
||||
UPB_API bool upb_Array_Append(upb_Array* array, upb_MessageValue val, |
||||
upb_Arena* arena); |
||||
|
||||
// Moves elements within the array using memmove().
|
||||
// Like memmove(), the source and destination elements may be overlapping.
|
||||
UPB_API void upb_Array_Move(upb_Array* array, size_t dst_idx, size_t src_idx, |
||||
size_t count); |
||||
|
||||
// Inserts one or more empty elements into the array.
|
||||
// Existing elements are shifted right.
|
||||
// The new elements have undefined state and must be set with `upb_Array_Set()`.
|
||||
// REQUIRES: `i <= upb_Array_Size(arr)`
|
||||
UPB_API bool upb_Array_Insert(upb_Array* array, size_t i, size_t count, |
||||
upb_Arena* arena); |
||||
|
||||
// Deletes one or more elements from the array.
|
||||
// Existing elements are shifted left.
|
||||
// REQUIRES: `i + count <= upb_Array_Size(arr)`
|
||||
UPB_API void upb_Array_Delete(upb_Array* array, size_t i, size_t count); |
||||
|
||||
// Changes the size of a vector. New elements are initialized to NULL/0.
|
||||
// Returns false on allocation failure.
|
||||
UPB_API bool upb_Array_Resize(upb_Array* array, size_t size, upb_Arena* arena); |
||||
|
||||
// Returns pointer to array data.
|
||||
UPB_API const void* upb_Array_DataPtr(const upb_Array* arr); |
||||
|
||||
// Returns mutable pointer to array data.
|
||||
UPB_API void* upb_Array_MutableDataPtr(upb_Array* arr); |
||||
|
||||
#ifdef __cplusplus |
||||
} /* extern "C" */ |
||||
#endif |
||||
|
||||
#include "upb/port/undef.inc" |
||||
|
||||
#endif /* UPB_MESSAGE_ARRAY_H_ */ |
||||
@ -0,0 +1,147 @@ |
||||
// Protocol Buffers - Google's data interchange format
|
||||
// Copyright 2023 Google LLC. All rights reserved.
|
||||
// https://developers.google.com/protocol-buffers/
|
||||
//
|
||||
// Redistribution and use in source and binary forms, with or without
|
||||
// modification, are permitted provided that the following conditions are
|
||||
// met:
|
||||
//
|
||||
// * Redistributions of source code must retain the above copyright
|
||||
// notice, this list of conditions and the following disclaimer.
|
||||
// * Redistributions in binary form must reproduce the above
|
||||
// copyright notice, this list of conditions and the following disclaimer
|
||||
// in the documentation and/or other materials provided with the
|
||||
// distribution.
|
||||
// * Neither the name of Google LLC nor the names of its
|
||||
// contributors may be used to endorse or promote products derived from
|
||||
// this software without specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
#ifndef UPB_MESSAGE_MAP_H_ |
||||
#define UPB_MESSAGE_MAP_H_ |
||||
|
||||
#include <stddef.h> |
||||
|
||||
#include "upb/base/descriptor_constants.h" |
||||
#include "upb/mem/arena.h" |
||||
#include "upb/message/value.h" // IWYU pragma: export |
||||
|
||||
// Must be last.
|
||||
#include "upb/port/def.inc" |
||||
|
||||
typedef struct upb_Map upb_Map; |
||||
|
||||
#ifdef __cplusplus |
||||
extern "C" { |
||||
#endif |
||||
|
||||
// Creates a new map on the given arena with the given key/value size.
|
||||
UPB_API upb_Map* upb_Map_New(upb_Arena* a, upb_CType key_type, |
||||
upb_CType value_type); |
||||
|
||||
// Returns the number of entries in the map.
|
||||
UPB_API size_t upb_Map_Size(const upb_Map* map); |
||||
|
||||
// Stores a value for the given key into |*val| (or the zero value if the key is
|
||||
// not present). Returns whether the key was present. The |val| pointer may be
|
||||
// NULL, in which case the function tests whether the given key is present.
|
||||
UPB_API bool upb_Map_Get(const upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue* val); |
||||
|
||||
// Removes all entries in the map.
|
||||
UPB_API void upb_Map_Clear(upb_Map* map); |
||||
|
||||
typedef enum { |
||||
kUpb_MapInsertStatus_Inserted = 0, |
||||
kUpb_MapInsertStatus_Replaced = 1, |
||||
kUpb_MapInsertStatus_OutOfMemory = 2, |
||||
} upb_MapInsertStatus; |
||||
|
||||
// Sets the given key to the given value, returning whether the key was inserted
|
||||
// or replaced. If the key was inserted, then any existing iterators will be
|
||||
// invalidated.
|
||||
UPB_API upb_MapInsertStatus upb_Map_Insert(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue val, |
||||
upb_Arena* arena); |
||||
|
||||
// Sets the given key to the given value. Returns false if memory allocation
|
||||
// failed. If the key is newly inserted, then any existing iterators will be
|
||||
// invalidated.
|
||||
UPB_API_INLINE bool upb_Map_Set(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue val, upb_Arena* arena) { |
||||
return upb_Map_Insert(map, key, val, arena) != |
||||
kUpb_MapInsertStatus_OutOfMemory; |
||||
} |
||||
|
||||
// Deletes this key from the table. Returns true if the key was present.
|
||||
// If present and |val| is non-NULL, stores the deleted value.
|
||||
UPB_API bool upb_Map_Delete(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue* val); |
||||
|
||||
// (DEPRECATED and going away soon. Do not use.)
|
||||
UPB_INLINE bool upb_Map_Delete2(upb_Map* map, upb_MessageValue key, |
||||
upb_MessageValue* val) { |
||||
return upb_Map_Delete(map, key, val); |
||||
} |
||||
|
||||
// Map iteration:
|
||||
//
|
||||
// size_t iter = kUpb_Map_Begin;
|
||||
// upb_MessageValue key, val;
|
||||
// while (upb_Map_Next(map, &key, &val, &iter)) {
|
||||
// ...
|
||||
// }
|
||||
|
||||
#define kUpb_Map_Begin ((size_t)-1) |
||||
|
||||
// Advances to the next entry. Returns false if no more entries are present.
|
||||
// Otherwise returns true and populates both *key and *value.
|
||||
UPB_API bool upb_Map_Next(const upb_Map* map, upb_MessageValue* key, |
||||
upb_MessageValue* val, size_t* iter); |
||||
|
||||
// Sets the value for the entry pointed to by iter.
|
||||
// WARNING: this does not currently work for string values!
|
||||
UPB_API void upb_Map_SetEntryValue(upb_Map* map, size_t iter, |
||||
upb_MessageValue val); |
||||
|
||||
// DEPRECATED iterator, slated for removal.
|
||||
|
||||
/* Map iteration:
|
||||
* |
||||
* size_t iter = kUpb_Map_Begin; |
||||
* while (upb_MapIterator_Next(map, &iter)) { |
||||
* upb_MessageValue key = upb_MapIterator_Key(map, iter); |
||||
* upb_MessageValue val = upb_MapIterator_Value(map, iter); |
||||
* } |
||||
*/ |
||||
|
||||
// Advances to the next entry. Returns false if no more entries are present.
|
||||
UPB_API bool upb_MapIterator_Next(const upb_Map* map, size_t* iter); |
||||
|
||||
// Returns true if the iterator still points to a valid entry, or false if the
|
||||
// iterator is past the last element. It is an error to call this function with
|
||||
// kUpb_Map_Begin (you must call next() at least once first).
|
||||
UPB_API bool upb_MapIterator_Done(const upb_Map* map, size_t iter); |
||||
|
||||
// Returns the key and value for this entry of the map.
|
||||
UPB_API upb_MessageValue upb_MapIterator_Key(const upb_Map* map, size_t iter); |
||||
UPB_API upb_MessageValue upb_MapIterator_Value(const upb_Map* map, size_t iter); |
||||
|
||||
#ifdef __cplusplus |
||||
} /* extern "C" */ |
||||
#endif |
||||
|
||||
#include "upb/port/undef.inc" |
||||
|
||||
#endif /* UPB_MESSAGE_MAP_H_ */ |
||||
Loading…
Reference in new issue