C++ Reference: class RevGrowingArray
Note: This documentation is automatically generated.
Method |
At | Return type: T Arguments: int64_t index |
RevGrowingArray | Return type: explicit Arguments: int64_t block_size |
~RevGrowingArray | |
RevInsert | Return type: void Arguments: Solver* const solver, int64_t index, T value |
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[[["`RevGrowingArray` is a class in C++ that provides a dynamically resizable array, growing in reverse order."],["It allows access to elements using the `At` method and insertion using the `RevInsert` method."],["The array is initialized with a specified `block_size`, determining the memory allocation increment."],["A destructor, `~RevGrowingArray`, is provided for cleanup."]]],["The `RevGrowingArray` class in C++ provides methods for managing a dynamically growing array. `RevGrowingArray` constructs the array with a specified `block_size`. The `At` method accesses an element at a given `index`, returning its value. `RevInsert` inserts a `value` at a specific `index` using the provided `solver`. The `~RevGrowingArray` is the destructor, which handles object cleanup. These actions allows dynamic manipulation of array content.\n"]]