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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
# ex:ts=8 sw=4:
# $OpenBSD: UList.pm,v 1.2 2014/04/20 17:34:26 zhuk Exp $
#
# Copyright (c) 2013 Vadim Zhukov <zhuk@openbsd.org>
#
# Permission to use, copy, modify, and distribute this software for any
# purpose with or without fee is hereby granted, provided that the above
# copyright notice and this permission notice appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
use strict;
use warnings;
use feature qw(say);
# Hash that preserves order of adding items and avoids duplicates.
# Also, some additional restrictions are applied to make sure
# the usage of this list is straightforward.
package LT::UList;
require Tie::Array;
our @ISA = qw(Tie::Array);
sub _translate_num_key($$;$) {
if ($_[1] < 0) {
$_[1] = @{$_[0]} - (-$_[1]);
die "invalid index" if $_[1] < 1;
} else {
$_[1] += 1;
}
die "invalid index" if $_[1] - int($_[2] // 0) >= @{$_[0]};
}
# Construct new UList and returnes reference to the array,
# not to the tied object itself.
sub new {
my $class = shift;
tie(my @a, $class, @_);
return \@a;
}
# Given we have successfully added N directories:
# self->[0] = { directory => 1 }
# self->[1 .. N] = directories in the order of addition, represented as 0..N-1
sub TIEARRAY {
my $class = shift;
my $self = bless [ {} ], $class;
$self->PUSH(@_);
return $self;
}
# Unfortunately, exists() checks for the value being integer even in the
# case we have EXISTS() outta there. So if you really need to check the
# presence of particular item, call the method below on the reference
# returned by tie() or tied() instead.
sub exists { return exists $_[0]->[0]->{$_[1]}; }
sub FETCHSIZE { return scalar(@{$_[0]}) - 1; }
# not needed
sub STORE { die "unimplemented and should not be used"; }
sub DELETE { die "unimplemented and should not be used"; }
sub EXTEND { }
sub FETCH
{
my ($self, $key) = (shift, shift);
# ignore?
die "undef given instead of directory or index" unless defined $key;
$self->_translate_num_key($key);
return $self->[$key];
}
sub STORESIZE
{
my ($self, $newsz) = (shift, shift() + 2);
my $sz = @$self;
if ($newsz > $sz) {
# XXX any better way to grow?
$self->[$newsz - 1] = undef;
} elsif ($newsz < $sz) {
$self->POP() for $newsz .. $sz - 1;
}
}
sub PUSH
{
my $self = shift;
for (@_) {
next if exists $self->[0]->{$_};
$self->[0]->{$_} = @$self;
push(@$self, $_);
}
}
sub POP
{
my $self = shift;
return undef if @$self < 2;
my $key = pop @$self;
delete $self->[0]->{$key};
return $key;
}
sub SHIFT
{
my $self = shift;
return undef if @$self < 2;
my $key = splice(@$self, 1, 1);
delete $self->[0]->{$key};
return $key;
}
sub UNSHIFT
{
my $self = shift;
$self->SPLICE(0, 0, @_);
}
sub SPLICE
{
my $self = shift;
my $offset = shift // 0;
$self->_translate_num_key($offset, 1);
my $maxrm = @$self - $offset;
my $length = shift;
if (defined $length) {
$length = $maxrm - (-$length) if $length < 0;
$length = $maxrm if $length > $maxrm;
} else {
$length = $maxrm;
}
# do not ever dream of adding items here
my @ret = splice(@$self, $offset, $length);
for (@ret) {
delete $self->[0]->{$_};
}
for ($offset .. scalar(@$self) - 1) {
$self->[0]->{$self->[$_]} -= $length;
}
return @ret unless scalar(@_);
if ($length == $maxrm) {
# simply add items to the end
$self->PUSH(@_);
return @ret;
}
my $newpos = $offset;
for (@_) {
my $index = $self->[0]->{$_};
if (defined $index) {
if ($index < $offset) {
# skip current item totally
continue;
} elsif ($index == $offset) {
# skip adding but act as if added
$self->[0]->{$_} += $newpos - $offset;
$newpos++;
next;
}
splice(@$self, $index, 1);
}
splice(@$self, $newpos, 0, $_);
$self->[0]->{$_} = $newpos++;
}
for ($newpos .. scalar(@$self) - 1) {
$self->[0]->{$self->[$_]} += $newpos - $offset;
}
return @ret;
}
=head1 test
package main;
my $r = ['/path0', '/path1'];
tie(@$r, 'LT::UList');
#push(@$r, '/path0');
#push(@$r, '/path1');
push(@$r, '/path2');
push(@$r, '/path3');
push(@$r, '/path4');
push(@$r, '/path3');
push(@$r, '/path1');
push(@$r, '/path5');
say "spliced: ".join(", ", splice(@$r, 2, 2, '/pathAdd1', '/pathAdd2', '/pathAdd1'));
#say "a: ".join(", ", @a);
say "r: ".join(", ", @$r);
#say "r2: ".join(", ", @$r2);
=cut
|
