Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://protobuf.dev/reference/cpp/api-docs/google.protobuf.repeated_field below:

repeated_field.h | Protocol Buffers Documentation

This section contains reference documentation for working with protocol buffer classes in C++.

#include <google/protobuf/repeated_field.h>
namespace google::protobuf

RepeatedField and RepeatedPtrField are used by generated protocol message classes to manipulate repeated fields.

These classes are very similar to STL's vector, but include a number of optimizations found to be useful specifically in the case of Protocol Buffers. RepeatedPtrField is particularly different from STL vector as it manages ownership of the pointers that it contains.

Typically, clients should not need to access RepeatedField objects directly, but should instead use the accessor functions generated automatically by the protocol compiler.

These definitions are not part of any class.

Provides a back insert iterator for

instances, similar to std::back_inserter().

Provides a back insert iterator for

instances, similar to std::back_inserter().

Special back insert iterator for

instances, just in case someone wants to write generic template code that can access both RepeatedFields and RepeatedPtrFields using a common name.

Provides a back insert iterator for

instances similar to std::back_inserter() which transfers the ownership while copying elements.

Similar to AllocatedRepeatedPtrFieldBackInserter, using UnsafeArenaAddAllocated instead of AddAllocated.

Similar to AllocatedRepeatedPtrFieldBackInserter, using UnsafeArenaAddAllocated instead of AddAllocated.

This is slightly faster if that matters. It is also useful in legacy code that uses temporary ownership to avoid copies. Example:

RepeatedPtrField<T> temp_field;
temp_field.AddAllocated(new T);
... // Do something with temp_field
temp_field.ExtractSubrange(0, temp_field.size(), nullptr);

If you put temp_field on the arena this fails, because the ownership transfers to the arena at the "AddAllocated" call and is not released anymore causing a double delete. Using UnsafeArenaAddAllocated prevents this.

#include <google/protobuf/repeated_field.h>
namespace google::protobuf

template <typename >

RepeatedField is used to represent repeated fields of a primitive type (in other words, everything except strings and nested Messages).

Most users will not ever use a RepeatedField directly; they will use the get-by-index, set-by-index, and add accessors that are generated for all repeated fields.

Element * iterator

STL-like iterator support.

const Element * const_iterator

Element value_type

value_type & reference

const value_type & const_reference

value_type * pointer

const value_type * const_pointer

int size_type

ptrdiff_t difference_type

std::reverse_iterator< const_iterator > const_reverse_iterator

Reverse iterator support.

RepeatedField()

RepeatedField(Iter begin, Iter end)

~RepeatedField()

empty() const

size() const

Get(int index) const

Mutable(int index)

operator[](int index) const

operator[](int index)

at(int index) const

at(int index)

Set(int index, const Element & value)

Add(const Element & value)

Add()

Appends a new element and return a pointer to it.

Add(Iter begin, Iter end)

Append elements in the range [begin, end) after reserving the appropriate number of elements.

RemoveLast()

Remove the last element in the array.

Clear()

Assign(Iter begin, Iter end)

Replaces the contents with RepeatedField(begin, end).

Reserve(int new_size)

Reserve space to expand the field to at least the given size.

Truncate(int new_size)

Resize the

to a new, smaller size. This is O(1).

AddAlreadyReserved(const Element & value)

AddAlreadyReserved()

Appends a new element and return a pointer to it.

AddNAlreadyReserved(int elements)

Capacity() const

Resize(int new_size, const Element & value)

Like STL resize.

mutable_data()

Gets the underlying array.

data() const

Swap entire contents with "other".

Swap entire contents with "other".

SwapElements(int index1, int index2)

Swap two elements.

begin()

begin() const

cbegin() const

end()

end() const

cend() const

rbegin()

rbegin() const

rend()

rend() const

SpaceUsedExcludingSelfLong() const

Returns the number of bytes used by the repeated field, excluding sizeof(*this)

SpaceUsedExcludingSelf() const

erase(const_iterator position)

Removes the element referenced by position.

erase(const_iterator first, const_iterator last)

Removes the elements in the range [first, last).

GetArena() const

Get the

on which this

stores its elements.

For internal use only.

RepeatedField(Iter begin, Iter end)

Appends a new element and return a pointer to it.

