summaryrefslogtreecommitdiff
path: root/Build/source/texk/lcdf-typetools/lcdf-typetools-2.98/liblcdf/vectorv.cc
blob: f5f12b52c906b01f143f7d581068d59e3a48d1a7 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
/*
 * vectorv.cc -- template specialization for Vector<void*>
 * Eddie Kohler
 *
 * Copyright (c) 1999-2006 Massachusetts Institute of Technology
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, subject to the conditions
 * listed in the Click LICENSE file. These conditions include: you must
 * preserve this copyright notice, and you cannot mention the copyright
 * holders in advertising related to the Software without their permission.
 * The Software is provided WITHOUT ANY WARRANTY, EXPRESS OR IMPLIED. This
 * notice is a summary of the Click LICENSE file; the license in that file is
 * legally binding.
 */

#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <lcdf/vector.hh>
#include <string.h>

Vector<void*>::Vector(const Vector<void*> &o)
    : _l(0), _n(0), _capacity(0)
{
    *this = o;
}

Vector<void*>::~Vector()
{
    delete[] _l;
}

Vector<void*> &
Vector<void*>::operator=(const Vector<void*> &o)
{
    if (&o != this) {
	_n = 0;
	if (reserve(o._n)) {
	    _n = o._n;
	    memcpy(_l, o._l, sizeof(void *) * _n);
	}
    }
    return *this;
}

Vector<void*> &
Vector<void*>::assign(int n, void *e)
{
    _n = 0;
    resize(n, e);
    return *this;
}

bool
Vector<void*>::reserve(int want)
{
    if (want < 0)
	want = (_capacity > 0 ? _capacity * 2 : 4);
    if (want <= _capacity)
	return true;

    void **new_l = new void*[want];
    if (!new_l)
	return false;

    memcpy(new_l, _l, sizeof(void*) * _n);
    delete[] _l;

    _l = new_l;
    _capacity = want;
    return true;
}

Vector<void*>::iterator
Vector<void*>::erase(iterator a, iterator b)
{
    if (b > a) {
	assert(a >= begin() && b <= end());
	memmove(a, b, (end() - b) * sizeof(void*));
	_n -= b - a;
	return a;
    } else
	return b;
}

void
Vector<void*>::resize(int nn, void *e)
{
    if (nn <= _capacity || reserve(nn)) {
	for (int i = _n; i < nn; i++)
	    _l[i] = e;
	_n = nn;
    }
}

void
Vector<void*>::swap(Vector<void*>& o)
{
    void **l = _l;
    int n = _n;
    int cap = _capacity;
    _l = o._l;
    _n = o._n;
    _capacity = o._capacity;
    o._l = l;
    o._n = n;
    o._capacity = cap;
}