wslay_queue_test.c 2.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
  1. /*
  2. * Wslay - The WebSocket Library
  3. *
  4. * Copyright (c) 2011, 2012 Tatsuhiro Tsujikawa
  5. *
  6. * Permission is hereby granted, free of charge, to any person obtaining
  7. * a copy of this software and associated documentation files (the
  8. * "Software"), to deal in the Software without restriction, including
  9. * without limitation the rights to use, copy, modify, merge, publish,
  10. * distribute, sublicense, and/or sell copies of the Software, and to
  11. * permit persons to whom the Software is furnished to do so, subject to
  12. * the following conditions:
  13. *
  14. * The above copyright notice and this permission notice shall be
  15. * included in all copies or substantial portions of the Software.
  16. *
  17. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  18. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  19. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  20. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
  21. * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
  22. * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
  23. * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  24. */
  25. #include "wslay_queue_test.h"
  26. #include <CUnit/CUnit.h>
  27. #include "wslay_queue.h"
  28. void test_wslay_queue(void)
  29. {
  30. int ints[] = { 1, 2, 3, 4, 5 };
  31. int i;
  32. struct wslay_queue *queue = wslay_queue_new();
  33. CU_ASSERT(wslay_queue_empty(queue));
  34. for(i = 0; i < 5; ++i) {
  35. wslay_queue_push(queue, &ints[i]);
  36. CU_ASSERT_EQUAL(ints[0], *(int*)(wslay_queue_top(queue)));
  37. CU_ASSERT(!wslay_queue_empty(queue));
  38. }
  39. for(i = 0; i < 5; ++i) {
  40. CU_ASSERT_EQUAL(ints[i], *(int*)(wslay_queue_top(queue)));
  41. wslay_queue_pop(queue);
  42. }
  43. CU_ASSERT(wslay_queue_empty(queue));
  44. for(i = 0; i < 5; ++i) {
  45. wslay_queue_push_front(queue, &ints[i]);
  46. CU_ASSERT_EQUAL(ints[i], *(int*)(wslay_queue_top(queue)));
  47. CU_ASSERT(!wslay_queue_empty(queue));
  48. }
  49. for(i = 4; i >= 0; --i) {
  50. CU_ASSERT_EQUAL(ints[i], *(int*)(wslay_queue_top(queue)));
  51. wslay_queue_pop(queue);
  52. }
  53. CU_ASSERT(wslay_queue_empty(queue));
  54. wslay_queue_free(queue);
  55. }