| OLD | NEW | 
|     1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. |     1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | 
|     2 // Use of this source code is governed by a BSD-style license that can be |     2 // Use of this source code is governed by a BSD-style license that can be | 
|     3 // found in the LICENSE file. |     3 // found in the LICENSE file. | 
|     4  |     4  | 
|     5 // This file automatically generated by testing/generate_gmock_mutant.py. |     5 // This file automatically generated by testing/generate_gmock_mutant.py. | 
|     6 // DO NOT EDIT. |     6 // DO NOT EDIT. | 
|     7  |     7  | 
|     8 #ifndef TESTING_GMOCK_MUTANT_H_ |     8 #ifndef TESTING_GMOCK_MUTANT_H_ | 
|     9 #define TESTING_GMOCK_MUTANT_H_ |     9 #define TESTING_GMOCK_MUTANT_H_ | 
|    10  |    10  | 
| (...skipping 30 matching lines...) Expand all  Loading... | 
|    41 //     string result = SStringPrintf("In request of %d %s ", n, request); |    41 //     string result = SStringPrintf("In request of %d %s ", n, request); | 
|    42 //     for (int i = 0; i < n; ++i) result.append(reply) |    42 //     for (int i = 0; i < n; ++i) result.append(reply) | 
|    43 //     return result; |    43 //     return result; | 
|    44 //   } |    44 //   } | 
|    45 // |    45 // | 
|    46 //   void DoLogMessage(int level, const string& message) { |    46 //   void DoLogMessage(int level, const string& message) { | 
|    47 //   } |    47 //   } | 
|    48 // |    48 // | 
|    49 //   void QuitMessageLoop(int seconds) { |    49 //   void QuitMessageLoop(int seconds) { | 
|    50 //     MessageLoop* loop = MessageLoop::current(); |    50 //     MessageLoop* loop = MessageLoop::current(); | 
|    51 //     loop->PostDelayedTask(FROM_HERE, new MessageLoop::QuitTask, |    51 //     loop->PostDelayedTask(FROM_HERE, MessageLoop::QuitClosure(), | 
|    52 //                           1000 * seconds); |    52 //                           1000 * seconds); | 
|    53 //   } |    53 //   } | 
|    54 // }; |    54 // }; | 
|    55 // |    55 // | 
|    56 // Mock mock; |    56 // Mock mock; | 
|    57 // // Will invoke mock.HandleFlowers("orchids", n, request) |    57 // // Will invoke mock.HandleFlowers("orchids", n, request) | 
|    58 // // "orchids" is a pre-bound argument, and <n> and <request> are call-time |    58 // // "orchids" is a pre-bound argument, and <n> and <request> are call-time | 
|    59 // // arguments - they are not known until the OnRequest mock is invoked. |    59 // // arguments - they are not known until the OnRequest mock is invoked. | 
|    60 // EXPECT_CALL(mock, OnRequest(Ge(5), StartsWith("flower")) |    60 // EXPECT_CALL(mock, OnRequest(Ge(5), StartsWith("flower")) | 
|    61 //   .Times(1) |    61 //   .Times(1) | 
| (...skipping 4924 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  4986                                Tuple6<P1, P2, P3, P4, P5, P6>, Tuple6<A1, A2, A3
      , A4, A5, A6> > |  4986                                Tuple6<P1, P2, P3, P4, P5, P6>, Tuple6<A1, A2, A3
      , A4, A5, A6> > | 
|  4987           (obj, method, MakeTuple(p1, p2, p3, p4, p5, p6)); |  4987           (obj, method, MakeTuple(p1, p2, p3, p4, p5, p6)); | 
|  4988   return MutantFunctor<R, Tuple6<A1, A2, A3, A4, A5, A6> >(t); |  4988   return MutantFunctor<R, Tuple6<A1, A2, A3, A4, A5, A6> >(t); | 
|  4989 } |  4989 } | 
|  4990 #endif  // GMOCK_MUTANT_INCLUDE_LATE_OBJECT_BINDING |  4990 #endif  // GMOCK_MUTANT_INCLUDE_LATE_OBJECT_BINDING | 
|  4991 #endif  // OS_WIN |  4991 #endif  // OS_WIN | 
|  4992  |  4992  | 
|  4993 }  // namespace testing |  4993 }  // namespace testing | 
|  4994  |  4994  | 
|  4995 #endif  // TESTING_GMOCK_MUTANT_H_ |  4995 #endif  // TESTING_GMOCK_MUTANT_H_ | 
| OLD | NEW |