Advertisement
Guest User

Untitled

a guest
Oct 22nd, 2014
144
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.44 KB | None | 0 0
  1.  
  2. #include "stdafx.h"
  3. #include "..\CircleLib\Circle.h"
  4. #include "gtest\gtest.h"
  5. #include <cerrno>
  6.  
  7.  
  8.  
  9. TEST(test, 1)
  10. {
  11. int m[] = { 0, 1, 2, 3 };
  12. linia a(4), b;
  13. b = a;
  14. for (int i = 0; i < 4; ++i)
  15. {
  16. EXPECT_EQ(m[i], b.getmas(i));
  17. }
  18. }
  19.  
  20. TEST(test, 2)
  21. {
  22. int m[] = { 1, 2, 3, 4 };
  23. linia a(4, m), b;
  24. b = a;
  25. for (int i = 0; i < 4; ++i)
  26. {
  27. EXPECT_EQ(m[i], b.getmas(i));
  28. }
  29. }
  30.  
  31.  
  32. TEST(test,3)
  33. {
  34. int t[] = { 3, 4, 5, 6, 1, 2 };
  35. int m[] = { 1, 2, 3, 4 };
  36. int n[] = { 3, 4, 5, 6 };
  37. int k[6];
  38. linia a(4, m), b(4,n), c(4,k);
  39. c = b + a;
  40. for (int i = 0; i < 6; ++i)
  41. {
  42. EXPECT_EQ(t[i], c.getmas(i));
  43. }
  44. }
  45.  
  46. TEST(test,4)
  47. {
  48. int t[] = { 3, 4 };
  49. int m[] = { 1, 2, 3, 4 };
  50. int n[] = { 3, 4, 5, 6 };
  51. int k[2];
  52. linia a(4, m), b(4, n), c(4, k);
  53. c = b * a;
  54. for (int i = 0; i < 2; ++i)
  55. {
  56. EXPECT_EQ(t[i], c.getmas(i));
  57. }
  58. }
  59.  
  60. TEST(test, 5)
  61. {
  62. int t[] = { 5, 6 };
  63. int m[] = { 1, 2, 3, 4 };
  64. int n[] = { 3, 4, 5, 6 };
  65. int k[2];
  66. linia a(4, m), b(4, n), c(4, k);
  67. c = b - a;
  68. for (int i = 0; i < 2; ++i)
  69. {
  70. EXPECT_EQ(t[i], c.getmas(i));
  71. }
  72. }
  73.  
  74. TEST(test, 6)
  75. {
  76. int t[] = { 1, 2, 3 };
  77. int m[] = { 1, 2 };
  78. int n = 3;
  79. int k[3];
  80. linia a(2, m), c(3, k);
  81. c = a += n;
  82. for (int i = 0; i < 3; ++i)
  83. {
  84. EXPECT_EQ(t[i], c.getmas(i));
  85. }
  86. }
  87.  
  88.  
  89. int _tmain(int argc, _TCHAR* argv[])
  90. {
  91. ::testing::InitGoogleTest(&argc, argv);
  92. double a= RUN_ALL_TESTS();
  93. cout << a;
  94. cin >> a;
  95. return 1;
  96. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement