events.c 2.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596
  1. /*
  2. Copyright (C) 2014 Olivier Marty <olivier.marty.m at gmail.com>
  3. This program is free software; you can redistribute it and/or
  4. modify it under the terms of the GNU General Public License
  5. as published by the Free Software Foundation; either version 2
  6. of the License, or (at your option) any later version.
  7. This program is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. GNU General Public License for more details.
  11. You should have received a copy of the GNU General Public License
  12. along with this program; if not, write to the Free Software
  13. Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  14. */
  15. #include "rich_text.h"
  16. #include "time.h"
  17. #include "string.h"
  18. #include "events.h"
  19. #include <assert.h>
  20. #include <stdlib.h>
  21. t_events eventsInit(int initSize)
  22. {
  23. t_events events = {0,initSize,NULL};
  24. assert(initSize > 0);
  25. events.events = malloc(sizeof(t_event[initSize]));
  26. if(events.events == NULL)
  27. {
  28. perror("malloc()");
  29. exit(1);
  30. }
  31. return events;
  32. }
  33. int id_min(t_events events)
  34. {
  35. int min = 0, i;
  36. mytime tmin;
  37. if(events.size == 0)
  38. return -1;
  39. tmin = events.events[0].any.time;
  40. for(i = 1; i < events.size; i++)
  41. {
  42. if(timeDiff(events.events[i].any.time, tmin).tv_sec < 0)
  43. {
  44. min = i;
  45. tmin = events.events[i].any.time;
  46. }
  47. }
  48. return min;
  49. }
  50. // events must be non empty
  51. mytime eventsNextTime(t_events events)
  52. {
  53. int id = id_min(events);
  54. assert(id >= 0);
  55. return events.events[id].any.time;
  56. }
  57. // events must be non empty
  58. t_event eventsPop(t_events *events)
  59. {
  60. int id = id_min(*events);
  61. assert(id >= 0);
  62. t_event e = events->events[id];
  63. memmove(events->events+id, events->events+(id+1),
  64. sizeof(t_event[events->size-id-1]));
  65. events->size--;
  66. return e;
  67. }
  68. void eventsPush(t_events *events, t_event e)
  69. {
  70. if(events->size == events->maxsize)
  71. {
  72. events->maxsize *= 2;
  73. events->events = realloc(events->events, sizeof(t_event[events->maxsize]));
  74. if(events->events == NULL)
  75. {
  76. perror("realloc()");
  77. exit(1);
  78. }
  79. }
  80. events->events[events->size] = e;
  81. events->size++;
  82. }
  83. int eventsEmpty(t_events events)
  84. {
  85. return !events.size;
  86. }