The new element is uninitialized if |Element| is a POD type.

Extract elements with indices in "[start .. start+num-1]".

Copy them into "elements[0 .. num-1]" if "elements" is not NULL. Caution: implementation also moves elements with indices [start+num ..]. Calling this routine inside a loop can cause quadratic behavior.

Reserve space to expand the field to at least the given size.

Avoid inlining of Reserve(): new, copy, and delete[] lead to a significant amount of code bloat.

If the array is grown, it will always be at least doubled in size.

Appends a new element and return a pointer to it.

The new element is uninitialized if |Element| is a POD type. Should be called only if Capacity() > Size().

Like STL resize.

Uses value to fill appended elements. Like Truncate() if new_size <= size(), otherwise this is O(new_size - size()).

Gets the underlying array.

This pointer is possibly invalidated by any add or remove operation.

Swap entire contents with "other".

If they are separate arenas then, copies data between each other.

Swap entire contents with "other".

Should be called only if the caller can guarantee that both repeated fields are on the same arena or are on the heap. Swapping between different arenas is disallowed and caught by a GOOGLE_DCHECK (see API docs for details).

Removes the element referenced by position.

Returns an iterator to the element immediately following the removed element.

Invalidates all iterators at or after the removed element, including end().

Removes the elements in the range [first, last).

Returns an iterator to the element immediately following the removed range.

Invalidates all iterators at or after the removed range, including end().

For internal use only.

This is public due to it being called by generated code.

#include <google/protobuf/repeated_field.h>
namespace google::protobuf

template <typename >

RepeatedPtrField is like RepeatedField, but used for repeated strings or Messages.

internal::RepeatedPtrIterator< Element > iterator

STL-like iterator support.

internal::RepeatedPtrIterator< const Element > const_iterator

Element value_type

value_type & reference

const value_type & const_reference

value_type * pointer

const value_type * const_pointer

int size_type

ptrdiff_t difference_type

std::reverse_iterator< const_iterator > const_reverse_iterator

Reverse iterator support.

internal::RepeatedPtrOverPtrsIterator< Element *, void * > pointer_iterator

Custom STL-like iterator that iterates over and returns the underlying pointers to Element rather than Element itself.

internal::RepeatedPtrOverPtrsIterator< const Element *const, const void *const > const_pointer_iterator

RepeatedPtrField()

RepeatedPtrField(Iter begin, Iter end)

~RepeatedPtrField()

empty() const

size() const

Get(int index) const

Mutable(int index)

Add()

Add(Element && value)

Add(Iter begin, Iter end)

Append elements in the range [begin, end) after reserving the appropriate number of elements.

operator[](int index) const

operator[](int index)

at(int index) const

at(int index)

RemoveLast()

Remove the last element in the array.

DeleteSubrange(int start, int num)

