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
111
|
%% -*- erlang-indent-level: 2 -*-
%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 2001-2009. All Rights Reserved.
%%
%% The contents of this file are subject to the Erlang Public License,
%% Version 1.1, (the "License"); you may not use this file except in
%% compliance with the License. You should have received a copy of the
%% Erlang Public License along with this software. If not, it can be
%% retrieved online at http://www.erlang.org/.
%%
%% Software distributed under the License is distributed on an "AS IS"
%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
%% the License for the specific language governing rights and limitations
%% under the License.
%%
%% %CopyrightEnd%
%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% VECTORS IN ERLANG
%%
%% Abstract interface to vectors, indexed from 0 to size-1.
-module(hipe_vectors).
-export([new/2,
set/3,
get/2,
size/1,
vector_to_list/1,
%% list_to_vector/1,
list/1]).
-include("hipe_vectors.hrl").
%% ---------------------------------------------------------------------
-ifdef(USE_TUPLES).
new(N, V) ->
erlang:make_tuple(N, V).
size(V) -> erlang:tuple_size(V).
list(Vec) ->
index(tuple_to_list(Vec), 0).
index([X|Xs],N) ->
[{N,X} | index(Xs,N+1)];
index([],_) ->
[].
%% list_to_vector(Xs) ->
%% list_to_tuple(Xs).
vector_to_list(V) ->
tuple_to_list(V).
set(Vec, Ix, V) ->
setelement(Ix+1, Vec, V).
get(Vec, Ix) -> element(Ix+1, Vec).
-endif. %% ifdef USE_TUPLES
%% ---------------------------------------------------------------------
-ifdef(USE_GBTREES).
-spec new(non_neg_integer(), _) -> hipe_vector().
new(N, V) when is_integer(N), N >= 0 ->
gb_trees:from_orddict(mklist(N, V)).
mklist(N, V) ->
mklist(0, N, V).
mklist(M, N, V) when M < N ->
[{M, V} | mklist(M+1, N, V)];
mklist(_, _, _) ->
[].
-spec size(hipe_vector()) -> non_neg_integer().
size(V) -> gb_trees:size(V).
-spec list(hipe_vector()) -> [{_, _}].
list(Vec) ->
gb_trees:to_list(Vec).
%% -spec list_to_vector([_]) -> hipe_vector().
%% list_to_vector(Xs) ->
%% gb_trees:from_orddict(index(Xs, 0)).
%%
%% index([X|Xs], N) ->
%% [{N, X} | index(Xs, N+1)];
%% index([],_) ->
%% [].
-spec vector_to_list(hipe_vector()) -> [_].
vector_to_list(V) ->
gb_trees:values(V).
-spec set(hipe_vector(), non_neg_integer(), _) -> hipe_vector().
set(Vec, Ix, V) ->
gb_trees:update(Ix, V, Vec).
-spec get(hipe_vector(), non_neg_integer()) -> any().
get(Vec, Ix) ->
gb_trees:get(Ix, Vec).
-endif. %% ifdef USE_GBTREES
|
