Initial commit of OpenSPARC T2 architecture model.
[OpenSPARC-T2-SAM] / sam-t2 / devtools / amd64 / man / man3 / Tie::Memoize.3
CommitLineData
920dae64
AT
1.\" Automatically generated by Pod::Man v1.37, Pod::Parser v1.32
2.\"
3.\" Standard preamble:
4.\" ========================================================================
5.de Sh \" Subsection heading
6.br
7.if t .Sp
8.ne 5
9.PP
10\fB\\$1\fR
11.PP
12..
13.de Sp \" Vertical space (when we can't use .PP)
14.if t .sp .5v
15.if n .sp
16..
17.de Vb \" Begin verbatim text
18.ft CW
19.nf
20.ne \\$1
21..
22.de Ve \" End verbatim text
23.ft R
24.fi
25..
26.\" Set up some character translations and predefined strings. \*(-- will
27.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
28.\" double quote, and \*(R" will give a right double quote. | will give a
29.\" real vertical bar. \*(C+ will give a nicer C++. Capital omega is used to
30.\" do unbreakable dashes and therefore won't be available. \*(C` and \*(C'
31.\" expand to `' in nroff, nothing in troff, for use with C<>.
32.tr \(*W-|\(bv\*(Tr
33.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
34.ie n \{\
35. ds -- \(*W-
36. ds PI pi
37. if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
38. if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch
39. ds L" ""
40. ds R" ""
41. ds C` ""
42. ds C' ""
43'br\}
44.el\{\
45. ds -- \|\(em\|
46. ds PI \(*p
47. ds L" ``
48. ds R" ''
49'br\}
50.\"
51.\" If the F register is turned on, we'll generate index entries on stderr for
52.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
53.\" entries marked with X<> in POD. Of course, you'll have to process the
54.\" output yourself in some meaningful fashion.
55.if \nF \{\
56. de IX
57. tm Index:\\$1\t\\n%\t"\\$2"
58..
59. nr % 0
60. rr F
61.\}
62.\"
63.\" For nroff, turn off justification. Always turn off hyphenation; it makes
64.\" way too many mistakes in technical documents.
65.hy 0
66.if n .na
67.\"
68.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
69.\" Fear. Run. Save yourself. No user-serviceable parts.
70. \" fudge factors for nroff and troff
71.if n \{\
72. ds #H 0
73. ds #V .8m
74. ds #F .3m
75. ds #[ \f1
76. ds #] \fP
77.\}
78.if t \{\
79. ds #H ((1u-(\\\\n(.fu%2u))*.13m)
80. ds #V .6m
81. ds #F 0
82. ds #[ \&
83. ds #] \&
84.\}
85. \" simple accents for nroff and troff
86.if n \{\
87. ds ' \&
88. ds ` \&
89. ds ^ \&
90. ds , \&
91. ds ~ ~
92. ds /
93.\}
94.if t \{\
95. ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
96. ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
97. ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
98. ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
99. ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
100. ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
101.\}
102. \" troff and (daisy-wheel) nroff accents
103.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
104.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
105.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
106.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
107.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
108.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
109.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
110.ds ae a\h'-(\w'a'u*4/10)'e
111.ds Ae A\h'-(\w'A'u*4/10)'E
112. \" corrections for vroff
113.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
114.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
115. \" for low resolution devices (crt and lpr)
116.if \n(.H>23 .if \n(.V>19 \
117\{\
118. ds : e
119. ds 8 ss
120. ds o a
121. ds d- d\h'-1'\(ga
122. ds D- D\h'-1'\(hy
123. ds th \o'bp'
124. ds Th \o'LP'
125. ds ae ae
126. ds Ae AE
127.\}
128.rm #[ #] #H #V #F C
129.\" ========================================================================
130.\"
131.IX Title "Tie::Memoize 3"
132.TH Tie::Memoize 3 "2001-09-21" "perl v5.8.8" "Perl Programmers Reference Guide"
133.SH "NAME"
134Tie::Memoize \- add data to hash when needed
135.SH "SYNOPSIS"
136.IX Header "SYNOPSIS"
137.Vb 5
138\& require Tie::Memoize;
139\& tie %hash, 'Tie::Memoize',
140\& \e&fetch, # The rest is optional
141\& $DATA, \e&exists,
142\& {%ini_value}, {%ini_existence};
143.Ve
144.SH "DESCRIPTION"
145.IX Header "DESCRIPTION"
146This package allows a tied hash to autoload its values on the first access,
147and to use the cached value on the following accesses.
148.PP
149Only read-accesses (via fetching the value or \f(CW\*(C`exists\*(C'\fR) result in calls to
150the functions; the modify-accesses are performed as on a normal hash.
151.PP
152The required arguments during \f(CW\*(C`tie\*(C'\fR are the hash, the package, and
153the reference to the \f(CW\*(C`FETCH\*(C'\fRing function. The optional arguments are
154an arbitrary scalar \f(CW$data\fR, the reference to the \f(CW\*(C`EXISTS\*(C'\fR function,
155and initial values of the hash and of the existence cache.
156.PP
157Both the \f(CW\*(C`FETCH\*(C'\fRing function and the \f(CW\*(C`EXISTS\*(C'\fR functions have the
158same signature: the arguments are \f(CW\*(C`$key, $data\*(C'\fR; \f(CW$data\fR is the same
159value as given as argument during \fItie()\fRing. Both functions should
160return an empty list if the value does not exist. If \f(CW\*(C`EXISTS\*(C'\fR
161function is different from the \f(CW\*(C`FETCH\*(C'\fRing function, it should return
162a \s-1TRUE\s0 value on success. The \f(CW\*(C`FETCH\*(C'\fRing function should return the
163intended value if the key is valid.
164.SH "Inheriting from \fBTie::Memoize\fP"
165.IX Header "Inheriting from Tie::Memoize"
166The structure of the \fItied()\fR data is an array reference with elements
167.PP
168.Vb 5
169\& 0: cache of known values
170\& 1: cache of known existence of keys
171\& 2: FETCH function
172\& 3: EXISTS function
173\& 4: $data
174.Ve
175.PP
176The rest is for internal usage of this package. In particular, if
177\&\s-1TIEHASH\s0 is overwritten, it should call \s-1SUPER::TIEHASH\s0.
178.SH "EXAMPLE"
179.IX Header "EXAMPLE"
180.Vb 6
181\& sub slurp {
182\& my ($key, $dir) = shift;
183\& open my $h, '<', "$dir/$key" or return;
184\& local $/; <$h> # slurp it all
185\& }
186\& sub exists { my ($key, $dir) = shift; return -f "$dir/$key" }
187.Ve
188.PP
189.Vb 3
190\& tie %hash, 'Tie::Memoize', \e&slurp, $directory, \e&exists,
191\& { fake_file1 => $content1, fake_file2 => $content2 },
192\& { pretend_does_not_exists => 0, known_to_exist => 1 };
193.Ve
194.PP
195This example treats the slightly modified contents of \f(CW$directory\fR as a
196hash. The modifications are that the keys \fIfake_file1\fR and
197\&\fIfake_file2\fR fetch values \f(CW$content1\fR and \f(CW$content2\fR, and
198\&\fIpretend_does_not_exists\fR will never be accessed. Additionally, the
199existence of \fIknown_to_exist\fR is never checked (so if it does not
200exists when its content is needed, the user of \f(CW%hash\fR may be confused).
201.SH "BUGS"
202.IX Header "BUGS"
203\&\s-1FIRSTKEY\s0 and \s-1NEXTKEY\s0 methods go through the keys which were already read,
204not all the possible keys of the hash.
205.SH "AUTHOR"
206.IX Header "AUTHOR"
207Ilya Zakharevich <mailto:perl\-module\-hash\-memoize@ilyaz.org>.