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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
|
#-*- perl -*-
#
# Copyright (C) 2001,2002,2003 Ken'ichi Fukamachi
# All rights reserved. This program is free software; you can
# redistribute it and/or modify it under the same terms as Perl itself.
#
# $FML: Adapter.pm,v 1.25 2003/01/11 15:22:25 fukachan Exp $
#
package IO::Adapter;
use vars qw(@ISA @ORIG_ISA $FirstTime $AUTOLOAD);
use strict;
use Carp;
use IO::Adapter::ErrorStatus qw(error_set error error_clear);
my $debug = 0;
# prepare error_set() is called
@ISA = qw(IO::Adapter::ErrorStatus);
BEGIN {}
END {}
=head1 NAME
IO::Adapter - adapter for several IO interfaces
=head1 SYNOPSIS
use IO::Adapter;
$obj = new IO::Adapter ($map, $map_params);
$obj->open || croak("cannot open $map");
while ($x = $obj->getline) { ... }
$obj->close;
where C<$map_params> is map specific parameters used for such as C<RDBMS>.
For example, C<$map_params> is:
$map_params = {
'mysql:toymodel' => {
sql_server => 'mysql.fml.org',
database => 'fml',
table => 'ml',
user => 'fml',
user_password => "secret password :)",
# model specific driver module
driver => 'My::Driver::Module::Name',
},
};
where you can specify your own module to provide specific SQL
statements.
=head1 DESCRIPTION
This is "Adapter" (or "Wrapper") C<design pattern>.
This is a wrapper of IO for
e.g. file,
unix group,
NIS (Network Information System),
RDBMS (Relational DataBase Management System)
et. al.
Once you create and open a C<map>,
you can use the same methods as usual file IO.
=head2 DATA STRUCTURE
Consider file with space separators. The data structure in a file
is described like this:
file content = {
key1 => undef,
key2 => [ value2 ],
key3 => [ value3a, value3b ],
};
IO::Adapter converts data in arbitrary map e.g. file, /etc/group,
RDBMS into this structure described above.
Also,
IO::Adapter provides unified access methods to this structure.
Instead of unification, IO::Adapter may provide amibugous IO.
For example, IO into array is not described as above.
/etc/group must be described as
wheel group = {
"root" => undef,
key2 => undef,
key3 => undef,
};
=head2 MAP
C<map> specifies the type of the database we read/write.
For example, C<file> map implies we hold our data in a file.
The format is one line for one entry in a lot of cases.
key1
key2 value
To get one entry is to read one line or a part of one line.
This wrapper provides IO like a usual file for the specified C<$map>.
=head2 MAP TYPES
map name descriptions or examples
---------------------------------------------------
file file:$file_name
For example, file:/var/spool/ml/elena/recipients
unix.group unix.group:$group_name
For example, unix.group:fml
nis.group nis.group:$group_name
the NIS "Netork Information System" (YP) map "group.byname"
For example, nis.group:fml
mysql mysql:$schema_name
postgresql postgresql:$schema_name
*** not yet implemented ***
ldap ldap:$schema_name
*** not yet implemented ***
=head1 METHODS
=item C<new($map, $args)>
the constructor. The first argument is a map decribed above.
=cut
# Descriptions: a constructor, which prepare IO operations for the
# given $map
# Arguments: OBJ($self) STR($map) HASH_REF($args)
# Side Effects: @ISA is modified
# load and import sub-class
# Return Value: OBJ
sub new
{
my ($self, $map, $args) = @_;
my ($type) = ref($self) || $self;
my ($me) = { _map => $map };
my ($pkg, @pkg);
# 2002/07/22: accpet READ_ONLY($map).
if ($map =~ /^READ_ONLY\(/) {
$map =~ s/^READ_ONLY\(//;
$map =~ s/^\)$//;
$me->{ _hints }->{ read_only } = 1;
}
else {
$me->{ _hints }->{ read_only } = 0;
}
if (ref($map) eq 'ARRAY') {
$pkg = 'IO::Adapter::Array';
$me->{_type} = 'array_reference';
$me->{_array_reference} = $map;
}
else {
if ($map =~ /file:(\S+)/ || $map =~ m@^(/\S+)@) {
$me->{_file} = $1;
$me->{_type} = 'file';
$pkg = 'IO::Adapter::File';
}
elsif ($map =~ /unix\.group:(\S+)/) {
$me->{_name} = $1;
$me->{_type} = 'unix.group';
$pkg = 'IO::Adapter::UnixGroup';
}
elsif ($map =~ /nis\.group:(\S+)/) {
$me->{_name} = $1;
$me->{_type} = 'nis.group';
$pkg = 'IO::Adapter::NIS';
}
elsif ($map =~ /(mysql|postgresql):(\S+)/i) {
$me->{_type} = $1;
$me->{_schema} = $2;
$me->{_params} = $args;
$me->{_type} =~ tr/A-Z/a-z/; # lowercase the '_type' syntax
$pkg = 'IO::Adapter::MySQL';
@pkg = qw(IO::Adapter::DBI);
}
elsif ($map =~ /(ldap):(\S+)/i) {
$me->{_type} = $1;
$me->{_schema} = $2;
$me->{_params} = $args;
$me->{_type} =~ tr/A-Z/a-z/; # lowercase the '_type' syntax
$pkg = 'IO::Adapter::LDAP';
}
else {
my $s = "IO::Adapter::new: map='$map' is unknown.";
error_set($me, $s);
}
}
# save @ISA for further use, re-evaluate @ISA
@ORIG_ISA = @ISA unless $FirstTime++;
@ISA = ($pkg, @pkg, @ORIG_ISA);
if ($debug) {
printf STDERR "%-20s %s\n", "IO::Adapter::ISA:", "@ISA";
print STDERR "use $pkg\n";
}
eval qq{ use $pkg; };
unless ($@) {
$pkg->configure($me, $args) if $pkg->can('configure');
}
else {
error_set($me, $@);
}
return bless $me, $type;
}
=head2
=item C<open([$flag])>
open IO operation for the map.
C<$flag> is passed to SUPER CLASS open()
when "file:" map is specified.
C<open()> is a dummy function in other maps now.
=cut
# Descriptions: open IO, each request is forwraded to each sub-class
# Arguments: OBJ($self) STR($flag)
# $flag is the same as open()'s flag for file: map but
# "r" only for other maps.
# Side Effects: none
# Return Value: HANDLE
sub open
{
my ($self, $flag) = @_;
my $type = $self->{ _type };
# default flag is "r" == "read open"
$flag ||= 'r';
if ($type eq 'file') {
$self->SUPER::open( { file => $self->{_file}, flag => $flag } );
}
elsif ($type eq 'unix.group' ||
$type eq 'array_reference') {
$self->SUPER::open( { flag => $flag } );
}
elsif ($type =~ /^(ldap|mysql|postgresql)$/o) {
$self->SUPER::open( { flag => $flag } );
}
else {
$self->error_set("Error: type=$self->{_type} is unknown type.");
}
}
=head2 C<touch()>
create a file if not exists.
This method is avaialble for file: type.
It is dummy for maps other than file: type.
=cut
# Descriptions: create a file if not exists.
# Arguments: OBJ($self)
# Side Effects: create $map if needed or possible
# Return Value: none
sub touch
{
my ($self) = @_;
my $type = $self->{ _type };
if ($type eq 'file') {
$self->SUPER::touch( { file => $self->{_file} } );
}
}
=head2 methods to retrieve data
get_next_key() is used to get the next primary key incrementally.
Also, another methods, getline() and get_next_value(), can be
considered but these are not userd in fml version 8 now.
=item C<get_next_key()>
return the next primary key.
=head2 C<add( $address, [$argv] )>
add $address to the specified map.
Optionally, you can add KEY=>VALUE structures such as
$address => STR
or
$address => [ STR1, STR2, ... ].
=head2 C<delete( $address )>
delete lines which matches $regexp from this map.
=cut
# Descriptions: add $address to the current map
# Arguments: OBJ($self) STR($address) VARARGS($argv)
# Side Effects: modify map content
# Return Value: same as add()
sub add
{
my ($self, $address, $argv) = @_;
if ($self->{ _hints }->{ read_only }) {
my $map = $self->{ _map };
croak("this map $map is read only.");
}
if ($self->can('add')) {
$self->SUPER::add($address, $argv);
}
else {
$self->error_set("Error: add() method is not supported.");
undef;
}
}
# Descriptions: delete $address from the current map
# Arguments: OBJ($self) STR($regexp)
# Side Effects: moidfy map content
# Return Value: same as delete()
sub delete
{
my ($self, $regexp) = @_;
if ($self->{ _hints }->{ read_only }) {
my $map = $self->{ _map };
croak("this map $map is read only.");
}
if ($self->can('delete')) {
$self->SUPER::delete($regexp);
}
else {
$self->error_set("Error: delete() method is not supported.");
undef;
}
}
=head2 C<find($regexp [,$args])>
search $regexp in C<map> and return the line which matches C<$regexp>.
It searches C<$regexp> in case insenssitive by default.
You can change the search behaviour by C<$args> (HASH REFERENCE).
$args = {
want => 'key', # 'key' or 'key,value'
case_sensitive => 1, # case senssitive
all => 1, # get all entries matching $regexp as ARRAY REF
};
The result returned by find() is primary key of data or key and value
e.g the whole line in the file format. find() returns the whole one
line by default. If want options is specified in $args, return value
changes. 'want' options is 'key' or 'key,value', 'key,value' by default.
find() returns the result as STRING or ARRAY REFERENCE.
You get only the first entry as string by default.
If you specify C<all>, you get the result(s) as ARRAY REFERENCE.
For example, to search mail addresses in recipient list,
my $a = $self->find($regexp, { want => 'key', all => 1});
for my $addr (@$a) {
do_somethig() if ($addr =~ /$regexp/);
}
=cut
# Descriptions: search method
# Arguments: OBJ($self) STR($regexp) HASH_REF($args)
# Side Effects: none
# Return Value: STR or ARRAY_REF
sub find
{
my ($self, $regexp, $args) = @_;
my $case_sensitive = $args->{ case_sensitive } ? 1 : 0;
my $show_all = $args->{ all } ? 1 : 0;
my $want = 'key,value';
my (@buf, $x);
# forward the request to SUPER class (md = map dependent)
if ($self->SUPER::can('md_find')) {
return $self->md_find($regexp, $args);
}
# What we want, key or key+value ?
if (defined $args->{ want }) {
if ($args->{ want } eq 'key' ||
$args->{ want } eq 'key,value') {
$want = $args->{ want };
}
else {
warn("invalid option");
}
}
# search regexp by reading the specified map.
$self->open;
my $fp = $want eq 'key' ? 'get_next_key' : 'getline';
while (defined ($x = $self->$fp())) {
if ($show_all) {
if ($case_sensitive) {
push(@buf, $x) if $x =~ /$regexp/;
}
else {
push(@buf, $x) if $x =~ /$regexp/i;
}
}
else {
if ($case_sensitive) {
last if $x =~ /$regexp/;
}
else {
last if $x =~ /$regexp/i;
}
}
}
$self->close;
$show_all ? \@buf : $x;
}
=head2 C<DESTROY>
=cut
# Descriptions: destructor
# request is forwarded to close() method.
# Arguments: OBJ($self)
# Side Effects: object is undef'ed.
# Return Value: none
sub DESTROY
{
my ($self) = @_;
$self->close;
undef $self;
}
=head2
=item C<error()>
return the most recent error message if exists.
=head1 CODING STYLE
See C<http://www.fml.org/software/FNF/> on fml coding style guide.
=head1 AUTHOR
Ken'ichi Fukamchi
=head1 COPYRIGHT
Copyright (C) 2001,2002,2003 Ken'ichi Fukamchi
All rights reserved. This program is free software; you can
redistribute it and/or modify it under the same terms as Perl itself.
=head1 HISTORY
IO::Adapter first appeared in fml8 mailing list driver package.
See C<http://www.fml.org/> for more details.
=cut
1;
|