Filename | /mnt/catalyst/koha/C4/ClassSortRoutine.pm |
Statements | Executed 31 statements in 701µs |
Calls | P | F | Exclusive Time |
Inclusive Time |
Subroutine |
---|---|---|---|---|---|
1 | 1 | 1 | 484µs | 496µs | BEGIN@20 | C4::ClassSortRoutine::
1 | 1 | 1 | 9µs | 15µs | BEGIN@24 | C4::ClassSortRoutine::
1 | 1 | 1 | 7µs | 13µs | BEGIN@21 | C4::ClassSortRoutine::
1 | 1 | 1 | 7µs | 9µs | BEGIN@25 | C4::ClassSortRoutine::
1 | 1 | 1 | 6µs | 55µs | BEGIN@27 | C4::ClassSortRoutine::
1 | 1 | 1 | 6µs | 6.66ms | GetSortRoutineNames | C4::ClassSortRoutine::
0 | 0 | 0 | 0s | 0s | GetClassSortKey | C4::ClassSortRoutine::
0 | 0 | 0 | 0s | 0s | _get_class_sort_key | C4::ClassSortRoutine::
Line | State ments |
Time on line |
Calls | Time in subs |
Code |
---|---|---|---|---|---|
1 | package C4::ClassSortRoutine; | ||||
2 | |||||
3 | # Copyright (C) 2007 LibLime | ||||
4 | # | ||||
5 | # This file is part of Koha. | ||||
6 | # | ||||
7 | # Koha is free software; you can redistribute it and/or modify it under the | ||||
8 | # terms of the GNU General Public License as published by the Free Software | ||||
9 | # Foundation; either version 2 of the License, or (at your option) any later | ||||
10 | # version. | ||||
11 | # | ||||
12 | # Koha is distributed in the hope that it will be useful, but WITHOUT ANY | ||||
13 | # WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR | ||||
14 | # A PARTICULAR PURPOSE. See the GNU General Public License for more details. | ||||
15 | # | ||||
16 | # You should have received a copy of the GNU General Public License along | ||||
17 | # with Koha; if not, write to the Free Software Foundation, Inc., | ||||
18 | # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. | ||||
19 | |||||
20 | 2 | 28µs | 2 | 509µs | # spent 496µs (484+13) within C4::ClassSortRoutine::BEGIN@20 which was called:
# once (484µs+13µs) by C4::ClassSource::BEGIN@25 at line 20 # spent 496µs making 1 call to C4::ClassSortRoutine::BEGIN@20
# spent 13µs making 1 call to strict::import |
21 | 2 | 25µs | 2 | 19µs | # spent 13µs (7+6) within C4::ClassSortRoutine::BEGIN@21 which was called:
# once (7µs+6µs) by C4::ClassSource::BEGIN@25 at line 21 # spent 13µs making 1 call to C4::ClassSortRoutine::BEGIN@21
# spent 6µs making 1 call to warnings::import |
22 | |||||
23 | 1 | 900ns | require Exporter; | ||
24 | 2 | 22µs | 2 | 20µs | # spent 15µs (9+6) within C4::ClassSortRoutine::BEGIN@24 which was called:
# once (9µs+6µs) by C4::ClassSource::BEGIN@25 at line 24 # spent 15µs making 1 call to C4::ClassSortRoutine::BEGIN@24
# spent 6µs making 1 call to Class::Factory::Util::import |
25 | 2 | 31µs | 2 | 11µs | # spent 9µs (7+2) within C4::ClassSortRoutine::BEGIN@25 which was called:
# once (7µs+2µs) by C4::ClassSource::BEGIN@25 at line 25 # spent 9µs making 1 call to C4::ClassSortRoutine::BEGIN@25
# spent 2µs making 1 call to C4::Context::import |
26 | |||||
27 | 2 | 372µs | 2 | 104µs | # spent 55µs (6+49) within C4::ClassSortRoutine::BEGIN@27 which was called:
# once (6µs+49µs) by C4::ClassSource::BEGIN@25 at line 27 # spent 55µs making 1 call to C4::ClassSortRoutine::BEGIN@27
# spent 49µs making 1 call to vars::import |
28 | |||||
29 | # set the version for version checking | ||||
30 | 1 | 1µs | $VERSION = 3.07.00.049; | ||
31 | |||||
32 | =head1 NAME | ||||
33 | |||||
34 | C4::ClassSortRoutine - base object for creation of classification sorting | ||||
35 | key generation routines | ||||
36 | |||||
37 | =head1 SYNOPSIS | ||||
38 | |||||
39 | use C4::ClassSortRoutine; | ||||
40 | |||||
41 | =head1 FUNCTIONS | ||||
42 | |||||
43 | =cut | ||||
44 | |||||
45 | 1 | 6µs | @ISA = qw(Exporter); | ||
46 | 1 | 500ns | @EXPORT = qw( | ||
47 | &GetSortRoutineNames | ||||
48 | &GetClassSortKey | ||||
49 | ); | ||||
50 | |||||
51 | # intialization code | ||||
52 | 1 | 400ns | my %loaded_routines = (); | ||
53 | 1 | 2µs | 1 | 6.66ms | my @sort_routines = GetSortRoutineNames(); # spent 6.66ms making 1 call to C4::ClassSortRoutine::GetSortRoutineNames |
54 | 1 | 700ns | foreach my $sort_routine (@sort_routines) { | ||
55 | 3 | 63µs | if (eval "require C4::ClassSortRoutine::$sort_routine") { # spent 3.08ms executing statements in string eval
# spent 2.97ms executing statements in string eval
# spent 2.55ms executing statements in string eval | ||
56 | 3 | 500ns | my $ref; | ||
57 | 3 | 80µs | eval "\$ref = \\\&C4::ClassSortRoutine::${sort_routine}::get_class_sort_key"; # spent 2µs executing statements in string eval
# spent 2µs executing statements in string eval
# spent 2µs executing statements in string eval | ||
58 | 3 | 53µs | if (eval "\$ref->(\"a\", \"b\")") { # spent 10µs executing statements in 3 string evals (merged) | ||
59 | $loaded_routines{$sort_routine} = $ref; | ||||
60 | } else { | ||||
61 | $loaded_routines{$sort_routine} = \&_get_class_sort_key; | ||||
62 | } | ||||
63 | } else { | ||||
64 | $loaded_routines{$sort_routine} = \&_get_class_sort_key; | ||||
65 | } | ||||
66 | } | ||||
67 | |||||
68 | =head2 GetSortRoutineNames | ||||
69 | |||||
70 | my @routines = GetSortRoutineNames(); | ||||
71 | |||||
72 | Get names of all modules under C4::ClassSortRoutine::*. Adding | ||||
73 | a new classification sorting routine can therefore be done | ||||
74 | simply by writing a new submodule under C4::ClassSortRoutine and | ||||
75 | placing it in the C4/ClassSortRoutine directory. | ||||
76 | |||||
77 | =cut | ||||
78 | |||||
79 | # spent 6.66ms (6µs+6.65) within C4::ClassSortRoutine::GetSortRoutineNames which was called:
# once (6µs+6.65ms) by C4::ClassSource::BEGIN@25 at line 53 | ||||
80 | 1 | 5µs | 1 | 6.65ms | return C4::ClassSortRoutine->subclasses(); # spent 6.65ms making 1 call to Class::Factory::Util::_subclasses |
81 | } | ||||
82 | |||||
83 | =head2 GetClassSortKey | ||||
84 | |||||
85 | my $cn_sort = GetClassSortKey($sort_routine, $cn_class, $cn_item); | ||||
86 | |||||
87 | Generates classification sorting key. If $sort_routine does not point | ||||
88 | to a valid submodule in C4::ClassSortRoutine, default to a basic | ||||
89 | normalization routine. | ||||
90 | |||||
91 | =cut | ||||
92 | |||||
93 | sub GetClassSortKey { | ||||
94 | my ($sort_routine, $cn_class, $cn_item) = @_; | ||||
95 | unless (exists $loaded_routines{$sort_routine}) { | ||||
96 | warn "attempting to use non-existent class sorting routine $sort_routine\n"; | ||||
97 | $loaded_routines{$sort_routine} = \&_get_class_sort_key; | ||||
98 | } | ||||
99 | my $key = $loaded_routines{$sort_routine}->($cn_class, $cn_item); | ||||
100 | # FIXME -- hardcoded length for cn_sort | ||||
101 | # should replace with some way of getting column widths from | ||||
102 | # the DB schema -- since doing this should ideally be | ||||
103 | # independent of the DBMS, deferring for the moment. | ||||
104 | return substr($key, 0, 30); | ||||
105 | } | ||||
106 | |||||
107 | =head2 _get_class_sort_key | ||||
108 | |||||
109 | Basic sorting function. Concatenates classification part | ||||
110 | and item, converts to uppercase, changes each run of | ||||
111 | whitespace to '_', and removes any non-digit, non-latin | ||||
112 | letter characters. | ||||
113 | |||||
114 | =cut | ||||
115 | |||||
116 | sub _get_class_sort_key { | ||||
117 | my ($cn_class, $cn_item) = @_; | ||||
118 | my $key = uc "$cn_class $cn_item"; | ||||
119 | $key =~ s/\s+/_/; | ||||
120 | $key =~ s/[^A-Z_0-9]//g; | ||||
121 | return $key; | ||||
122 | } | ||||
123 | |||||
124 | 1 | 10µs | 1; | ||
125 | |||||
126 | =head1 AUTHOR | ||||
127 | |||||
128 | Koha Development Team <http://koha-community.org/> | ||||
129 | |||||
130 | =cut | ||||
131 |