file-tail 0.1.2
Sign up to get free protection for your applications and to get access to all the features.
- data/CHANGES +34 -0
- data/GPL +340 -0
- data/README.en +30 -0
- data/Rakefile +72 -0
- data/VERSION +1 -0
- data/examples/pager.rb +18 -0
- data/examples/tail.rb +11 -0
- data/install.rb +19 -0
- data/lib/file/tail.rb +380 -0
- data/make_doc.rb +6 -0
- data/tests/test.rb +219 -0
- metadata +51 -0
data/CHANGES
ADDED
@@ -0,0 +1,34 @@
|
|
1
|
+
2004-09-30 * 0.1.2 * First Rubyforge release
|
2
|
+
* Added Rakefile
|
3
|
+
* Supports gem build now.
|
4
|
+
2004-09-01 * 0.1.1 * Josh Endries <josh@endries.org> found a bug
|
5
|
+
that caused File::Tail to malfunction on FreeBSD.
|
6
|
+
Hotfix: Use a side effect of seek to clearerr the tailed
|
7
|
+
file handle after EOFError has been raised.
|
8
|
+
2004-04-13 * 0.1.0 * API documentation with rdoc.
|
9
|
+
* return_if_eof attribute added.
|
10
|
+
* Added array return mode for finite tail call without block
|
11
|
+
given.
|
12
|
+
* install.rb now uses ruby version site_dir.
|
13
|
+
* Some code and directory structure cleanup.
|
14
|
+
2002-08-02 * 0.0.2 * Heavy refactoring, more and smaller methods
|
15
|
+
and expception handling
|
16
|
+
* Added check for inode and device equality of files
|
17
|
+
as suggested by
|
18
|
+
James F.Hranicky <jfh@cise.ufl.edu> and
|
19
|
+
Curt Sampson <cjs@cynic.net> to cover remove
|
20
|
+
rotation
|
21
|
+
* If filesize shrinks suddenly, File::Tail assumes that
|
22
|
+
copy and truncate rotation has happend: The file
|
23
|
+
is reopened and every new line is handled.
|
24
|
+
* NFS-Fix: Errno::ESTALE is caught.
|
25
|
+
* wind added to skip the first n lines, as
|
26
|
+
James F.Hranicky's suggested and changed
|
27
|
+
name of last-method to rewind, because I liked
|
28
|
+
his method names better than mine ;)
|
29
|
+
* Renamed next to tail either.
|
30
|
+
* The API has changed - but I think very few people
|
31
|
+
care at the moment.
|
32
|
+
* Lots of tests added.
|
33
|
+
|
34
|
+
2002-07-30 * 0.0.1 * Initial Release
|
data/GPL
ADDED
@@ -0,0 +1,340 @@
|
|
1
|
+
GNU GENERAL PUBLIC LICENSE
|
2
|
+
Version 2, June 1991
|
3
|
+
|
4
|
+
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
|
5
|
+
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
6
|
+
Everyone is permitted to copy and distribute verbatim copies
|
7
|
+
of this license document, but changing it is not allowed.
|
8
|
+
|
9
|
+
Preamble
|
10
|
+
|
11
|
+
The licenses for most software are designed to take away your
|
12
|
+
freedom to share and change it. By contrast, the GNU General Public
|
13
|
+
License is intended to guarantee your freedom to share and change free
|
14
|
+
software--to make sure the software is free for all its users. This
|
15
|
+
General Public License applies to most of the Free Software
|
16
|
+
Foundation's software and to any other program whose authors commit to
|
17
|
+
using it. (Some other Free Software Foundation software is covered by
|
18
|
+
the GNU Library General Public License instead.) You can apply it to
|
19
|
+
your programs, too.
|
20
|
+
|
21
|
+
When we speak of free software, we are referring to freedom, not
|
22
|
+
price. Our General Public Licenses are designed to make sure that you
|
23
|
+
have the freedom to distribute copies of free software (and charge for
|
24
|
+
this service if you wish), that you receive source code or can get it
|
25
|
+
if you want it, that you can change the software or use pieces of it
|
26
|
+
in new free programs; and that you know you can do these things.
|
27
|
+
|
28
|
+
To protect your rights, we need to make restrictions that forbid
|
29
|
+
anyone to deny you these rights or to ask you to surrender the rights.
|
30
|
+
These restrictions translate to certain responsibilities for you if you
|
31
|
+
distribute copies of the software, or if you modify it.
|
32
|
+
|
33
|
+
For example, if you distribute copies of such a program, whether
|
34
|
+
gratis or for a fee, you must give the recipients all the rights that
|
35
|
+
you have. You must make sure that they, too, receive or can get the
|
36
|
+
source code. And you must show them these terms so they know their
|
37
|
+
rights.
|
38
|
+
|
39
|
+
We protect your rights with two steps: (1) copyright the software, and
|
40
|
+
(2) offer you this license which gives you legal permission to copy,
|
41
|
+
distribute and/or modify the software.
|
42
|
+
|
43
|
+
Also, for each author's protection and ours, we want to make certain
|
44
|
+
that everyone understands that there is no warranty for this free
|
45
|
+
software. If the software is modified by someone else and passed on, we
|
46
|
+
want its recipients to know that what they have is not the original, so
|
47
|
+
that any problems introduced by others will not reflect on the original
|
48
|
+
authors' reputations.
|
49
|
+
|
50
|
+
Finally, any free program is threatened constantly by software
|
51
|
+
patents. We wish to avoid the danger that redistributors of a free
|
52
|
+
program will individually obtain patent licenses, in effect making the
|
53
|
+
program proprietary. To prevent this, we have made it clear that any
|
54
|
+
patent must be licensed for everyone's free use or not licensed at all.
|
55
|
+
|
56
|
+
The precise terms and conditions for copying, distribution and
|
57
|
+
modification follow.
|
58
|
+
|
59
|
+
GNU GENERAL PUBLIC LICENSE
|
60
|
+
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
61
|
+
|
62
|
+
0. This License applies to any program or other work which contains
|
63
|
+
a notice placed by the copyright holder saying it may be distributed
|
64
|
+
under the terms of this General Public License. The "Program", below,
|
65
|
+
refers to any such program or work, and a "work based on the Program"
|
66
|
+
means either the Program or any derivative work under copyright law:
|
67
|
+
that is to say, a work containing the Program or a portion of it,
|
68
|
+
either verbatim or with modifications and/or translated into another
|
69
|
+
language. (Hereinafter, translation is included without limitation in
|
70
|
+
the term "modification".) Each licensee is addressed as "you".
|
71
|
+
|
72
|
+
Activities other than copying, distribution and modification are not
|
73
|
+
covered by this License; they are outside its scope. The act of
|
74
|
+
running the Program is not restricted, and the output from the Program
|
75
|
+
is covered only if its contents constitute a work based on the
|
76
|
+
Program (independent of having been made by running the Program).
|
77
|
+
Whether that is true depends on what the Program does.
|
78
|
+
|
79
|
+
1. You may copy and distribute verbatim copies of the Program's
|
80
|
+
source code as you receive it, in any medium, provided that you
|
81
|
+
conspicuously and appropriately publish on each copy an appropriate
|
82
|
+
copyright notice and disclaimer of warranty; keep intact all the
|
83
|
+
notices that refer to this License and to the absence of any warranty;
|
84
|
+
and give any other recipients of the Program a copy of this License
|
85
|
+
along with the Program.
|
86
|
+
|
87
|
+
You may charge a fee for the physical act of transferring a copy, and
|
88
|
+
you may at your option offer warranty protection in exchange for a fee.
|
89
|
+
|
90
|
+
2. You may modify your copy or copies of the Program or any portion
|
91
|
+
of it, thus forming a work based on the Program, and copy and
|
92
|
+
distribute such modifications or work under the terms of Section 1
|
93
|
+
above, provided that you also meet all of these conditions:
|
94
|
+
|
95
|
+
a) You must cause the modified files to carry prominent notices
|
96
|
+
stating that you changed the files and the date of any change.
|
97
|
+
|
98
|
+
b) You must cause any work that you distribute or publish, that in
|
99
|
+
whole or in part contains or is derived from the Program or any
|
100
|
+
part thereof, to be licensed as a whole at no charge to all third
|
101
|
+
parties under the terms of this License.
|
102
|
+
|
103
|
+
c) If the modified program normally reads commands interactively
|
104
|
+
when run, you must cause it, when started running for such
|
105
|
+
interactive use in the most ordinary way, to print or display an
|
106
|
+
announcement including an appropriate copyright notice and a
|
107
|
+
notice that there is no warranty (or else, saying that you provide
|
108
|
+
a warranty) and that users may redistribute the program under
|
109
|
+
these conditions, and telling the user how to view a copy of this
|
110
|
+
License. (Exception: if the Program itself is interactive but
|
111
|
+
does not normally print such an announcement, your work based on
|
112
|
+
the Program is not required to print an announcement.)
|
113
|
+
|
114
|
+
These requirements apply to the modified work as a whole. If
|
115
|
+
identifiable sections of that work are not derived from the Program,
|
116
|
+
and can be reasonably considered independent and separate works in
|
117
|
+
themselves, then this License, and its terms, do not apply to those
|
118
|
+
sections when you distribute them as separate works. But when you
|
119
|
+
distribute the same sections as part of a whole which is a work based
|
120
|
+
on the Program, the distribution of the whole must be on the terms of
|
121
|
+
this License, whose permissions for other licensees extend to the
|
122
|
+
entire whole, and thus to each and every part regardless of who wrote it.
|
123
|
+
|
124
|
+
Thus, it is not the intent of this section to claim rights or contest
|
125
|
+
your rights to work written entirely by you; rather, the intent is to
|
126
|
+
exercise the right to control the distribution of derivative or
|
127
|
+
collective works based on the Program.
|
128
|
+
|
129
|
+
In addition, mere aggregation of another work not based on the Program
|
130
|
+
with the Program (or with a work based on the Program) on a volume of
|
131
|
+
a storage or distribution medium does not bring the other work under
|
132
|
+
the scope of this License.
|
133
|
+
|
134
|
+
3. You may copy and distribute the Program (or a work based on it,
|
135
|
+
under Section 2) in object code or executable form under the terms of
|
136
|
+
Sections 1 and 2 above provided that you also do one of the following:
|
137
|
+
|
138
|
+
a) Accompany it with the complete corresponding machine-readable
|
139
|
+
source code, which must be distributed under the terms of Sections
|
140
|
+
1 and 2 above on a medium customarily used for software interchange; or,
|
141
|
+
|
142
|
+
b) Accompany it with a written offer, valid for at least three
|
143
|
+
years, to give any third party, for a charge no more than your
|
144
|
+
cost of physically performing source distribution, a complete
|
145
|
+
machine-readable copy of the corresponding source code, to be
|
146
|
+
distributed under the terms of Sections 1 and 2 above on a medium
|
147
|
+
customarily used for software interchange; or,
|
148
|
+
|
149
|
+
c) Accompany it with the information you received as to the offer
|
150
|
+
to distribute corresponding source code. (This alternative is
|
151
|
+
allowed only for noncommercial distribution and only if you
|
152
|
+
received the program in object code or executable form with such
|
153
|
+
an offer, in accord with Subsection b above.)
|
154
|
+
|
155
|
+
The source code for a work means the preferred form of the work for
|
156
|
+
making modifications to it. For an executable work, complete source
|
157
|
+
code means all the source code for all modules it contains, plus any
|
158
|
+
associated interface definition files, plus the scripts used to
|
159
|
+
control compilation and installation of the executable. However, as a
|
160
|
+
special exception, the source code distributed need not include
|
161
|
+
anything that is normally distributed (in either source or binary
|
162
|
+
form) with the major components (compiler, kernel, and so on) of the
|
163
|
+
operating system on which the executable runs, unless that component
|
164
|
+
itself accompanies the executable.
|
165
|
+
|
166
|
+
If distribution of executable or object code is made by offering
|
167
|
+
access to copy from a designated place, then offering equivalent
|
168
|
+
access to copy the source code from the same place counts as
|
169
|
+
distribution of the source code, even though third parties are not
|
170
|
+
compelled to copy the source along with the object code.
|
171
|
+
|
172
|
+
4. You may not copy, modify, sublicense, or distribute the Program
|
173
|
+
except as expressly provided under this License. Any attempt
|
174
|
+
otherwise to copy, modify, sublicense or distribute the Program is
|
175
|
+
void, and will automatically terminate your rights under this License.
|
176
|
+
However, parties who have received copies, or rights, from you under
|
177
|
+
this License will not have their licenses terminated so long as such
|
178
|
+
parties remain in full compliance.
|
179
|
+
|
180
|
+
5. You are not required to accept this License, since you have not
|
181
|
+
signed it. However, nothing else grants you permission to modify or
|
182
|
+
distribute the Program or its derivative works. These actions are
|
183
|
+
prohibited by law if you do not accept this License. Therefore, by
|
184
|
+
modifying or distributing the Program (or any work based on the
|
185
|
+
Program), you indicate your acceptance of this License to do so, and
|
186
|
+
all its terms and conditions for copying, distributing or modifying
|
187
|
+
the Program or works based on it.
|
188
|
+
|
189
|
+
6. Each time you redistribute the Program (or any work based on the
|
190
|
+
Program), the recipient automatically receives a license from the
|
191
|
+
original licensor to copy, distribute or modify the Program subject to
|
192
|
+
these terms and conditions. You may not impose any further
|
193
|
+
restrictions on the recipients' exercise of the rights granted herein.
|
194
|
+
You are not responsible for enforcing compliance by third parties to
|
195
|
+
this License.
|
196
|
+
|
197
|
+
7. If, as a consequence of a court judgment or allegation of patent
|
198
|
+
infringement or for any other reason (not limited to patent issues),
|
199
|
+
conditions are imposed on you (whether by court order, agreement or
|
200
|
+
otherwise) that contradict the conditions of this License, they do not
|
201
|
+
excuse you from the conditions of this License. If you cannot
|
202
|
+
distribute so as to satisfy simultaneously your obligations under this
|
203
|
+
License and any other pertinent obligations, then as a consequence you
|
204
|
+
may not distribute the Program at all. For example, if a patent
|
205
|
+
license would not permit royalty-free redistribution of the Program by
|
206
|
+
all those who receive copies directly or indirectly through you, then
|
207
|
+
the only way you could satisfy both it and this License would be to
|
208
|
+
refrain entirely from distribution of the Program.
|
209
|
+
|
210
|
+
If any portion of this section is held invalid or unenforceable under
|
211
|
+
any particular circumstance, the balance of the section is intended to
|
212
|
+
apply and the section as a whole is intended to apply in other
|
213
|
+
circumstances.
|
214
|
+
|
215
|
+
It is not the purpose of this section to induce you to infringe any
|
216
|
+
patents or other property right claims or to contest validity of any
|
217
|
+
such claims; this section has the sole purpose of protecting the
|
218
|
+
integrity of the free software distribution system, which is
|
219
|
+
implemented by public license practices. Many people have made
|
220
|
+
generous contributions to the wide range of software distributed
|
221
|
+
through that system in reliance on consistent application of that
|
222
|
+
system; it is up to the author/donor to decide if he or she is willing
|
223
|
+
to distribute software through any other system and a licensee cannot
|
224
|
+
impose that choice.
|
225
|
+
|
226
|
+
This section is intended to make thoroughly clear what is believed to
|
227
|
+
be a consequence of the rest of this License.
|
228
|
+
|
229
|
+
8. If the distribution and/or use of the Program is restricted in
|
230
|
+
certain countries either by patents or by copyrighted interfaces, the
|
231
|
+
original copyright holder who places the Program under this License
|
232
|
+
may add an explicit geographical distribution limitation excluding
|
233
|
+
those countries, so that distribution is permitted only in or among
|
234
|
+
countries not thus excluded. In such case, this License incorporates
|
235
|
+
the limitation as if written in the body of this License.
|
236
|
+
|
237
|
+
9. The Free Software Foundation may publish revised and/or new versions
|
238
|
+
of the General Public License from time to time. Such new versions will
|
239
|
+
be similar in spirit to the present version, but may differ in detail to
|
240
|
+
address new problems or concerns.
|
241
|
+
|
242
|
+
Each version is given a distinguishing version number. If the Program
|
243
|
+
specifies a version number of this License which applies to it and "any
|
244
|
+
later version", you have the option of following the terms and conditions
|
245
|
+
either of that version or of any later version published by the Free
|
246
|
+
Software Foundation. If the Program does not specify a version number of
|
247
|
+
this License, you may choose any version ever published by the Free Software
|
248
|
+
Foundation.
|
249
|
+
|
250
|
+
10. If you wish to incorporate parts of the Program into other free
|
251
|
+
programs whose distribution conditions are different, write to the author
|
252
|
+
to ask for permission. For software which is copyrighted by the Free
|
253
|
+
Software Foundation, write to the Free Software Foundation; we sometimes
|
254
|
+
make exceptions for this. Our decision will be guided by the two goals
|
255
|
+
of preserving the free status of all derivatives of our free software and
|
256
|
+
of promoting the sharing and reuse of software generally.
|
257
|
+
|
258
|
+
NO WARRANTY
|
259
|
+
|
260
|
+
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
|
261
|
+
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
|
262
|
+
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
|
263
|
+
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
|
264
|
+
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
265
|
+
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
|
266
|
+
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
|
267
|
+
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
|
268
|
+
REPAIR OR CORRECTION.
|
269
|
+
|
270
|
+
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
271
|
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
|
272
|
+
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
273
|
+
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
|
274
|
+
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
|
275
|
+
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
|
276
|
+
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
|
277
|
+
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
|
278
|
+
POSSIBILITY OF SUCH DAMAGES.
|
279
|
+
|
280
|
+
END OF TERMS AND CONDITIONS
|
281
|
+
|
282
|
+
How to Apply These Terms to Your New Programs
|
283
|
+
|
284
|
+
If you develop a new program, and you want it to be of the greatest
|
285
|
+
possible use to the public, the best way to achieve this is to make it
|
286
|
+
free software which everyone can redistribute and change under these terms.
|
287
|
+
|
288
|
+
To do so, attach the following notices to the program. It is safest
|
289
|
+
to attach them to the start of each source file to most effectively
|
290
|
+
convey the exclusion of warranty; and each file should have at least
|
291
|
+
the "copyright" line and a pointer to where the full notice is found.
|
292
|
+
|
293
|
+
<one line to give the program's name and a brief idea of what it does.>
|
294
|
+
Copyright (C) <year> <name of author>
|
295
|
+
|
296
|
+
This program is free software; you can redistribute it and/or modify
|
297
|
+
it under the terms of the GNU General Public License as published by
|
298
|
+
the Free Software Foundation; either version 2 of the License, or
|
299
|
+
(at your option) any later version.
|
300
|
+
|
301
|
+
This program is distributed in the hope that it will be useful,
|
302
|
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
303
|
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
304
|
+
GNU General Public License for more details.
|
305
|
+
|
306
|
+
You should have received a copy of the GNU General Public License
|
307
|
+
along with this program; if not, write to the Free Software
|
308
|
+
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
309
|
+
|
310
|
+
|
311
|
+
Also add information on how to contact you by electronic and paper mail.
|
312
|
+
|
313
|
+
If the program is interactive, make it output a short notice like this
|
314
|
+
when it starts in an interactive mode:
|
315
|
+
|
316
|
+
Gnomovision version 69, Copyright (C) year name of author
|
317
|
+
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
318
|
+
This is free software, and you are welcome to redistribute it
|
319
|
+
under certain conditions; type `show c' for details.
|
320
|
+
|
321
|
+
The hypothetical commands `show w' and `show c' should show the appropriate
|
322
|
+
parts of the General Public License. Of course, the commands you use may
|
323
|
+
be called something other than `show w' and `show c'; they could even be
|
324
|
+
mouse-clicks or menu items--whatever suits your program.
|
325
|
+
|
326
|
+
You should also get your employer (if you work as a programmer) or your
|
327
|
+
school, if any, to sign a "copyright disclaimer" for the program, if
|
328
|
+
necessary. Here is a sample; alter the names:
|
329
|
+
|
330
|
+
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
|
331
|
+
`Gnomovision' (which makes passes at compilers) written by James Hacker.
|
332
|
+
|
333
|
+
<signature of Ty Coon>, 1 April 1989
|
334
|
+
Ty Coon, President of Vice
|
335
|
+
|
336
|
+
This General Public License does not permit incorporating your program into
|
337
|
+
proprietary programs. If your program is a subroutine library, you may
|
338
|
+
consider it more useful to permit linking proprietary applications with the
|
339
|
+
library. If this is what you want to do, use the GNU Library General
|
340
|
+
Public License instead of this License.
|
data/README.en
ADDED
@@ -0,0 +1,30 @@
|
|
1
|
+
Installation
|
2
|
+
============
|
3
|
+
|
4
|
+
Just type into the command line as root:
|
5
|
+
|
6
|
+
# ruby install.rb
|
7
|
+
|
8
|
+
Documentation
|
9
|
+
=============
|
10
|
+
|
11
|
+
To create the documentation of this module, type
|
12
|
+
|
13
|
+
$ ruby make_doc.rb
|
14
|
+
|
15
|
+
and the API documentation is generated by your rdoc command.
|
16
|
+
|
17
|
+
In the examples direcotry is a small example of tail and
|
18
|
+
pager program that use this module. You also may want look
|
19
|
+
at the end of file/tail.rb for a little example.
|
20
|
+
|
21
|
+
Author
|
22
|
+
======
|
23
|
+
|
24
|
+
Florian Frank <flori@ping.de>
|
25
|
+
|
26
|
+
License
|
27
|
+
=======
|
28
|
+
|
29
|
+
GNU General Public License (GPL)
|
30
|
+
|
data/Rakefile
ADDED
@@ -0,0 +1,72 @@
|
|
1
|
+
# Rakefile for File::Tail -*- ruby -*-
|
2
|
+
|
3
|
+
require 'rake/gempackagetask'
|
4
|
+
require 'rbconfig'
|
5
|
+
|
6
|
+
include Config
|
7
|
+
|
8
|
+
PKG_NAME = 'file-tail'
|
9
|
+
PKG_VERSION = File.read('VERSION').chomp
|
10
|
+
PKG_FILES = Dir.glob("**/*").delete_if { |item|
|
11
|
+
item.include?("CVS") or item.include?("pkg")
|
12
|
+
}
|
13
|
+
|
14
|
+
desc "Installing library"
|
15
|
+
task :install do
|
16
|
+
libdir = CONFIG["sitelibdir"]
|
17
|
+
dest = File.join(libdir, 'file')
|
18
|
+
install('lib/file/tail.rb', dest)
|
19
|
+
end
|
20
|
+
|
21
|
+
spec = Gem::Specification.new do |s|
|
22
|
+
|
23
|
+
#### Basic information.
|
24
|
+
|
25
|
+
s.name = 'file-tail'
|
26
|
+
s.version = PKG_VERSION
|
27
|
+
s.summary = "File::Tail for Ruby"
|
28
|
+
s.description = ""
|
29
|
+
|
30
|
+
#### Dependencies and requirements.
|
31
|
+
|
32
|
+
#s.add_dependency('log4r', '> 1.0.4')
|
33
|
+
#s.requirements << ""
|
34
|
+
|
35
|
+
s.files = PKG_FILES
|
36
|
+
|
37
|
+
#### C code extensions.
|
38
|
+
|
39
|
+
#s.extensions << "ext/extconf.rb"
|
40
|
+
|
41
|
+
#### Load-time details: library and application (you will need one or both).
|
42
|
+
|
43
|
+
s.require_path = 'lib' # Use these for libraries.
|
44
|
+
s.autorequire = 'file/tail'
|
45
|
+
|
46
|
+
#s.bindir = "bin" # Use these for applications.
|
47
|
+
#s.executables = ["bla.rb"]
|
48
|
+
#s.default_executable = "bla.rb"
|
49
|
+
|
50
|
+
#### Documentation and testing.
|
51
|
+
|
52
|
+
s.has_rdoc = true
|
53
|
+
#s.extra_rdoc_files = rd.rdoc_files.reject { |fn| fn =~ /\.rb$/ }.to_a
|
54
|
+
#s.rdoc_options <<
|
55
|
+
# '--title' << 'Rake -- Ruby Make' <<
|
56
|
+
# '--main' << 'README' <<
|
57
|
+
# '--line-numbers'
|
58
|
+
s.test_files << 'tests/test.rb'
|
59
|
+
|
60
|
+
#### Author and project details.
|
61
|
+
|
62
|
+
s.author = "Florian Frank"
|
63
|
+
s.email = "flori@ping.de"
|
64
|
+
s.homepage = "http://file-tail.rubyforge.org"
|
65
|
+
s.rubyforge_project = "file-tail"
|
66
|
+
end
|
67
|
+
|
68
|
+
Rake::GemPackageTask.new(spec) do |pkg|
|
69
|
+
pkg.need_tar = true
|
70
|
+
pkg.package_files += PKG_FILES
|
71
|
+
end
|
72
|
+
# vim: set et sw=4 ts=4:
|
data/VERSION
ADDED
@@ -0,0 +1 @@
|
|
1
|
+
0.1.2
|
data/examples/pager.rb
ADDED
@@ -0,0 +1,18 @@
|
|
1
|
+
#!/usr/bin/env ruby
|
2
|
+
# A poor man's pager... :)
|
3
|
+
|
4
|
+
require 'file/tail'
|
5
|
+
|
6
|
+
filename = ARGV.shift or fail "Usage: #$0 filename [height]"
|
7
|
+
height = (ARGV.shift || 24).to_i - 1
|
8
|
+
|
9
|
+
File::Tail::Logfile.open(filename, :break_if_eof => true) do |log|
|
10
|
+
begin
|
11
|
+
log.tail(height) { |line| puts line }
|
12
|
+
print "Press return key to continue!" ; gets
|
13
|
+
print ""
|
14
|
+
redo
|
15
|
+
rescue File::Tail::BreakException
|
16
|
+
end
|
17
|
+
end
|
18
|
+
# vim: set noet sw=4 ts=4:
|
data/examples/tail.rb
ADDED
@@ -0,0 +1,11 @@
|
|
1
|
+
#!/usr/bin/env ruby
|
2
|
+
|
3
|
+
require 'file/tail'
|
4
|
+
|
5
|
+
filename = ARGV.pop or fail "Usage: #$0 number filename"
|
6
|
+
number = (ARGV.pop || 0).to_i.abs
|
7
|
+
|
8
|
+
File::Tail::Logfile.open(filename) do |log|
|
9
|
+
log.rewind(number).tail { |line| puts line }
|
10
|
+
end
|
11
|
+
# vim: set noet sw=4 ts=4:
|
data/install.rb
ADDED
@@ -0,0 +1,19 @@
|
|
1
|
+
#!/usr/bin/env ruby
|
2
|
+
|
3
|
+
require 'rbconfig'
|
4
|
+
require 'fileutils'
|
5
|
+
include FileUtils::Verbose
|
6
|
+
|
7
|
+
include Config
|
8
|
+
|
9
|
+
cd 'lib' do
|
10
|
+
libdir = CONFIG["sitelibdir"]
|
11
|
+
subdir = 'file'
|
12
|
+
filename = 'tail.rb'
|
13
|
+
|
14
|
+
dest = File.join(libdir, subdir)
|
15
|
+
mkdir_p(dest)
|
16
|
+
file = File.join('file', filename)
|
17
|
+
install(file, dest)
|
18
|
+
end
|
19
|
+
# vim: set et sw=2 ts=2:
|
data/lib/file/tail.rb
ADDED
@@ -0,0 +1,380 @@
|
|
1
|
+
# File::Tail is a module in the File class. A lightweight class interface for
|
2
|
+
# logfiles can be seen under File::Tail::Logfile.
|
3
|
+
class File
|
4
|
+
|
5
|
+
# The File::Tail module can be included in File objects and mixes in
|
6
|
+
# the wind, rewind and tail methods.
|
7
|
+
#
|
8
|
+
# === Usage
|
9
|
+
# Direct extension of File objects works like that:
|
10
|
+
# File.open(filename) do |log|
|
11
|
+
# log.extend(File::Tail)
|
12
|
+
# log.interval = 10
|
13
|
+
# log.rewind(10)
|
14
|
+
# log.tail { |line| puts line }
|
15
|
+
# end
|
16
|
+
#
|
17
|
+
# It's also possible to mix File::Tail in your own File classes
|
18
|
+
# (see also File::Tail::Logfile):
|
19
|
+
# class MyFile < File
|
20
|
+
# include File::Tail
|
21
|
+
# end
|
22
|
+
# log = MyFile.new("myfile")
|
23
|
+
# log.interval = 10
|
24
|
+
# log.rewind(10)
|
25
|
+
# log.tail { |line| print line }
|
26
|
+
#
|
27
|
+
# The wind/rewind method returns self, so it's possible to chain
|
28
|
+
# methods together like that:
|
29
|
+
# log.rewind(10).tail { |line| puts line }
|
30
|
+
module Tail
|
31
|
+
|
32
|
+
# This is an easy to use Logfile class that includes
|
33
|
+
# the File::Tail module.
|
34
|
+
#
|
35
|
+
# === Usage
|
36
|
+
# The unix command "tail -10f filename" can be emulated like that:
|
37
|
+
# File::Tail::Logfile.open(filename, :rewind => 10) do |log|
|
38
|
+
# log.tail { |line| puts line }
|
39
|
+
# end
|
40
|
+
#
|
41
|
+
# To skip the first 10 lines of the file do that:
|
42
|
+
# File::Tail::Logfile.open(filename, :wind => 10) do |log|
|
43
|
+
# log.tail { |line| puts line }
|
44
|
+
# end
|
45
|
+
#
|
46
|
+
# The unix command "head -10 filename" can be emulated like that:
|
47
|
+
# File::Tail::Logfile.open(filename, :return_if_eof => true) do |log|
|
48
|
+
# log.tail(10) { |line| puts line }
|
49
|
+
# end
|
50
|
+
class Logfile < File
|
51
|
+
|
52
|
+
include File::Tail
|
53
|
+
|
54
|
+
# This method creates an File::Tail::Logfile object and
|
55
|
+
# yields to it if a block is given, otherwise it just
|
56
|
+
# returns it. The opts hash takes an option like
|
57
|
+
# <code>:rewind => 10</code> to rewind
|
58
|
+
# <code>:wind => 10</code> to wind
|
59
|
+
# the logfile for 10 lines at the start. The buffersize
|
60
|
+
# for rewind can be set with the
|
61
|
+
# <code>:bufsiz => 8192</code> option.
|
62
|
+
# Every attribute of File::Tail can be set with a
|
63
|
+
# <code>:attributename => value</code> option.
|
64
|
+
def Logfile.open(filename, opts = {}) # :yields: file
|
65
|
+
file = new filename
|
66
|
+
opts.each do |o, v|
|
67
|
+
writer = o.to_s + "="
|
68
|
+
file.__send__(writer, v) if file.respond_to? writer
|
69
|
+
end
|
70
|
+
if opts[:rewind]
|
71
|
+
(args = []) << opts[:rewind]
|
72
|
+
args << opt[:bufsiz] if opts[:bufsiz]
|
73
|
+
file.rewind(*args)
|
74
|
+
elsif opts[:wind]
|
75
|
+
file.wind(opts[:wind])
|
76
|
+
end
|
77
|
+
if block_given?
|
78
|
+
yield file
|
79
|
+
nil
|
80
|
+
else
|
81
|
+
file
|
82
|
+
end
|
83
|
+
end
|
84
|
+
|
85
|
+
end
|
86
|
+
|
87
|
+
# This is the base class of all exceptions that are raised
|
88
|
+
# in File::Tail.
|
89
|
+
class TailException < Exception; end
|
90
|
+
|
91
|
+
# The DeletedException is raised if a file is
|
92
|
+
# deleted while tailing it.
|
93
|
+
class DeletedException < TailException; end
|
94
|
+
|
95
|
+
# The ReturnException is raised and caught
|
96
|
+
# internally to implement "tail -10" behaviour.
|
97
|
+
class ReturnException < TailException; end
|
98
|
+
|
99
|
+
# The BreakException is raised if the <code>break_if_eof</code>
|
100
|
+
# attribute is set to a true value and the end of tailed file
|
101
|
+
# is reached.
|
102
|
+
class BreakException < TailException; end
|
103
|
+
|
104
|
+
# The ReopenException is raised internally if File::Tail
|
105
|
+
# gets suspicious something unusual has happend to
|
106
|
+
# the tailed file, e. g., it was rotated away. The exception
|
107
|
+
# is caught and an attempt to reopen it is made.
|
108
|
+
class ReopenException < TailException
|
109
|
+
|
110
|
+
attr_reader :mode
|
111
|
+
|
112
|
+
# Creates an ReopenException object. The mode defaults to
|
113
|
+
# <code>:bottom</code> which indicates that the file
|
114
|
+
# should be tailed beginning from the end. <code>:top</code>
|
115
|
+
# indicates, that it should be tailed from the beginning from the
|
116
|
+
# start.
|
117
|
+
def initialize(mode = :bottom)
|
118
|
+
super(self.class.name)
|
119
|
+
@mode = mode
|
120
|
+
end
|
121
|
+
|
122
|
+
end
|
123
|
+
|
124
|
+
# The maximum interval File::Tail sleeps, before it tries
|
125
|
+
# to take some action like reading the next few lines
|
126
|
+
# or reopening the file.
|
127
|
+
attr_accessor :max_interval
|
128
|
+
|
129
|
+
# The start value of the sleep interval. This value
|
130
|
+
# goes against <code>max_interval</code> if the tailed
|
131
|
+
# file is silent for a sufficient time.
|
132
|
+
attr_accessor :interval
|
133
|
+
|
134
|
+
# If this attribute is set to a true value, File::Tail persists
|
135
|
+
# on reopening a deleted file waiting <code>max_interval</code> seconds
|
136
|
+
# between the attempts. This is useful if logfiles are
|
137
|
+
# moved away while rotation occurs but are recreated at
|
138
|
+
# the same place after a while. It defaults to true.
|
139
|
+
attr_accessor :reopen_deleted
|
140
|
+
|
141
|
+
# If this attribute is set to a true value, File::Tail
|
142
|
+
# attempts to reopen it's tailed file after
|
143
|
+
# <code>suspicious_interval</code> seconds of silence.
|
144
|
+
attr_accessor :reopen_suspicious
|
145
|
+
|
146
|
+
# This attribute is the invterval in seconds before File::Tail
|
147
|
+
# gets suspicious that something has happend to it's tailed file
|
148
|
+
# and an attempt to reopen it is made.
|
149
|
+
#
|
150
|
+
# If the attribute <code>reopen_suspicious</code> is
|
151
|
+
# set to a non true value, suspicious_interval is
|
152
|
+
# meaningless. It defaults to 60 seconds.
|
153
|
+
attr_accessor :suspicious_interval
|
154
|
+
|
155
|
+
# If this attribute is set to a true value, File::Fail's tail method
|
156
|
+
# raises a BreakException if the end of the file is reached.
|
157
|
+
attr_accessor :break_if_eof
|
158
|
+
|
159
|
+
# If this attribute is set to a true value, File::Fail's tail method
|
160
|
+
# just returns if the end of the file is reached.
|
161
|
+
attr_accessor :return_if_eof
|
162
|
+
|
163
|
+
# Skip the first <code>n</code> lines of this file. The default is to
|
164
|
+
# don't skip any lines at all and start at the beginning of this file.
|
165
|
+
def wind(n = 0)
|
166
|
+
seek(0, File::SEEK_SET)
|
167
|
+
while n > 0 and not eof?
|
168
|
+
readline
|
169
|
+
n -= 1
|
170
|
+
end
|
171
|
+
self
|
172
|
+
end
|
173
|
+
|
174
|
+
# Rewind the last <code>n</code> lines of this file, starting
|
175
|
+
# from the end. The default is to start tailing directly from the
|
176
|
+
# end of the file.
|
177
|
+
#
|
178
|
+
# The additional argument <code>bufsiz</code> is
|
179
|
+
# used to determine the buffer size that is used to step through
|
180
|
+
# the file backwards. It defaults to the block size of the
|
181
|
+
# filesystem this file belongs to or 8192 bytes if this cannot
|
182
|
+
# be determined.
|
183
|
+
def rewind(n = 0, bufsiz = nil)
|
184
|
+
if n <= 0
|
185
|
+
seek(0, File::SEEK_END)
|
186
|
+
return self
|
187
|
+
end
|
188
|
+
bufsiz ||= stat.blksize || 8192
|
189
|
+
size = stat.size
|
190
|
+
begin
|
191
|
+
if bufsiz < size
|
192
|
+
seek(0, File::SEEK_END)
|
193
|
+
while n > 0 and tell > 0 do
|
194
|
+
start = tell
|
195
|
+
seek(-bufsiz, File::SEEK_CUR)
|
196
|
+
buffer = read(bufsiz)
|
197
|
+
n -= buffer.count("\n")
|
198
|
+
seek(-bufsiz, File::SEEK_CUR)
|
199
|
+
end
|
200
|
+
else
|
201
|
+
seek(0, File::SEEK_SET)
|
202
|
+
buffer = read(size)
|
203
|
+
n -= buffer.count("\n")
|
204
|
+
seek(0, File::SEEK_SET)
|
205
|
+
end
|
206
|
+
rescue Errno::EINVAL
|
207
|
+
size = tell
|
208
|
+
retry
|
209
|
+
end
|
210
|
+
pos = -1
|
211
|
+
while n < 0 # forward if we are too far back
|
212
|
+
pos = buffer.index("\n", pos + 1)
|
213
|
+
n += 1
|
214
|
+
end
|
215
|
+
seek(pos + 1, File::SEEK_CUR)
|
216
|
+
self
|
217
|
+
end
|
218
|
+
|
219
|
+
# This method tails this file and yields to the given block for
|
220
|
+
# every new line that is read.
|
221
|
+
# If no block is given an array of those lines is
|
222
|
+
# returned instead. (In this case it's better to use a
|
223
|
+
# reasonable value for <code>n</code> or set the
|
224
|
+
# <code>return_if_eof</code> or <code>break_if_eof</code>
|
225
|
+
# attribute to a true value to stop the method call from blocking.)
|
226
|
+
#
|
227
|
+
# If the argument <code>n</code> is given, only the next <code>n</code>
|
228
|
+
# lines are read and the method call returns. Otherwise this method
|
229
|
+
# call doesn't return, but yields to block for every new line read from
|
230
|
+
# this file for ever.
|
231
|
+
def tail(n = nil, &block) # :yields: line
|
232
|
+
result = []
|
233
|
+
array_result = false
|
234
|
+
unless block
|
235
|
+
block = lambda { |line| result << line }
|
236
|
+
array_result = true
|
237
|
+
end
|
238
|
+
preset_atts unless @lines
|
239
|
+
loop do
|
240
|
+
begin
|
241
|
+
restat
|
242
|
+
read_line(n, &block)
|
243
|
+
redo
|
244
|
+
rescue ReopenException => e
|
245
|
+
reopen_file(e.mode)
|
246
|
+
rescue ReturnException
|
247
|
+
return array_result ? result : nil
|
248
|
+
end
|
249
|
+
end
|
250
|
+
end
|
251
|
+
|
252
|
+
private
|
253
|
+
|
254
|
+
def read_line(n)
|
255
|
+
if n
|
256
|
+
n.times do
|
257
|
+
yield readline
|
258
|
+
@lines += 1
|
259
|
+
@no_read = 0
|
260
|
+
debug
|
261
|
+
end
|
262
|
+
raise ReturnException
|
263
|
+
else
|
264
|
+
yield readline
|
265
|
+
@lines += 1
|
266
|
+
@no_read = 0
|
267
|
+
debug
|
268
|
+
end
|
269
|
+
rescue EOFError
|
270
|
+
seek(0, File::SEEK_CUR)
|
271
|
+
raise ReopenException if @reopen_suspicious and
|
272
|
+
@no_read > @suspicious_interval
|
273
|
+
raise BreakException if @break_if_eof
|
274
|
+
raise ReturnException if @return_if_eof
|
275
|
+
sleep_interval
|
276
|
+
rescue Errno::ENOENT
|
277
|
+
rescue Errno::ESTALE
|
278
|
+
raise ReopenException
|
279
|
+
end
|
280
|
+
|
281
|
+
def preset_atts
|
282
|
+
@reopen_deleted = true if @reopen_deleted.nil?
|
283
|
+
@reopen_suspicious = true if @reopen_suspicious.nil?
|
284
|
+
@break_if_eof = false if @break_if_eof.nil?
|
285
|
+
@return_if_eof = false if @return_if_eof.nil?
|
286
|
+
@max_interval ||= 10
|
287
|
+
@interval ||= @max_interval
|
288
|
+
@suspicious_interval ||= 60
|
289
|
+
@lines = 0
|
290
|
+
@no_read = 0
|
291
|
+
end
|
292
|
+
|
293
|
+
def restat
|
294
|
+
stat = File.stat(path)
|
295
|
+
if @stat
|
296
|
+
if stat.ino != @stat.ino or stat.dev != @stat.dev
|
297
|
+
@stat = nil
|
298
|
+
raise ReopenException.new(:top)
|
299
|
+
end
|
300
|
+
if stat.size < @stat.size
|
301
|
+
@stat = nil
|
302
|
+
raise ReopenException.new(:top)
|
303
|
+
end
|
304
|
+
else
|
305
|
+
@stat = stat
|
306
|
+
end
|
307
|
+
rescue Errno::ENOENT
|
308
|
+
rescue Errno::ESTALE
|
309
|
+
raise ReopenException
|
310
|
+
end
|
311
|
+
|
312
|
+
def sleep_interval
|
313
|
+
if @lines > 0
|
314
|
+
# estimate how much time we will spend on waiting for next line
|
315
|
+
@interval = (@interval.to_f / @lines)
|
316
|
+
@lines = 0
|
317
|
+
else
|
318
|
+
# exponential backoff if logfile is quiet
|
319
|
+
@interval *= 2
|
320
|
+
end
|
321
|
+
if @interval > @max_interval
|
322
|
+
# max. wait @max_interval
|
323
|
+
@interval = @max_interval
|
324
|
+
end
|
325
|
+
debug
|
326
|
+
sleep @interval
|
327
|
+
@no_read += @interval
|
328
|
+
end
|
329
|
+
|
330
|
+
def reopen_file(mode)
|
331
|
+
$DEBUG and $stdout.print "Reopening '#{path}', mode = #{mode}.\n"
|
332
|
+
@no_read = 0
|
333
|
+
reopen(path)
|
334
|
+
if mode == :bottom
|
335
|
+
rewind
|
336
|
+
end
|
337
|
+
rescue Errno::ESTALE
|
338
|
+
rescue Errno::ENOENT
|
339
|
+
if @reopen_deleted
|
340
|
+
sleep @max_interval
|
341
|
+
retry
|
342
|
+
else
|
343
|
+
raise DeletedException
|
344
|
+
end
|
345
|
+
end
|
346
|
+
|
347
|
+
def debug
|
348
|
+
$DEBUG or return
|
349
|
+
h = {
|
350
|
+
:lines => @lines,
|
351
|
+
:interval => @interval,
|
352
|
+
:no_read => @no_read,
|
353
|
+
}
|
354
|
+
$stderr.print h.inspect, "\n"
|
355
|
+
end
|
356
|
+
|
357
|
+
end
|
358
|
+
|
359
|
+
end
|
360
|
+
|
361
|
+
if $0 == __FILE__
|
362
|
+
filename = ARGV.shift or fail "Usage: #$0 filename [number]"
|
363
|
+
number = (ARGV.shift || 0).to_i
|
364
|
+
File.open(filename) do |log|
|
365
|
+
log.extend(File::Tail)
|
366
|
+
# Some settings to make watching tail.rb with "ruby -d" fun
|
367
|
+
log.interval = 1
|
368
|
+
log.max_interval = 5
|
369
|
+
log.reopen_deleted = true # is default
|
370
|
+
log.reopen_suspicious = true # is default
|
371
|
+
log.suspicious_interval = 20
|
372
|
+
number >= 0 ? log.rewind(number, 8192) : log.wind(-number)
|
373
|
+
#loop do # grab 5 lines at a time and return
|
374
|
+
# log.tail(5) { |line| puts line }
|
375
|
+
# print "Got 5!\n"
|
376
|
+
#end
|
377
|
+
log.tail { |line| puts line }
|
378
|
+
end
|
379
|
+
end
|
380
|
+
# vim: set et sw=2 ts=2:
|
data/make_doc.rb
ADDED
data/tests/test.rb
ADDED
@@ -0,0 +1,219 @@
|
|
1
|
+
#!/usr/bin/env ruby
|
2
|
+
|
3
|
+
require 'test/unit'
|
4
|
+
require 'file/tail'
|
5
|
+
require 'tempfile'
|
6
|
+
require 'timeout'
|
7
|
+
require 'thread'
|
8
|
+
|
9
|
+
class TC_FileTail < Test::Unit::TestCase
|
10
|
+
|
11
|
+
include File::Tail
|
12
|
+
|
13
|
+
def setup
|
14
|
+
@out = Tempfile.new("test")
|
15
|
+
append(@out, 100)
|
16
|
+
@in = File.new(@out.path)
|
17
|
+
@in.extend(File::Tail)
|
18
|
+
@in.interval = 0.4
|
19
|
+
@in.max_interval = 0.8
|
20
|
+
@in.reopen_deleted = true # is default
|
21
|
+
@in.reopen_suspicious = true # is default
|
22
|
+
@in.suspicious_interval = 60
|
23
|
+
end
|
24
|
+
|
25
|
+
def test_wind
|
26
|
+
[ 0, 1, 2, 10, 100 ].each do |lines|
|
27
|
+
@in.wind(lines)
|
28
|
+
assert_equal(100 - lines, count(@in))
|
29
|
+
end
|
30
|
+
@in.wind(101)
|
31
|
+
assert_equal(0, count(@in))
|
32
|
+
end
|
33
|
+
|
34
|
+
def test_rewind
|
35
|
+
[ 0, 1, 2, 10, 100 ].each do |lines|
|
36
|
+
@in.rewind(lines)
|
37
|
+
assert_equal(lines, count(@in))
|
38
|
+
end
|
39
|
+
@in.rewind(101)
|
40
|
+
assert_equal(100, count(@in))
|
41
|
+
end
|
42
|
+
|
43
|
+
def test_tail_with_block_without_n
|
44
|
+
timeout(10) do
|
45
|
+
lines = []
|
46
|
+
@in.rewind(1)
|
47
|
+
assert_raises(TimeoutError) do
|
48
|
+
timeout(1) { @in.tail { |l| lines << l } }
|
49
|
+
end
|
50
|
+
assert_equal(1, lines.size)
|
51
|
+
#
|
52
|
+
lines = []
|
53
|
+
@in.rewind(10)
|
54
|
+
assert_raises(TimeoutError) do
|
55
|
+
timeout(1) { @in.tail { |l| lines << l } }
|
56
|
+
end
|
57
|
+
assert_equal(10, lines.size)
|
58
|
+
#
|
59
|
+
lines = []
|
60
|
+
@in.rewind(100)
|
61
|
+
assert_raises(TimeoutError) do
|
62
|
+
timeout(1) { @in.tail { |l| lines << l } }
|
63
|
+
end
|
64
|
+
assert_equal(100, lines.size)
|
65
|
+
#
|
66
|
+
lines = []
|
67
|
+
@in.rewind(101)
|
68
|
+
assert_raises(TimeoutError) do
|
69
|
+
timeout(1) { @in.tail { |l| lines << l } }
|
70
|
+
end
|
71
|
+
end
|
72
|
+
end
|
73
|
+
|
74
|
+
def test_tail_with_block_with_n
|
75
|
+
timeout(10) do
|
76
|
+
@in.rewind(1)
|
77
|
+
lines = []
|
78
|
+
timeout(1) { @in.tail(0) { |l| lines << l } }
|
79
|
+
assert_equal(0, lines.size)
|
80
|
+
#
|
81
|
+
@in.rewind(1)
|
82
|
+
lines = []
|
83
|
+
timeout(1) { @in.tail(1) { |l| lines << l } }
|
84
|
+
assert_equal(1, lines.size)
|
85
|
+
#
|
86
|
+
@in.rewind(10)
|
87
|
+
lines = []
|
88
|
+
timeout(1) { @in.tail(10) { |l| lines << l } }
|
89
|
+
assert_equal(10, lines.size)
|
90
|
+
#
|
91
|
+
@in.rewind(100)
|
92
|
+
lines = []
|
93
|
+
@in.rewind(1)
|
94
|
+
assert_raises(TimeoutError) do
|
95
|
+
timeout(1) { @in.tail(2) { |l| lines << l } }
|
96
|
+
end
|
97
|
+
assert_equal(1, lines.size)
|
98
|
+
#
|
99
|
+
end
|
100
|
+
end
|
101
|
+
|
102
|
+
def test_tail_without_block_with_n
|
103
|
+
timeout(10) do
|
104
|
+
@in.rewind(1)
|
105
|
+
lines = []
|
106
|
+
timeout(1) { lines += @in.tail(0) }
|
107
|
+
assert_equal(0, lines.size)
|
108
|
+
#
|
109
|
+
@in.rewind(1)
|
110
|
+
lines = []
|
111
|
+
timeout(1) { lines += @in.tail(1) }
|
112
|
+
assert_equal(1, lines.size)
|
113
|
+
#
|
114
|
+
@in.rewind(10)
|
115
|
+
lines = []
|
116
|
+
timeout(1) { lines += @in.tail(10) }
|
117
|
+
assert_equal(10, lines.size)
|
118
|
+
#
|
119
|
+
@in.rewind(100)
|
120
|
+
lines = []
|
121
|
+
@in.rewind(1)
|
122
|
+
assert_raises(TimeoutError) do
|
123
|
+
timeout(1) { lines += @in.tail(2) }
|
124
|
+
end
|
125
|
+
assert_equal(0, lines.size)
|
126
|
+
#
|
127
|
+
end
|
128
|
+
end
|
129
|
+
|
130
|
+
def test_tail_withappend
|
131
|
+
@in.rewind
|
132
|
+
lines = []
|
133
|
+
threads = []
|
134
|
+
threads << Thread.new do
|
135
|
+
begin
|
136
|
+
timeout(1) { @in.tail { |l| lines << l } }
|
137
|
+
rescue TimeoutError
|
138
|
+
end
|
139
|
+
end
|
140
|
+
threads << Thread.new { append(@out, 10) }
|
141
|
+
threads.collect { |t| t.join }
|
142
|
+
assert_equal(10, lines.size)
|
143
|
+
end
|
144
|
+
|
145
|
+
def test_tail_truncated
|
146
|
+
@in.rewind
|
147
|
+
lines = []
|
148
|
+
threads = []
|
149
|
+
threads << appender = Thread.new do
|
150
|
+
Thread.stop
|
151
|
+
@out.close
|
152
|
+
File.truncate(@out.path, 0)
|
153
|
+
@out = File.new(@in.path, "a")
|
154
|
+
append(@out, 10)
|
155
|
+
end
|
156
|
+
threads << Thread.new do
|
157
|
+
begin
|
158
|
+
timeout(1) do
|
159
|
+
@in.tail do |l|
|
160
|
+
lines << l
|
161
|
+
lines.size == 100 and appender.wakeup
|
162
|
+
end
|
163
|
+
end
|
164
|
+
rescue TimeoutError
|
165
|
+
end
|
166
|
+
end
|
167
|
+
threads.collect { |t| t.wakeup and t.join }
|
168
|
+
assert_equal(10, lines.size)
|
169
|
+
end
|
170
|
+
|
171
|
+
def test_tail_remove
|
172
|
+
@in.rewind
|
173
|
+
lines = []
|
174
|
+
threads = []
|
175
|
+
threads << appender = Thread.new do
|
176
|
+
Thread.stop
|
177
|
+
@out.close
|
178
|
+
File.unlink(@in.path)
|
179
|
+
@out = File.new(@in.path, "w")
|
180
|
+
append(@out, 10)
|
181
|
+
end
|
182
|
+
threads << Thread.new do
|
183
|
+
begin
|
184
|
+
timeout(2) do
|
185
|
+
@in.tail do |l|
|
186
|
+
lines << l
|
187
|
+
lines.size == 100 and appender.wakeup
|
188
|
+
end
|
189
|
+
end
|
190
|
+
rescue TimeoutError
|
191
|
+
end
|
192
|
+
end
|
193
|
+
threads.collect { |t| t.wakeup and t.join }
|
194
|
+
assert_equal(10, lines.size)
|
195
|
+
end
|
196
|
+
|
197
|
+
def tear_down
|
198
|
+
@in.close
|
199
|
+
@out.close
|
200
|
+
end
|
201
|
+
|
202
|
+
private
|
203
|
+
|
204
|
+
def count(file)
|
205
|
+
n = 0
|
206
|
+
until file.eof?
|
207
|
+
file.readline
|
208
|
+
n += 1
|
209
|
+
end
|
210
|
+
return n
|
211
|
+
end
|
212
|
+
|
213
|
+
def append(file, n)
|
214
|
+
(1..n).each { |x| file << "#{x} #{"A" * 70}\n" }
|
215
|
+
file.flush
|
216
|
+
end
|
217
|
+
|
218
|
+
end
|
219
|
+
# vim: set noet sw=2 ts=2:
|
metadata
ADDED
@@ -0,0 +1,51 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
rubygems_version: 0.8.1
|
3
|
+
specification_version: 1
|
4
|
+
name: file-tail
|
5
|
+
version: !ruby/object:Gem::Version
|
6
|
+
version: 0.1.2
|
7
|
+
date: 2004-09-30
|
8
|
+
summary: File::Tail for Ruby
|
9
|
+
require_paths:
|
10
|
+
- lib
|
11
|
+
author: Florian Frank
|
12
|
+
email: flori@ping.de
|
13
|
+
homepage: http://file-tail.rubyforge.org
|
14
|
+
rubyforge_project: file-tail
|
15
|
+
description: ''
|
16
|
+
autorequire: file/tail
|
17
|
+
default_executable:
|
18
|
+
bindir: bin
|
19
|
+
has_rdoc: true
|
20
|
+
required_ruby_version: !ruby/object:Gem::Version::Requirement
|
21
|
+
requirements:
|
22
|
+
-
|
23
|
+
- ">"
|
24
|
+
- !ruby/object:Gem::Version
|
25
|
+
version: 0.0.0
|
26
|
+
version:
|
27
|
+
platform: ruby
|
28
|
+
files:
|
29
|
+
- README.en
|
30
|
+
- CHANGES
|
31
|
+
- GPL
|
32
|
+
- examples
|
33
|
+
- Rakefile
|
34
|
+
- VERSION
|
35
|
+
- install.rb
|
36
|
+
- make_doc.rb
|
37
|
+
- lib
|
38
|
+
- tests
|
39
|
+
- examples/pager.rb
|
40
|
+
- examples/tail.rb
|
41
|
+
- lib/file
|
42
|
+
- lib/file/tail.rb
|
43
|
+
- tests/test.rb
|
44
|
+
test_files:
|
45
|
+
- tests/test.rb
|
46
|
+
rdoc_options: []
|
47
|
+
extra_rdoc_files: []
|
48
|
+
executables: []
|
49
|
+
extensions: []
|
50
|
+
requirements: []
|
51
|
+
dependencies: []
|