3 MPDM - Minimum Profit Data Manager
4 Copyright (C) 2003/2010 Angel Ortega <angel@triptico.com>
6 mpdm_a.c - Array management
8 This program is free software; you can redistribute it and/or
9 modify it under the terms of the GNU General Public License
10 as published by the Free Software Foundation; either version 2
11 of the License, or (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
22 http://www.triptico.com
38 /* sorting callback code */
39 static mpdm_t sort_cb
= NULL
;
44 mpdm_t
mpdm_new_a(int flags
, int size
)
45 /* creates a new array value */
49 /* creates and expands */
50 if ((v
= mpdm_new(flags
| MPDM_MULTIPLE
, NULL
, 0)) != NULL
)
51 mpdm_expand(v
, 0, size
);
57 static int wrap_offset(const mpdm_t a
, int offset
)
58 /* manages negative offsets */
61 offset
= mpdm_size(a
) + offset
;
67 mpdm_t
mpdm_aclone(const mpdm_t v
)
68 /* clones a multiple value */
75 /* creates a similar value */
76 w
= mpdm_new_a(v
->flags
, v
->size
);
80 /* fills each element with duplicates of the original */
81 for (n
= 0; n
< w
->size
; n
++)
82 mpdm_aset(w
, mpdm_clone(mpdm_aget(v
, n
)), n
);
95 * mpdm_expand - Expands an array.
97 * @offset: insertion offset
98 * @num: number of elements to insert
100 * Expands an array value, inserting @num elements (initialized
101 * to NULL) at the specified @offset.
104 mpdm_t
mpdm_expand(mpdm_t a
, int offset
, int num
)
115 p
= (mpdm_t
*) realloc((mpdm_t
*)a
->data
, a
->size
* sizeof(mpdm_t
));
117 /* moves up from top of the array */
118 for (n
= a
->size
- 1; n
>= offset
+ num
; n
--)
121 /* fills the new space with blanks */
122 for (; n
>= offset
; n
--)
133 * mpdm_collapse - Collapses an array.
135 * @offset: deletion offset
136 * @num: number of elements to collapse
138 * Collapses an array value, deleting @num elements at
139 * the specified @offset.
142 mpdm_t
mpdm_collapse(mpdm_t a
, int offset
, int num
)
148 /* don't try to delete beyond the limit */
149 if (offset
+ num
> a
->size
)
150 num
= a
->size
- offset
;
152 p
= (mpdm_t
*) a
->data
;
154 /* unrefs the about-to-be-deleted elements */
155 for (n
= offset
; n
< offset
+ num
; n
++)
158 /* array is now shorter */
161 /* moves down the elements */
162 for (n
= offset
; n
< a
->size
; n
++)
165 /* finally shrinks the memory block */
166 a
->data
= realloc(p
, a
->size
* sizeof(mpdm_t
));
174 * mpdm_aset - Sets the value of an array's element.
176 * @e: the element to be assigned
177 * @offset: the subscript of the element
179 * Sets the element of the array @a at @offset to be the @e value.
180 * Returns the new element (versions prior to 1.0.10 returned the
184 mpdm_t
mpdm_aset(mpdm_t a
, mpdm_t e
, int offset
)
191 offset
= wrap_offset(a
, offset
);
194 /* if the array is shorter than offset, expand to make room for it */
195 if (offset
>= mpdm_size(a
))
196 mpdm_expand(a
, mpdm_size(a
), offset
- mpdm_size(a
) + 1);
198 p
= (mpdm_t
*) a
->data
;
200 /* assigns and references */
202 mpdm_unref(p
[offset
]);
214 * mpdm_aget - Gets an element of an array.
216 * @offset: the subscript of the element
218 * Returns the element at @offset of the array @a.
221 mpdm_t
mpdm_aget(const mpdm_t a
, int offset
)
226 offset
= wrap_offset(a
, offset
);
228 /* boundary checks */
229 if (offset
>= 0 && offset
< mpdm_size(a
)) {
230 p
= (mpdm_t
*) a
->data
;
241 * mpdm_ins - Insert an element in an array.
243 * @e: the element to be inserted
244 * @offset: subscript where the element is going to be inserted
246 * Inserts the @e value in the @a array at @offset.
247 * Further elements are pushed up, so the array increases its size
248 * by one. Returns the inserted element.
251 mpdm_t
mpdm_ins(mpdm_t a
, mpdm_t e
, int offset
)
256 offset
= wrap_offset(a
, offset
);
258 /* open room and set value */
259 mpdm_expand(a
, offset
, 1);
260 mpdm_aset(a
, e
, offset
);
270 * mpdm_adel - Deletes an element of an array.
272 * @offset: subscript of the element to be deleted
274 * Deletes the element at @offset of the @a array. The array
275 * is shrinked by one. If @offset is negative, is counted from
276 * the end of the array (so a value of -1 means delete the
277 * last element of the array).
279 * Always returns NULL (version prior to 1.0.10 used to return
280 * the deleted element).
283 mpdm_t
mpdm_adel(mpdm_t a
, int offset
)
288 mpdm_collapse(a
, wrap_offset(a
, offset
), 1);
297 * mpdm_shift - Extracts the first element of an array.
300 * Extracts the first element of the array. The array
301 * is shrinked by one.
303 * Returns the element.
306 mpdm_t
mpdm_shift(mpdm_t a
)
312 r
= mpdm_ref(mpdm_aget(a
, 0));
323 * mpdm_push - Pushes a value into an array.
327 * Pushes a value into an array (i.e. inserts at the end).
330 mpdm_t
mpdm_push(mpdm_t a
, mpdm_t e
)
336 /* inserts at the end */
337 r
= mpdm_ins(a
, e
, mpdm_size(a
));
346 * mpdm_pop - Pops a value from an array.
349 * Pops a value from the array (i.e. deletes from the end
353 mpdm_t
mpdm_pop(mpdm_t a
)
359 r
= mpdm_ref(mpdm_aget(a
, -1));
370 * mpdm_queue - Implements a queue in an array.
372 * @e: the element to be pushed
373 * @size: maximum size of array
375 * Pushes the @e element into the @a array. If the array already has
376 * @size elements, the first (oldest) element is deleted from the
377 * queue and returned.
379 * Returns the deleted element, or NULL if the array doesn't have
380 * @size elements yet.
383 mpdm_t
mpdm_queue(mpdm_t a
, mpdm_t e
, int size
)
390 /* zero size is nonsense */
392 /* loop until a has the desired size */
393 while (mpdm_size(a
) > size
)
396 if (mpdm_size(a
) == size
)
409 static int seek(const mpdm_t a
, const mpdm_t k
, const wchar_t *ks
, int step
)
416 /* avoid stupid steps */
422 for (n
= 0; o
== -1 && n
< mpdm_size(a
); n
+= step
) {
425 mpdm_t v
= mpdm_aget(a
, n
);
427 r
= ks
? mpdm_cmp_s(v
, ks
) : mpdm_cmp(v
, k
);
441 * mpdm_seek - Seeks a value in an array (sequential).
444 * @step: number of elements to step
446 * Seeks sequentially the value @k in the @a array in
447 * increments of @step. A complete search should use a step of 1.
448 * Returns the offset of the element if found, or -1 otherwise.
451 int mpdm_seek(const mpdm_t a
, const mpdm_t k
, int step
)
453 return seek(a
, k
, NULL
, step
);
458 * mpdm_seek_s - Seeks a value in an array (sequential, string version).
461 * @step: number of elements to step
463 * Seeks sequentially the value @k in the @a array in
464 * increments of @step. A complete search should use a step of 1.
465 * Returns the offset of the element if found, or -1 otherwise.
468 int mpdm_seek_s(const mpdm_t a
, const wchar_t *k
, int step
)
470 return seek(a
, NULL
, k
, step
);
474 static int bseek(const mpdm_t a
, const mpdm_t k
, const wchar_t *ks
, int step
, int *pos
)
481 /* avoid stupid steps */
486 t
= (mpdm_size(a
) - 1) / step
;
490 while (o
== -1 && t
>= b
) {
494 if ((v
= mpdm_aget(a
, n
* step
)) == NULL
)
497 c
= ks
? mpdm_cmp_s(v
, ks
) : mpdm_cmp(v
, k
);
519 * mpdm_bseek - Seeks a value in an array (binary).
520 * @a: the ordered array
522 * @step: number of elements to step
523 * @pos: the position where the element should be, if it's not found
525 * Seeks the value @k in the @a array in increments of @step.
526 * The array should be sorted to work correctly. A complete search
527 * should use a step of 1.
529 * If the element is found, returns the offset of the element
530 * as a positive number; otherwise, -1 is returned and the position
531 * where the element should be is stored in @pos. You can set @pos
532 * to NULL if you don't mind.
535 int mpdm_bseek(const mpdm_t a
, const mpdm_t k
, int step
, int *pos
)
537 return bseek(a
, k
, NULL
, step
, pos
);
542 * mpdm_bseek_s - Seeks a value in an array (binary, string version).
543 * @a: the ordered array
545 * @step: number of elements to step
546 * @pos: the position where the element should be, if it's not found
548 * Seeks the value @k in the @a array in increments of @step.
549 * The array should be sorted to work correctly. A complete search
550 * should use a step of 1.
552 * If the element is found, returns the offset of the element
553 * as a positive number; otherwise, -1 is returned and the position
554 * where the element should be is stored in @pos. You can set @pos
555 * to NULL if you don't mind.
558 int mpdm_bseek_s(const mpdm_t a
, const wchar_t *k
, int step
, int *pos
)
560 return bseek(a
, NULL
, k
, step
, pos
);
564 static int sort_cmp(const void *s1
, const void *s2
)
565 /* qsort help function */
569 /* if callback is NULL, use basic value comparisons */
571 ret
= mpdm_cmp(*(mpdm_t
*) s1
, *(mpdm_t
*) s2
);
573 /* executes the callback and converts to integer */
574 ret
= mpdm_ival(mpdm_exec_2(sort_cb
,
575 (mpdm_t
) * ((mpdm_t
*) s1
),
576 (mpdm_t
) * ((mpdm_t
*) s2
))
585 * mpdm_sort - Sorts an array.
587 * @step: increment step
589 * Sorts the array. @step is the number of elements to group together.
591 * Returns the same array, sorted (versions prior to 1.0.10 returned
595 mpdm_t
mpdm_sort(const mpdm_t a
, int step
)
597 return mpdm_sort_cb(a
, step
, NULL
);
602 * mpdm_sort_cb - Sorts an array with a special sorting function.
604 * @step: increment step
605 * @asort_cb: sorting function
607 * Sorts the array. @step is the number of elements to group together.
608 * For each pair of elements being sorted, the executable mpdm_t value
609 * @sort_cb is called with an array containing the two elements as
610 * argument. It must return a signed numerical mpdm_t value indicating
613 * Returns the same array, sorted (versions prior to 1.0.10 returned
617 mpdm_t
mpdm_sort_cb(mpdm_t a
, int step
, mpdm_t cb
)
622 /* references the array and the code, as the latter
623 can include anything (including sweeping) */
627 qsort((mpdm_t
*)a
->data
, mpdm_size(a
) / step
, sizeof(mpdm_t
) * step
, sort_cmp
);
630 mpdm_unrefnd(sort_cb
);
641 * mpdm_split_s - Separates a string into an array of pieces (string version).
643 * @v: the value to be separated
645 * Separates the @v string value into an array of pieces, using @s
648 * If the separator is NULL, the string is splitted by characters.
650 * If the string does not contain the separator, an array holding
651 * the complete string is returned.
655 mpdm_t
mpdm_split_s(const wchar_t *s
, const mpdm_t v
)
666 /* NULL separator? special case: split string in characters */
668 for (ptr
= mpdm_string(v
); ptr
&& *ptr
!= '\0'; ptr
++)
669 mpdm_push(w
, MPDM_NS(ptr
, 1));
677 /* travels the string finding separators and creating new values */
679 *ptr
!= L
'\0' && (sptr
= wcsstr(ptr
, s
)) != NULL
;
681 mpdm_push(w
, MPDM_NS(ptr
, sptr
- ptr
));
684 mpdm_push(w
, MPDM_S(ptr
));
697 * mpdm_split - Separates a string into an array of pieces.
699 * @v: the value to be separated
701 * Separates the @v string value into an array of pieces, using @s
704 * If the separator is NULL, the string is splitted by characters.
706 * If the string does not contain the separator, an array holding
707 * the complete string is returned.
711 mpdm_t
mpdm_split(const mpdm_t s
, const mpdm_t v
)
719 ss
= (wchar_t *)s
->data
;
721 r
= mpdm_split_s(ss
, v
);
730 * mpdm_join_s - Joins all elements of an array into one (string version).
732 * @a: array to be joined
734 * Joins all elements from @a into one string, using @s as a glue.
738 mpdm_t
mpdm_join_s(const wchar_t *s
, const mpdm_t a
)
748 if (MPDM_IS_ARRAY(a
)) {
749 /* adds the first string */
750 ptr
= mpdm_pokev(ptr
, &l
, mpdm_aget(a
, 0));
752 ss
= s
? wcslen(s
) : 0;
754 for (n
= 1; n
< mpdm_size(a
); n
++) {
756 ptr
= mpdm_pokewsn(ptr
, &l
, s
, ss
);
759 ptr
= mpdm_pokev(ptr
, &l
, mpdm_aget(a
, n
));
762 ptr
= mpdm_poke(ptr
, &l
, L
"", 1, sizeof(wchar_t));
763 r
= MPDM_ENS(ptr
, l
- 1);
773 * mpdm_join - Joins all elements of an array into one.
775 * @a: array to be joined
777 * Joins all elements from @a into one string, using @s as a glue.
781 mpdm_t
mpdm_join(const mpdm_t s
, const mpdm_t a
)
786 r
= mpdm_join_s(s
? mpdm_string(s
) : NULL
, a
);