is Google's (unit) testing and mocking framework for C++ tests.
| sample3-inl.h (googletest-release-1.10.0) | : | sample3-inl.h (googletest-release-1.11.0) |
|---|
| | |
| skipping to change at line 32 | | skipping to change at line 32 |
|---|
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| | |
| // A sample program demonstrating using Google C++ testing framework. | | // A sample program demonstrating using Google C++ testing framework. |
| | |
|
| #ifndef GTEST_SAMPLES_SAMPLE3_INL_H_ | | #ifndef GOOGLETEST_SAMPLES_SAMPLE3_INL_H_ |
| #define GTEST_SAMPLES_SAMPLE3_INL_H_ | | #define GOOGLETEST_SAMPLES_SAMPLE3_INL_H_ |
| | |
| #include <stddef.h> | | #include <stddef.h> |
| | |
| // Queue is a simple queue implemented as a singled-linked list. | | // Queue is a simple queue implemented as a singled-linked list. |
| // | | // |
| // The element type must support copy constructor. | | // The element type must support copy constructor. |
| template <typename E> // E is the element type | | template <typename E> // E is the element type |
| class Queue; | | class Queue; |
| | |
| // QueueNode is a node in a Queue, which consists of an element of | | // QueueNode is a node in a Queue, which consists of an element of |
| | |
| skipping to change at line 171 | | skipping to change at line 171 |
|---|
| private: | | private: |
| QueueNode<E>* head_; // The first node of the queue. | | QueueNode<E>* head_; // The first node of the queue. |
| QueueNode<E>* last_; // The last node of the queue. | | QueueNode<E>* last_; // The last node of the queue. |
| size_t size_; // The number of elements in the queue. | | size_t size_; // The number of elements in the queue. |
| | |
| // We disallow copying a queue. | | // We disallow copying a queue. |
| Queue(const Queue&); | | Queue(const Queue&); |
| const Queue& operator = (const Queue&); | | const Queue& operator = (const Queue&); |
| }; | | }; |
| | |
|
| #endif // GTEST_SAMPLES_SAMPLE3_INL_H_ | | #endif // GOOGLETEST_SAMPLES_SAMPLE3_INL_H_ |
| | | |
| End of changes. 2 change blocks. |
|---|
| 2 lines changed or deleted | | 2 lines changed or added |
|---|
"Fossies" - the Fresh Open Source Software Archive 