[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003e\u003ccode\u003eRevGrowingArray\u003c/code\u003e is a class in C++ that provides a dynamically resizable array, growing in reverse order.\u003c/p\u003e\n"],["\u003cp\u003eIt allows access to elements using the \u003ccode\u003eAt\u003c/code\u003e method and insertion using the \u003ccode\u003eRevInsert\u003c/code\u003e method.\u003c/p\u003e\n"],["\u003cp\u003eThe array is initialized with a specified \u003ccode\u003eblock_size\u003c/code\u003e, determining the memory allocation increment.\u003c/p\u003e\n"],["\u003cp\u003eA destructor, \u003ccode\u003e~RevGrowingArray\u003c/code\u003e, is provided for cleanup.\u003c/p\u003e\n"]]],["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"],null,["# RevGrowingArray\n\nC++ Reference: class RevGrowingArray\n====================================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|-------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------|\n| [`At`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2497) | Return type: `T ` Arguments: `int64_t index` \u003cbr /\u003e |\n| [`RevGrowingArray`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2486) | Return type: `explicit ` Arguments: `int64_t block_size` \u003cbr /\u003e |\n| [`~RevGrowingArray`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2491) | \u003cbr /\u003e |\n| [`RevInsert`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2507) | Return type: `void ` Arguments: `Solver* const solver, int64_t index, T value` \u003cbr /\u003e |"]]
