Files
@ aaa7c3331186
Branch filter:
Location: kallithea/rhodecode/lib/indexers/__init__.py - annotation
aaa7c3331186
6.2 KiB
text/x-python
Rename paster command setup-rhodecode to setup-db
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 | 04c9bb9ca6d6 a671db5bdd58 a671db5bdd58 a671db5bdd58 a671db5bdd58 6832ef664673 04c9bb9ca6d6 04c9bb9ca6d6 04c9bb9ca6d6 04c9bb9ca6d6 6832ef664673 04c9bb9ca6d6 a671db5bdd58 ffd45b185016 ffd45b185016 ffd45b185016 ffd45b185016 ffd45b185016 ffd45b185016 ffd45b185016 ffd45b185016 ffd45b185016 ffd45b185016 ffd45b185016 ffd45b185016 05528ad948c4 05528ad948c4 04d26165c3d9 1e757ac98988 05528ad948c4 e9f6b533a8f6 05528ad948c4 05528ad948c4 1e757ac98988 a08624dd675e 1e757ac98988 a42bfe8a9335 8ecfed1d8f8b 1e757ac98988 5f21a9dcb09d 5f21a9dcb09d b6c902d88472 1e757ac98988 1e757ac98988 1e757ac98988 b6c902d88472 a0ef98f2520b b6c902d88472 b6c902d88472 b6c902d88472 b6c902d88472 b6c902d88472 b6c902d88472 b6c902d88472 b6c902d88472 1e757ac98988 1e757ac98988 05528ad948c4 b6c902d88472 05528ad948c4 5f21a9dcb09d 88b0e82bcba4 66c778b8cb54 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 05528ad948c4 a08624dd675e a08624dd675e a08624dd675e a08624dd675e a08624dd675e a08624dd675e a08624dd675e a08624dd675e a08624dd675e 82fb2a161ddf 4c239e0dcbb7 4c239e0dcbb7 4c239e0dcbb7 65b2f150beb7 1e757ac98988 1e757ac98988 1e757ac98988 b6c902d88472 4c239e0dcbb7 05528ad948c4 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 05528ad948c4 05528ad948c4 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 02a7f263a849 1e757ac98988 1e757ac98988 1e757ac98988 02a7f263a849 02a7f263a849 b6c902d88472 1e757ac98988 b6c902d88472 b6c902d88472 05528ad948c4 1e757ac98988 1e757ac98988 5f21a9dcb09d 5f21a9dcb09d 88b0e82bcba4 88b0e82bcba4 88b0e82bcba4 5f21a9dcb09d 5f21a9dcb09d 88b0e82bcba4 88b0e82bcba4 ffd45b185016 82fb2a161ddf 82fb2a161ddf 82fb2a161ddf 82fb2a161ddf 82fb2a161ddf 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 05528ad948c4 05528ad948c4 05528ad948c4 1e757ac98988 05528ad948c4 1e757ac98988 05528ad948c4 1e757ac98988 1e757ac98988 1e757ac98988 1e757ac98988 65b2f150beb7 1e757ac98988 1e757ac98988 d5e42c00f3c1 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 05528ad948c4 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 5f21a9dcb09d 05528ad948c4 1e757ac98988 5f21a9dcb09d 65b2f150beb7 a42bfe8a9335 324b838250c9 b6c902d88472 b6c902d88472 b6c902d88472 b6c902d88472 b6c902d88472 b6c902d88472 05528ad948c4 | # -*- coding: utf-8 -*-
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
"""
rhodecode.lib.indexers.__init__
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Whoosh indexing module for RhodeCode
:created_on: Aug 17, 2010
:author: marcink
:copyright: (c) 2013 RhodeCode GmbH.
:license: GPLv3, see LICENSE for more details.
"""
import os
import sys
import logging
from os.path import dirname as dn, join as jn
# Add location of top level folder to sys.path
sys.path.append(dn(dn(dn(os.path.realpath(__file__)))))
from whoosh.analysis import RegexTokenizer, LowercaseFilter, StopFilter
from whoosh.fields import TEXT, ID, STORED, NUMERIC, BOOLEAN, Schema, FieldType, DATETIME
from whoosh.formats import Characters
from whoosh.highlight import highlight as whoosh_highlight, HtmlFormatter, ContextFragmenter
from rhodecode.lib.utils2 import LazyProperty
log = logging.getLogger(__name__)
# CUSTOM ANALYZER wordsplit + lowercase filter
ANALYZER = RegexTokenizer(expression=r"\w+") | LowercaseFilter()
#INDEX SCHEMA DEFINITION
SCHEMA = Schema(
fileid=ID(unique=True),
owner=TEXT(),
repository=TEXT(stored=True),
path=TEXT(stored=True),
content=FieldType(format=Characters(), analyzer=ANALYZER,
scorable=True, stored=True),
modtime=STORED(),
extension=TEXT(stored=True)
)
IDX_NAME = 'HG_INDEX'
FORMATTER = HtmlFormatter('span', between='\n<span class="break">...</span>\n')
FRAGMENTER = ContextFragmenter(200)
CHGSETS_SCHEMA = Schema(
raw_id=ID(unique=True, stored=True),
date=NUMERIC(stored=True),
last=BOOLEAN(),
owner=TEXT(),
repository=ID(unique=True, stored=True),
author=TEXT(stored=True),
message=FieldType(format=Characters(), analyzer=ANALYZER,
scorable=True, stored=True),
parents=TEXT(),
added=TEXT(),
removed=TEXT(),
changed=TEXT(),
)
CHGSET_IDX_NAME = 'CHGSET_INDEX'
# used only to generate queries in journal
JOURNAL_SCHEMA = Schema(
username=TEXT(),
date=DATETIME(),
action=TEXT(),
repository=TEXT(),
ip=TEXT(),
)
class WhooshResultWrapper(object):
def __init__(self, search_type, searcher, matcher, highlight_items,
repo_location):
self.search_type = search_type
self.searcher = searcher
self.matcher = matcher
self.highlight_items = highlight_items
self.fragment_size = 200
self.repo_location = repo_location
@LazyProperty
def doc_ids(self):
docs_id = []
while self.matcher.is_active():
docnum = self.matcher.id()
chunks = [offsets for offsets in self.get_chunks()]
docs_id.append([docnum, chunks])
self.matcher.next()
return docs_id
def __str__(self):
return '<%s at %s>' % (self.__class__.__name__, len(self.doc_ids))
def __repr__(self):
return self.__str__()
def __len__(self):
return len(self.doc_ids)
def __iter__(self):
"""
Allows Iteration over results,and lazy generate content
*Requires* implementation of ``__getitem__`` method.
"""
for docid in self.doc_ids:
yield self.get_full_content(docid)
def __getitem__(self, key):
"""
Slicing of resultWrapper
"""
i, j = key.start, key.stop
slices = []
for docid in self.doc_ids[i:j]:
slices.append(self.get_full_content(docid))
return slices
def get_full_content(self, docid):
res = self.searcher.stored_fields(docid[0])
log.debug('result: %s' % res)
if self.search_type == 'content':
full_repo_path = jn(self.repo_location, res['repository'])
f_path = res['path'].split(full_repo_path)[-1]
f_path = f_path.lstrip(os.sep)
content_short = self.get_short_content(res, docid[1])
res.update({'content_short': content_short,
'content_short_hl': self.highlight(content_short),
'f_path': f_path
})
elif self.search_type == 'path':
full_repo_path = jn(self.repo_location, res['repository'])
f_path = res['path'].split(full_repo_path)[-1]
f_path = f_path.lstrip(os.sep)
res.update({'f_path': f_path})
elif self.search_type == 'message':
res.update({'message_hl': self.highlight(res['message'])})
log.debug('result: %s' % res)
return res
def get_short_content(self, res, chunks):
return ''.join([res['content'][chunk[0]:chunk[1]] for chunk in chunks])
def get_chunks(self):
"""
Smart function that implements chunking the content
but not overlap chunks so it doesn't highlight the same
close occurrences twice.
"""
memory = [(0, 0)]
if self.matcher.supports('positions'):
for span in self.matcher.spans():
start = span.startchar or 0
end = span.endchar or 0
start_offseted = max(0, start - self.fragment_size)
end_offseted = end + self.fragment_size
if start_offseted < memory[-1][1]:
start_offseted = memory[-1][1]
memory.append((start_offseted, end_offseted,))
yield (start_offseted, end_offseted,)
def highlight(self, content, top=5):
if self.search_type not in ['content', 'message']:
return ''
hl = whoosh_highlight(
text=content,
terms=self.highlight_items,
analyzer=ANALYZER,
fragmenter=FRAGMENTER,
formatter=FORMATTER,
top=top
)
return hl
|