2 * Copyright (c) 2003, 2004 Lev Walkin <vlm@lionet.info>. All rights reserved.
\r
3 * Redistribution and modifications are permitted subject to BSD license.
\r
5 #include <asn_internal.h>
\r
6 #include <asn_SEQUENCE_OF.h>
\r
8 typedef A_SEQUENCE_OF(void) asn_sequence;
\r
11 asn_sequence_del(void *asn_sequence_of_x, int number, int _do_free) {
\r
12 asn_sequence *as = (asn_sequence *)asn_sequence_of_x;
\r
18 if(number < 0 || number >= as->count)
\r
19 return; /* Nothing to delete */
\r
21 if(_do_free && as->free) {
\r
22 ptr = as->array[number];
\r
28 * Shift all elements to the left to hide the gap.
\r
31 for(n = number; n < as->count; n++)
\r
32 as->array[n] = as->array[n+1];
\r
35 * Invoke the third-party function only when the state
\r
36 * of the parent structure is consistent.
\r
38 if(ptr) as->free(ptr);
\r