m->size = 0;
}
-/* copy constructor t <- s */
+/* copy constructor target <- source */
void
-map_init_clone(Map *t, Map *s)
+map_init_clone(Map *target, const Map *source)
{
- t->size = s->size;
- if (s->size)
+ target->size = source->size;
+ if (source->size)
{
- t->map = solv_malloc(s->size);
- memcpy(t->map, s->map, s->size);
+ target->map = solv_malloc(source->size);
+ memcpy(target->map, source->map, source->size);
}
else
- t->map = 0;
+ target->map = 0;
}
/* grow a map */
/* bitwise-ands maps t and s, stores the result in t. */
void
-map_and(Map *t, Map *s)
+map_and(Map *t, const Map *s)
{
unsigned char *ti, *si, *end;
ti = t->map;
/* bitwise-ors maps t and s, stores the result in t. */
void
-map_or(Map *t, Map *s)
+map_or(Map *t, const Map *s)
{
unsigned char *ti, *si, *end;
if (t->size < s->size)
/* remove all set bits in s from t. */
void
-map_subtract(Map *t, Map *s)
+map_subtract(Map *t, const Map *s)
{
unsigned char *ti, *si, *end;
ti = t->map;
#define MAPCLR_AT(m, n) ((m)->map[(n) >> 3] = 0)
extern void map_init(Map *m, int n);
-extern void map_init_clone(Map *t, Map *s);
+extern void map_init_clone(Map *target, const Map *source);
extern void map_grow(Map *m, int n);
extern void map_free(Map *m);
-extern void map_and(Map *t, Map *s);
-extern void map_or(Map *t, Map *s);
-extern void map_subtract(Map *t, Map *s);
+extern void map_and(Map *t, const Map *s);
+extern void map_or(Map *t, const Map *s);
+extern void map_subtract(Map *t, const Map *s);
extern void map_invertall(Map *m);
static inline void map_empty(Map *m)
}
void
-queue_init_clone(Queue *t, Queue *s)
+queue_init_clone(Queue *target, const Queue *source)
{
int extra_space;
- if (!s->elements)
+ if (!source->elements)
{
- t->alloc = t->elements = 0;
- t->count = t->left = 0;
+ target->alloc = target->elements = 0;
+ target->count = target->left = 0;
return;
}
- extra_space = queue_extra_space(s->count);
- t->alloc = t->elements = solv_malloc2(s->count + extra_space, sizeof(Id));
- if (s->count)
- memcpy(t->alloc, s->elements, s->count * sizeof(Id));
- t->count = s->count;
- t->left = extra_space;
+ extra_space = queue_extra_space(source->count);
+ target->alloc = target->elements = solv_malloc2(source->count + extra_space, sizeof(Id));
+ if (source->count)
+ memcpy(target->alloc, source->elements, source->count * sizeof(Id));
+ target->count = source->count;
+ target->left = extra_space;
}
void
}
void
-queue_insertn(Queue *q, int pos, int n, Id *elements)
+queue_insertn(Queue *q, int pos, int n, const Id *elements)
{
if (n <= 0)
return;
extern void queue_init(Queue *q);
extern void queue_init_buffer(Queue *q, Id *buf, int size);
-extern void queue_init_clone(Queue *t, Queue *s);
+extern void queue_init_clone(Queue *target, const Queue *source);
extern void queue_free(Queue *q);
extern void queue_insert(Queue *q, int pos, Id id);
extern void queue_insert2(Queue *q, int pos, Id id1, Id id2);
-extern void queue_insertn(Queue *q, int pos, int n, Id *elements);
+extern void queue_insertn(Queue *q, int pos, int n, const Id *elements);
extern void queue_delete(Queue *q, int pos);
extern void queue_delete2(Queue *q, int pos);
extern void queue_deleten(Queue *q, int pos, int n);