1 # -*- coding: utf-8 -*-
2 from App
.class_init
import InitializeClass
3 from AccessControl
import ClassSecurityInfo
4 from Products
.CMFCore
.interfaces
import IIndexableObject
5 from Products
.CMFCore
.CatalogTool
import CatalogTool
as BaseCatalogTool
6 from Products
.CMFCore
.CatalogTool
import IndexableObjectWrapper
7 from Products
.PageTemplates
.PageTemplateFile
import PageTemplateFile
8 from Products
.CMFCore
.permissions
import ModifyPortalContent
9 from zope
.component
import queryMultiAdapter
10 from Products
.ZCatalog
.Catalog
import Catalog
14 # imports for Catalog class
15 from Products
.PluginIndexes
.interfaces
import ILimitedResultIndex
16 from Products
.ZCatalog
.Lazy
import LazyMap
, LazyCat
, LazyValues
17 from BTrees
.IIBTree
import intersection
, IISet
18 from BTrees
.IIBTree
import weightedIntersection
21 class SolrTransactionHook
:
22 ''' commit solr couplé sur le commit de la ZODB '''
23 def __init__(self
, connection
) :
24 self
.connection
= connection
26 def __call__(self
, status
) :
28 self
.connection
.commit()
29 self
.connection
.close()
31 self
.connection
.close()
33 class CatalogTool(BaseCatalogTool
) :
34 meta_type
= 'Legivoc Catalog'
35 security
= ClassSecurityInfo()
36 manage_options
= (BaseCatalogTool
.manage_options
[:5] +
37 ({'label' : 'Solr', 'action' : 'manage_solr'},) +
38 BaseCatalogTool
.manage_options
[5:])
39 manage_solr
= PageTemplateFile('www/manage_solr', globals())
42 def __init__(self
, idxs
=[]) :
43 super(CatalogTool
, self
).__init
__()
44 self
._catalog
= DelegatedCatalog()
45 self
.solr_url
= 'http://localhost:8983/solr'
46 self
.delegatedIndexes
= ('Title', 'Description', 'SearchableText')
48 security
.declarePrivate('solrAdd')
49 def solrAdd(self
, object, idxs
=[], uid
=None) :
50 if IIndexableObject
.providedBy(object):
53 w
= queryMultiAdapter( (object, self
), IIndexableObject
)
56 w
= IndexableObjectWrapper(object, self
)
58 uid
= uid
if uid
else self
.__url
(object)
59 idxs
= idxs
if idxs
!=[] else self
.delegatedIndexes
62 attr
= getattr(w
, name
, '')
63 data
[name
] = attr() if callable(attr
) else attr
64 c
= SolrConnection(self
.solr_url
)
66 txn
= transaction
.get()
67 txn
.addAfterCommitHook(SolrTransactionHook(c
))
70 # PortalCatalog api overloads
71 security
.declareProtected(ModifyPortalContent
, 'indexObject')
72 def indexObject(self
, object) :
73 """ Add to catalog and send to Solr """
74 super(CatalogTool
, self
).indexObject(object)
77 security
.declarePrivate('reindexObject')
78 def reindexObject(self
, object, idxs
=[], update_metadata
=1, uid
=None):
79 super(CatalogTool
, self
).reindexObject(object,
81 update_metadata
=update_metadata
,
84 # Filter out invalid indexes.
85 valid_indexes
= self
._catalog
.indexes
.keys()
86 idxs
= [i
for i
in idxs
if i
in valid_indexes
and i
in self
.delegatedIndexes
]
88 idxs
= self
.delegatedIndexes
91 self
.solrAdd(object, idxs
=idxs
, uid
=uid
)
93 security
.declarePrivate('unindexObject')
94 def unindexObject(self
, object):
95 """Remove from catalog.
97 super(CatalogTool
, self
).unindexObject(object)
98 c
= SolrConnection(self
.solr_url
)
99 url
= self
.__url
(object)
101 txn
= transaction
.get()
102 txn
.addAfterCommitHook(SolrTransactionHook(c
))
104 InitializeClass(CatalogTool
)
107 class DelegatedCatalog(Catalog
) :
108 '''C'est ici qu'on délègue effectivement à Solr '''
110 def search(self
, query
, sort_index
=None, reverse
=0, limit
=None, merge
=1):
111 """Iterate through the indexes, applying the query to each one. If
112 merge is true then return a lazy result set (sorted if appropriate)
113 otherwise return the raw (possibly scored) results for later merging.
114 Limit is used in conjuntion with sorting or scored results to inform
115 the catalog how many results you are really interested in. The catalog
116 can then use optimizations to save time and memory. The number of
117 results is not guaranteed to fall within the limit however, you should
118 still slice or batch the results as usual."""
120 rs
= None # resultset
122 # Indexes fulfill a fairly large contract here. We hand each
123 # index the query mapping we are given (which may be composed
124 # of some combination of web request, kw mappings or plain old dicts)
125 # and the index decides what to do with it. If the index finds work
126 # for itself in the query, it returns the results and a tuple of
127 # the attributes that were used. If the index finds nothing for it
128 # to do then it returns None.
130 # Canonicalize the request into a sensible query before passing it on
131 query
= self
.make_query(query
)
133 cr
= self
.getCatalogPlan(query
)
138 plan
= self
._sorted
_search
_indexes
(query
)
140 indexes
= self
.indexes
.keys()
143 # We can have bogus keys or the plan can contain index names
144 # that have been removed in the meantime
147 index
= self
.getIndex(i
)
148 _apply_index
= getattr(index
, "_apply_index", None)
149 if _apply_index
is None:
153 limit_result
= ILimitedResultIndex
.providedBy(index
)
155 r
= _apply_index(query
, rs
)
157 r
= _apply_index(query
)
161 # Short circuit if empty result
162 # BBB: We can remove the "r is not None" check in Zope 2.14
163 # once we don't need to support the "return everything" case
165 if r
is not None and not r
:
166 cr
.stop_split(i
, result
=None, limit
=limit_result
)
169 # provide detailed info about the pure intersection time
170 intersect_id
= i
+ '#intersection'
171 cr
.start_split(intersect_id
)
172 # weightedIntersection preserves the values from any mappings
173 # we get, as some indexes don't return simple sets
174 if hasattr(rs
, 'items') or hasattr(r
, 'items'):
175 _
, rs
= weightedIntersection(rs
, r
)
177 rs
= intersection(rs
, r
)
179 cr
.stop_split(intersect_id
)
181 # consider the time it takes to intersect the index result with
182 # the total resultset to be part of the index time
183 cr
.stop_split(i
, result
=r
, limit
=limit_result
)
187 cr
.stop_split(i
, result
=None, limit
=limit_result
)
189 # Try to deduce the sort limit from batching arguments
190 b_start
= int(query
.get('b_start', 0))
191 b_size
= query
.get('b_size', None)
192 if b_size
is not None:
195 if b_size
is not None:
196 limit
= b_start
+ b_size
197 elif limit
and b_size
is None:
201 # None of the indexes found anything to do with the query
202 # We take this to mean that the query was empty (an empty filter)
203 # and so we return everything in the catalog
204 warnings
.warn('Your query %s produced no query restriction. '
205 'Currently the entire catalog content is returned. '
206 'In Zope 2.14 this will result in an empty LazyCat '
207 'to be returned.' % repr(cr
.make_key(query
)),
208 DeprecationWarning, stacklevel
=3)
211 if sort_index
is None:
212 sequence
, slen
= self
._limit
_sequence
(self
.data
.items(), rlen
,
214 result
= LazyMap(self
.instantiate
, sequence
, slen
,
215 actual_result_count
=rlen
)
217 cr
.start_split('sort_on')
218 result
= self
.sortResults(
219 self
.data
, sort_index
, reverse
, limit
, merge
,
220 actual_result_count
=rlen
, b_start
=b_start
,
222 cr
.stop_split('sort_on', None)
224 # We got some results from the indexes.
225 # Sort and convert to sequences.
226 # XXX: The check for 'values' is really stupid since we call
227 # items() and *not* values()
229 if sort_index
is None and hasattr(rs
, 'items'):
230 # having a 'items' means we have a data structure with
231 # scores. Build a new result set, sort it by score, reverse
232 # it, compute the normalized score, and Lazify it.
235 # Don't bother to sort here, return a list of
236 # three tuples to be passed later to mergeResults
237 # note that data_record_normalized_score_ cannot be
238 # calculated and will always be 1 in this case
239 getitem
= self
.__getitem
__
240 result
= [(score
, (1, score
, rid
), getitem
)
241 for rid
, score
in rs
.items()]
243 cr
.start_split('sort_on')
245 rs
= rs
.byValue(0) # sort it by score
246 max = float(rs
[0][0])
248 # Here we define our getter function inline so that
249 # we can conveniently store the max value as a default arg
250 # and make the normalized score computation lazy
251 def getScoredResult(item
, max=max, self
=self
):
253 Returns instances of self._v_brains, or whatever is
254 passed into self.useBrains.
257 r
=self
._v
_result
_class
(self
.data
[key
])\
258 .__of
__(aq_parent(self
))
259 r
.data_record_id_
= key
260 r
.data_record_score_
= score
261 r
.data_record_normalized_score_
= int(100. * score
/ max)
264 sequence
, slen
= self
._limit
_sequence
(rs
, rlen
, b_start
,
266 result
= LazyMap(getScoredResult
, sequence
, slen
,
267 actual_result_count
=rlen
)
268 cr
.stop_split('sort_on', None)
270 elif sort_index
is None and not hasattr(rs
, 'values'):
272 if hasattr(rs
, 'keys'):
274 sequence
, slen
= self
._limit
_sequence
(rs
, rlen
, b_start
,
276 result
= LazyMap(self
.__getitem
__, sequence
, slen
,
277 actual_result_count
=rlen
)
279 # sort. If there are scores, then this block is not
280 # reached, therefore 'sort-on' does not happen in the
281 # context of a text index query. This should probably
282 # sort by relevance first, then the 'sort-on' attribute.
283 cr
.start_split('sort_on')
284 result
= self
.sortResults(rs
, sort_index
, reverse
, limit
,
285 merge
, actual_result_count
=rlen
, b_start
=b_start
,
287 cr
.stop_split('sort_on', None)