[[["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\u003eSimpleRevFIFO\u003c/code\u003e is a class in C++ potentially used for managing data in a first-in, last-out (FIFO) manner, but with reversed iteration capabilities.\u003c/p\u003e\n"],["\u003cp\u003eThe primary method associated with this class is \u003ccode\u003eIterator\u003c/code\u003e, which takes a \u003ccode\u003eSimpleRevFIFO\u003c/code\u003e object as input and returns an iterator for traversing its elements.\u003c/p\u003e\n"]]],["The C++ documentation outlines a class named `SimpleRevFIFO`. It describes a method, `Iterator`, which returns an iterator. This method is explicitly defined and accepts a constant pointer to a `SimpleRevFIFO` object (`const SimpleRevFIFO\u003cT\u003e* l`) as its argument. The information indicates the location of the method's declaration in the source code.\n"],null,["# SimpleRevFIFO\n\nC++ Reference: class SimpleRevFIFO\n==================================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|----------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------|\n| [`Iterator`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L150) | Return type: `explicit ` Arguments: `const SimpleRevFIFO\u003cT\u003e* l` \u003cbr /\u003e |"]]