3 #ifndef AWKWARD_LISTARRAY_H_ 4 #define AWKWARD_LISTARRAY_H_ 41 tojson_part(
ToJson& builder,
bool verbose)
const override;
44 shallow_copy()
const override;
47 with_form_key(
const FormKey& form_key)
const override;
50 purelist_parameter(
const std::string&
key)
const override;
53 purelist_isregular()
const override;
56 purelist_depth()
const override;
59 dimension_optiontype()
const override;
61 const std::pair<int64_t, int64_t>
62 minmax_depth()
const override;
64 const std::pair<bool, int64_t>
65 branch_depth()
const override;
68 numfields()
const override;
71 fieldindex(
const std::string& key)
const override;
74 key(int64_t fieldindex)
const override;
77 haskey(
const std::string& key)
const override;
79 const std::vector<std::string>
80 keys()
const override;
83 istuple()
const override;
87 bool check_identities,
88 bool check_parameters,
90 bool compatibility_check)
const override;
93 getitem_field(
const std::string& key)
const override;
96 getitem_fields(
const std::vector<std::string>& keys)
const override;
113 template <
typename T>
115 #ifdef AWKWARD_LISTARRAY_NO_EXTERN_TEMPLATE 183 compact_offsets64(
bool start_at_zero)
const;
195 broadcast_tooffsets64(
const Index64& offsets)
const;
205 toRegularArray()
const;
220 toListOffsetArray64(
bool start_at_zero)
const;
225 classname()
const override;
228 setidentities()
override;
237 form(
bool materialize)
const override;
240 kernels()
const override;
243 caches(std::vector<ArrayCachePtr>& out)
const override;
246 tostring_part(
const std::string& indent,
247 const std::string& pre,
248 const std::string& post)
const override;
251 tojson_part(
ToJson& builder,
bool include_beginendlist)
const override;
254 nbytes_part(std::map<size_t, int64_t>& largest)
const override;
260 length()
const override;
263 shallow_copy()
const override;
266 deep_copy(
bool copyarrays,
268 bool copyidentities)
const override;
271 check_for_iteration()
const override;
274 getitem_nothing()
const override;
277 getitem_at(int64_t at)
const override;
280 getitem_at_nowrap(int64_t at)
const override;
283 getitem_range(int64_t start, int64_t stop)
const override;
286 getitem_range_nowrap(int64_t start, int64_t stop)
const override;
289 getitem_field(
const std::string&
key)
const override;
292 getitem_field(
const std::string& key,
293 const Slice& only_fields)
const override;
296 getitem_fields(
const std::vector<std::string>&
keys)
const override;
299 getitem_fields(
const std::vector<std::string>& keys,
300 const Slice& only_fields)
const override;
303 carry(
const Index64& carry,
bool allow_lazy)
const override;
306 purelist_depth()
const override;
308 const std::pair<int64_t, int64_t>
309 minmax_depth()
const override;
311 const std::pair<bool, int64_t>
312 branch_depth()
const override;
315 numfields()
const override;
318 fieldindex(
const std::string& key)
const override;
321 key(int64_t fieldindex)
const override;
324 haskey(
const std::string& key)
const override;
326 const std::vector<std::string>
327 keys()
const override;
330 istuple()
const override;
334 validityerror(
const std::string& path)
const override;
341 shallow_simplify()
const override;
344 num(int64_t axis, int64_t depth)
const override;
346 const std::pair<Index64, ContentPtr>
347 offsets_and_flattened(int64_t axis, int64_t depth)
const override;
350 mergeable(
const ContentPtr& other,
bool mergebool)
const override;
353 referentially_equal(
const ContentPtr& other)
const override;
359 asslice()
const override;
365 rpad(int64_t target, int64_t axis, int64_t depth)
const override;
368 rpad_and_clip(int64_t target,
370 int64_t depth)
const override;
373 reduce_next(
const Reducer& reducer,
380 bool keepdims)
const override;
383 sort_next(int64_t negaxis,
388 bool stable)
const override;
391 argsort_next(int64_t negaxis,
397 bool stable)
const override;
400 localindex(int64_t axis, int64_t depth)
const override;
408 int64_t depth)
const override;
411 getitem_next(
const SliceAt& at,
413 const Index64& advanced)
const override;
418 const Index64& advanced)
const override;
423 const Index64& advanced)
const override;
428 const Index64& advanced)
const override;
431 getitem_next_jagged(
const Index64& slicestarts,
434 const Slice& tail)
const override;
437 getitem_next_jagged(
const Index64& slicestarts,
440 const Slice& tail)
const override;
443 getitem_next_jagged(
const Index64& slicestarts,
446 const Slice& tail)
const override;
452 numbers_to_type(
const std::string&
name)
const override;
456 is_unique()
const override;
464 is_subrange_equal(
const Index64& start,
const Index64& stop)
const override;
475 #ifndef AWKWARD_LISTARRAY_NO_EXTERN_TEMPLATE 486 #endif // AWKWARD_LISTARRAY_H_ Represents a Python slice object (usual syntax: array[start:stop:step]).
Definition: Slice.h:93
#define LIBAWKWARD_EXPORT_SYMBOL
Definition: common.h:45
Represents an array of nested lists that can have different lengths using two indexes named starts an...
Definition: ListArray.h:114
const std::string key(const RecordLookupPtr &recordlookup, int64_t fieldindex, int64_t numfields)
Returns the key associated with a field index, given a RecordLookup and a number of fields...
Abstract superclass of all array node types (flat hierarchy). Any Content can be nested within any ot...
Definition: Content.h:276
Definition: BitMaskedArray.h:15
A contiguous, one-dimensional array of integers used to represent data structures, rather than numerical data in the arrays themselves.
Definition: Index.h:16
std::string name(Mapping a, V value)
Definition: datetime_util.h:39
Represents a SliceArrayOf, SliceMissingOf, or SliceJaggedOf with missing values: None (no equivalent ...
Definition: Slice.h:431
Abstract class for all reducer algorithms.
Definition: Reducer.h:20
ERROR combinations(kernel::lib ptr_lib, T *toindex, int64_t n, bool replacement, int64_t singlelen)
const std::vector< std::string > keys(const RecordLookupPtr &recordlookup, int64_t numfields)
Returns a given RecordLookup as keys or generate anonymous ones form a number of fields.
Form
Integer type of an Index, used by ListForm, IndexedForm, etc.
Definition: Index.h:34
std::shared_ptr< std::string > FormKey
Definition: Content.h:19
ERROR unique(kernel::lib ptr_lib, T *toptr, int64_t length, int64_t *tolength)
Represents an array of integers in a slice (possibly converted from an array of booleans).
Definition: Slice.h:225
std::map< std::string, std::string > Parameters
Definition: util.h:165
ERROR copy_to(kernel::lib to_lib, kernel::lib from_lib, void *to_ptr, void *from_ptr, int64_t bytelength)
Internal Function an array buffer from library FROM to library TO, usually between main memory and a ...
std::shared_ptr< Form > FormPtr
Definition: Content.h:18
int64_t fieldindex(const RecordLookupPtr &recordlookup, const std::string &key, int64_t numfields)
Returns the field index associated with a key, given a RecordLookup and a number of fields...
Represents an array of nested lists, where the content may be SliceArrayOf, SliceMissingOf, or SliceJaggedOf (no equivalent in NumPy).
Definition: Slice.h:511
std::vector< std::shared_ptr< Content > > ContentPtrVec
Definition: Content.h:16
Mapping::value_type::value_type value(Mapping a, const std::string &name)
Definition: datetime_util.h:49
A sequence of SliceItem objects representing a tuple passed to Python's __getitem__.
Definition: Slice.h:585
bool haskey(const RecordLookupPtr &recordlookup, const std::string &key, int64_t numfields)
Returns true if a RecordLookup has a given key; false otherwise.
std::shared_ptr< Type > TypePtr
Definition: Content.h:23
std::shared_ptr< RecordLookup > RecordLookupPtr
Definition: util.h:130
Represents an integer in a tuple of slices passed to __getitem__ in Python.
Definition: Slice.h:58
std::map< std::string, std::string > TypeStrs
Definition: util.h:215
std::shared_ptr< Identities > IdentitiesPtr
Definition: Identities.h:16
std::shared_ptr< Content > ContentPtr
Definition: ArrayBuilder.h:16
std::shared_ptr< SliceItem > SliceItemPtr
Definition: Slice.h:15
lib
Definition: kernel-dispatch.h:20