Delete elements with indices in the range [start .

Clear()

Assign(Iter begin, Iter end)

Replaces the contents with RepeatedPtrField(begin, end).

Reserve(int new_size)

Reserve space to expand the field to at least the given size.

Capacity() const

mutable_data()

Gets the underlying array.

data() const

Swap entire contents with "other".

Swap entire contents with "other".

SwapElements(int index1, int index2)

Swap two elements.

begin()

begin() const

cbegin() const

end()

end() const

cend() const

rbegin()

rbegin() const

rend()

rend() const

pointer_begin()

pointer_begin() const

pointer_end()

pointer_end() const

SpaceUsedExcludingSelfLong() const

Returns (an estimate of) the number of bytes used by the repeated field, excluding sizeof(*this).

SpaceUsedExcludingSelf() const

RepeatedPtrField(Iter begin, Iter end)

When hardcore memory management becomes necessary – as it sometimes does here at Google – the following methods may be useful.

AddAllocated(Element * value)

Add an already-allocated object, passing ownership to the

.

ReleaseLast()

Remove the last element and return it, passing ownership to the caller.

UnsafeArenaAddAllocated(Element * value)

Add an already-allocated object, skipping arena-ownership checks.

UnsafeArenaReleaseLast()

Remove the last element and return it.

ClearedCount() const

Get the number of cleared objects that are currently being kept around for reuse.

AddCleared(Element * value)

Add an element to the pool of cleared objects, passing ownership to the

.

ReleaseCleared()

Remove a single element from the cleared pool and return it, passing ownership to the caller.

erase(const_iterator position)

Removes the element referenced by position.

erase(const_iterator first, const_iterator last)

Removes the elements in the range [first, last).

GetArena() const

Gets the arena on which this

stores its elements.

For internal use only.

Remove the last element in the array.

Ownership of the element is retained by the array.

Delete elements with indices in the range [start .

. start+num-1]. Caution: implementation moves all elements with indices [start+num .. ]. Calling this routine inside a loop can cause quadratic behavior.

Reserve space to expand the field to at least the given size.

This only resizes the pointer array; it doesn't allocate any objects. If the array is grown, it will always be at least doubled in size.

Gets the underlying array.

This pointer is possibly invalidated by any add or remove operation.

Swap entire contents with "other".

If they are on separate arenas, then copies data.

Swap entire contents with "other".

Caller should guarantee that either both fields are on the same arena or both are on the heap. Swapping between different arenas with this function is disallowed and is caught via GOOGLE_DCHECK.

Add an already-allocated object, passing ownership to the RepeatedPtrField.

Note that some special behavior occurs with respect to arenas:

(i) if this field holds submessages, the new submessage will be copied if
the original is in an arena and this RepeatedPtrField is either in a
different arena, or on the heap.
(ii) if this field holds strings, the passed-in string *must* be
heap-allocated, not arena-allocated. There is no way to dynamically check
this at runtime, so User Beware.

Remove the last element and return it, passing ownership to the caller.

Requires: size() > 0

If this RepeatedPtrField is on an arena, an object copy is required to pass ownership back to the user (for compatible semantics). Use UnsafeArenaReleaseLast() if this behavior is undesired.

Add an already-allocated object, skipping arena-ownership checks.

The user must guarantee that the given object is in the same arena as this RepeatedPtrField. It is also useful in legacy code that uses temporary ownership to avoid copies. Example:

RepeatedPtrField<T> temp_field;
temp_field.AddAllocated(new T);
... // Do something with temp_field
temp_field.ExtractSubrange(0, temp_field.size(), nullptr);

If you put temp_field on the arena this fails, because the ownership transfers to the arena at the "AddAllocated" call and is not released anymore causing a double delete. UnsafeArenaAddAllocated prevents this.

Remove the last element and return it.

Works only when operating on an arena. The returned pointer is to the original object in the arena, hence has the arena's lifetime. Requires: current_size_ > 0

Extract elements with indices in the range "[start .. start+num-1]".

The caller assumes ownership of the extracted elements and is responsible for deleting them when they are no longer needed. If "elements" is non-NULL, then pointers to the extracted elements are stored in "elements[0 .. num-1]" for the convenience of the caller. If "elements" is NULL, then the caller must use some other mechanism to perform any further operations (like deletion) on these elements. Caution: implementation also moves elements with indices [start+num ..]. Calling this routine inside a loop can cause quadratic behavior.

Memory copying behavior is identical to ReleaseLast(), described above: if this RepeatedPtrField is on an arena, an object copy is performed for each returned element, so that all returned element pointers are to heap-allocated copies. If this copy is not desired, the user should call UnsafeArenaExtractSubrange().

Identical to ExtractSubrange() described above, except that when this repeated field is on an arena, no object copies are performed.

Instead, the raw object pointers are returned. Thus, if on an arena, the returned objects must not be freed, because they will not be heap-allocated objects.

Add an element to the pool of cleared objects, passing ownership to the RepeatedPtrField.

The element must be cleared prior to calling this method.

This method cannot be called when the repeated field is on an arena or when |value| is; both cases will trigger a GOOGLE_DCHECK-failure.

Remove a single element from the cleared pool and return it, passing ownership to the caller.

The element is guaranteed to be cleared. Requires: ClearedCount() > 0

This method cannot be called when the repeated field is on an arena; doing so will trigger a GOOGLE_DCHECK-failure.

Removes the element referenced by position.

Returns an iterator to the element immediately following the removed element.

Invalidates all iterators at or after the removed element, including end().

Removes the elements in the range [first, last).

Returns an iterator to the element immediately following the removed range.

Invalidates all iterators at or after the removed range, including end().

For internal use only.

This is public due to it being called by generated code.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4