SAvl_impl.h 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
  1. /**
  2. * @file SAvl_impl.h
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. Neither the name of the author nor the
  15. * names of its contributors may be used to endorse or promote products
  16. * derived from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  20. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  21. * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  22. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  23. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  24. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  25. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  27. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. */
  29. #include "SAvl_header.h"
  30. #include "SAvl_tree.h"
  31. #include <structure/CAvl_impl.h>
  32. static void SAvl_Init (SAvl *o)
  33. {
  34. SAvl__Tree_Init(&o->tree);
  35. }
  36. static int SAvl_Insert (SAvl *o, SAvlArg arg, SAvlEntry *entry, SAvlEntry **out_existing)
  37. {
  38. ASSERT(entry)
  39. #if SAVL_PARAM_FEATURE_COUNTS
  40. ASSERT(SAvl_Count(o, arg) < SAVL_PARAM_VALUE_COUNT_MAX)
  41. #endif
  42. SAvl__TreeRef out_ref;
  43. int res = SAvl__Tree_Insert(&o->tree, arg, SAvl__TreeDeref(arg, entry), &out_ref);
  44. if (out_existing) {
  45. *out_existing = out_ref.link;
  46. }
  47. return res;
  48. }
  49. static void SAvl_Remove (SAvl *o, SAvlArg arg, SAvlEntry *entry)
  50. {
  51. ASSERT(entry)
  52. SAvl__Tree_Remove(&o->tree, arg, SAvl__TreeDeref(arg, entry));
  53. }
  54. #if !SAVL_PARAM_FEATURE_NOKEYS
  55. static SAvlEntry * SAvl_Lookup (const SAvl *o, SAvlArg arg, SAvlKey key)
  56. {
  57. SAvl__TreeRef ref = SAvl__Tree_Lookup(&o->tree, arg, key);
  58. return ref.link;
  59. }
  60. static SAvlEntry * SAvl_LookupExact (const SAvl *o, SAvlArg arg, SAvlKey key)
  61. {
  62. SAvl__TreeRef ref = SAvl__Tree_LookupExact(&o->tree, arg, key);
  63. return ref.link;
  64. }
  65. #endif
  66. static SAvlEntry * SAvl_GetFirst (const SAvl *o, SAvlArg arg)
  67. {
  68. SAvl__TreeRef ref = SAvl__Tree_GetFirst(&o->tree, arg);
  69. return ref.link;
  70. }
  71. static SAvlEntry * SAvl_GetLast (const SAvl *o, SAvlArg arg)
  72. {
  73. SAvl__TreeRef ref = SAvl__Tree_GetLast(&o->tree, arg);
  74. return ref.link;
  75. }
  76. static SAvlEntry * SAvl_GetNext (const SAvl *o, SAvlArg arg, SAvlEntry *entry)
  77. {
  78. ASSERT(entry)
  79. SAvl__TreeRef ref = SAvl__Tree_GetNext(&o->tree, arg, SAvl__TreeDeref(arg, entry));
  80. return ref.link;
  81. }
  82. static SAvlEntry * SAvl_GetPrev (const SAvl *o, SAvlArg arg, SAvlEntry *entry)
  83. {
  84. ASSERT(entry)
  85. SAvl__TreeRef ref = SAvl__Tree_GetPrev(&o->tree, arg, SAvl__TreeDeref(arg, entry));
  86. return ref.link;
  87. }
  88. static int SAvl_IsEmpty (const SAvl *o)
  89. {
  90. return SAvl__Tree_IsEmpty(&o->tree);
  91. }
  92. static void SAvl_Verify (const SAvl *o, SAvlArg arg)
  93. {
  94. return SAvl__Tree_Verify(&o->tree, arg);
  95. }
  96. #if SAVL_PARAM_FEATURE_COUNTS
  97. static SAvlCount SAvl_Count (const SAvl *o, SAvlArg arg)
  98. {
  99. return SAvl__Tree_Count(&o->tree, arg);
  100. }
  101. static SAvlCount SAvl_IndexOf (const SAvl *o, SAvlArg arg, SAvlEntry *entry)
  102. {
  103. ASSERT(entry)
  104. return SAvl__Tree_IndexOf(&o->tree, arg, SAvl__TreeDeref(arg, entry));
  105. }
  106. static SAvlEntry * SAvl_GetAt (const SAvl *o, SAvlArg arg, SAvlCount index)
  107. {
  108. SAvl__TreeRef ref = SAvl__Tree_GetAt(&o->tree, arg, index);
  109. return ref.link;
  110. }
  111. #endif
  112. #include "SAvl_footer.h"