include/gmock/gmock-matchers.h

725 template <size_t N>
834   template <typename Tup, size_t kRemainingSize>
1111   const size_t i1 = s1.find(nul), i2 = s2.find(nul);
2752       const size_t actual_size = lhs_stl_container.size();
2760       for (size_t i = 0; i != actual_size; ++i, ++left, ++right) {
2820     size_t i = 0;
3134       for (size_t i = 0; i != count(); ++i) {
3152     for (size_t i = 0; i != count(); ++i) {
3172     size_t exam_pos = 0;
3198     size_t actual_count = exam_pos;
3227       for (size_t i = 0; i != count(); ++i) {
3242   static Message Elements(size_t count) {
3246   size_t count() const { return matchers_.size(); }
3259   MatchMatrix(size_t num_elements, size_t num_matchers)
3265   size_t LhsSize() const { return num_elements_; }
3266   size_t RhsSize() const { return num_matchers_; }
3267   bool HasEdge(size_t ilhs, size_t irhs) const {
3270   void SetEdge(size_t ilhs, size_t irhs, bool b) {
3284   size_t SpaceIndex(size_t ilhs, size_t irhs) const {
3288   size_t num_elements_;
3289   size_t num_matchers_;
3297 typedef ::std::pair<size_t, size_t> ElementMatcherPair;
3333   static Message Elements(size_t n) {
3385     const size_t actual_count = matrix.LhsSize();
3414     size_t num_elements = 0;
3419       for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3426     for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
3427       for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3653     const T* pointer, size_t count) {
3657 template <typename T, size_t N>
3695 UnorderedElementsAreArray(const T* pointer, size_t count) {
3699 template <typename T, size_t N>
4274 //   ::std::map<int, size_t> page_lengths;
4277 //               Contains(::std::pair<const int, size_t>(1, 100)));
4304 //   ::std::map<int, size_t> page_lengths;