from rhodecode.lib.vcs.exceptions import RepositoryError, ChangesetDoesNotExistError,\

    ChangesetError, NodeDoesNotExistError, EmptyRepositoryError

from rhodecode.lib.utils2 import safe_int

from webob.exc import HTTPNotFound

log = logging.getLogger(__name__)

def _load_changelog_summary():

    p = safe_int(request.GET.get('page'), 1)

    size = safe_int(request.GET.get('size'), 10)

    def url_generator(**kw):

        return url('changelog_summary_home',

                   repo_name=c.rhodecode_db_repo.repo_name, size=size, **kw)

    collection = c.rhodecode_repo

    c.repo_changesets = RepoPage(collection, page=p,

                                 items_per_page=size,

                                 url=url_generator)

    page_revisions = [x.raw_id for x in list(c.repo_changesets)]

    c.comments = c.rhodecode_db_repo.get_comments(page_revisions)

    c.statuses = c.rhodecode_db_repo.statuses(page_revisions)

class ChangelogController(BaseRepoController):

    def __before__(self):

        super(ChangelogController, self).__before__()

        c.affected_files_cut_off = 60

    def _graph(self, repo, revs_int, repo_size, size, p):

        """

        Generates a DAG graph for repo

        :param repo:

        :param revs_int:

        :param repo_size:

        :param size:

        :param p:

        """

        if not revs_int:

            c.jsdata = json.dumps([])

            return

        data = []

        revs = revs_int

        dag = _dagwalker(repo, revs, repo.alias)

        dag = _colored(dag)

        for (id, type, ctx, vtx, edges) in dag:

            data.append(['', vtx, edges])

        c.jsdata = json.dumps(data)

    @LoginRequired()

    @HasRepoPermissionAnyDecorator('repository.read', 'repository.write',

                                   'repository.admin')

    def index(self, repo_name, revision=None, f_path=None):

        limit = 100

        default = 20

        if request.GET.get('size'):

            c.size = max(min(safe_int(request.GET.get('size')), limit), 1)

            session['changelog_size'] = c.size

            session.save()

        else:

            c.size = int(session.get('changelog_size', default))

        # min size must be 1

        c.size = max(c.size, 1)

        p = safe_int(request.GET.get('page', 1), 1)

        branch_name = request.GET.get('branch', None)

        c.changelog_for_path = f_path

        try:

            if f_path:

                log.debug('generating changelog for path %s' % f_path)

                # get the history for the file !

                tip_cs = c.rhodecode_repo.get_changeset()

                try:

                    collection = tip_cs.get_file_history(f_path)

                except (NodeDoesNotExistError, ChangesetError):

                    #this node is not present at tip !

                    try:

                        cs = self.__get_cs_or_redirect(revision, repo_name)

                        collection = cs.get_file_history(f_path)

                    except RepositoryError, e:

                        h.flash(str(e), category='warning')

                        redirect(h.url('changelog_home', repo_name=repo_name))

                collection = list(reversed(collection))

            else:

                collection = c.rhodecode_repo.get_changesets(start=0,

                                                        branch_name=branch_name)

            c.total_cs = len(collection)

            c.pagination = RepoPage(collection, page=p, item_count=c.total_cs,

            collection = list(c.pagination)

            page_revisions = [x.raw_id for x in c.pagination]

            c.comments = c.rhodecode_db_repo.get_comments(page_revisions)

            c.statuses = c.rhodecode_db_repo.statuses(page_revisions)

        except (EmptyRepositoryError), e:

            h.flash(str(e), category='warning')

            return redirect(url('summary_home', repo_name=c.repo_name))

        except (RepositoryError, ChangesetDoesNotExistError, Exception), e:

            log.error(traceback.format_exc())

            h.flash(str(e), category='error')

            return redirect(url('changelog_home', repo_name=c.repo_name))

        c.branch_name = branch_name

        c.branch_filters = [('', _('All Branches'))] + \

            [(k, k) for k in c.rhodecode_repo.branches.keys()]

        _revs = []

        if not f_path:

            _revs = [x.revision for x in c.pagination]

        self._graph(c.rhodecode_repo, _revs, c.total_cs, c.size, p)

        return render('changelog/changelog.html')

    @LoginRequired()

    @HasRepoPermissionAnyDecorator('repository.read', 'repository.write',

                                   'repository.admin')

    def changelog_details(self, cs):

        if request.environ.get('HTTP_X_PARTIAL_XHR'):

            c.cs = c.rhodecode_repo.get_changeset(cs)

            return render('changelog/changelog_details.html')

        raise HTTPNotFound()

    @LoginRequired()

    @HasRepoPermissionAnyDecorator('repository.read', 'repository.write',

                                   'repository.admin')

    def changelog_summary(self, repo_name):

        if request.environ.get('HTTP_X_PARTIAL_XHR'):

            _load_changelog_summary()

            return render('changelog/changelog_summary_data.html')

        raise HTTPNotFound()

    if isinstance(email_address, unicode):

        #hashlib crashes on unicode items

        email_address = safe_str(email_address)

    # construct the url

    gravatar_url = baseurl + hashlib.md5(email_address.lower()).hexdigest() + "?"

    gravatar_url += urllib.urlencode({'d': default, 's': str(size)})

    return gravatar_url

class Page(_Page):

    """

    Custom pager to match rendering style with YUI paginator

    """

    def _get_pos(self, cur_page, max_page, items):

        edge = (items / 2) + 1

        if (cur_page <= edge):

            radius = max(items / 2, items - cur_page)

        elif (max_page - cur_page) < edge:

            radius = (items - 1) - (max_page - cur_page)

        else:

            radius = items / 2

        left = max(1, (cur_page - (radius)))

        right = min(max_page, cur_page + (radius))

        return left, cur_page, right

    def _range(self, regexp_match):

        """

        Return range of linked pages (e.g. '1 2 [3] 4 5 6 7 8').

        Arguments:

        regexp_match

            A "re" (regular expressions) match object containing the

            radius of linked pages around the current page in

            regexp_match.group(1) as a string

        This function is supposed to be called as a callable in

        re.sub.

        """

        radius = int(regexp_match.group(1))

        # Compute the first and last page number within the radius

        # e.g. '1 .. 5 6 [7] 8 9 .. 12'

        # -> leftmost_page  = 5

        # -> rightmost_page = 9

        leftmost_page, _cur, rightmost_page = self._get_pos(self.page,

                                                            self.last_page,

                                                            (radius * 2) + 1)

        nav_items = []

        # Create a link to the first page (unless we are on the first page

        # or there would be no need to insert '..' spacers)

        if self.page != self.first_page and self.first_page < leftmost_page:

            nav_items.append(self._pagerlink(self.first_page, self.first_page))

        # Insert dots if there are pages between the first page

        # and the currently displayed page range

        if leftmost_page - self.first_page > 1:

            # Wrap in a SPAN tag if nolink_attr is set

            text = '..'

            if self.dotdot_attr:

                text = HTML.span(c=text, **self.dotdot_attr)

            nav_items.append(text)

        for thispage in xrange(leftmost_page, rightmost_page + 1):

            # Hilight the current page number and do not use a link

            if thispage == self.page:

                text = '%s' % (thispage,)

                # Wrap in a SPAN tag if nolink_attr is set

                if self.curpage_attr:

                    text = HTML.span(c=text, **self.curpage_attr)

                nav_items.append(text)

            # Otherwise create just a link to that page

            else:

                text = '%s' % (thispage,)

                nav_items.append(self._pagerlink(thispage, text))

        # Insert dots if there are pages between the displayed

        # page numbers and the end of the page range

        if self.last_page - rightmost_page > 1:

            text = '..'

            # Wrap in a SPAN tag if nolink_attr is set

            if self.dotdot_attr:

                text = HTML.span(c=text, **self.dotdot_attr)

            nav_items.append(text)

        # Create a link to the very last page (unless we are on the last

        # page or there would be no need to insert '..' spacers)

        if self.page != self.last_page and rightmost_page < self.last_page:

            nav_items.append(self._pagerlink(self.last_page, self.last_page))

        return self.separator.join(nav_items)

    def pager(self, format='~2~', page_param='page', partial_param='partial',

        show_if_single_page=False, separator=' ', onclick=None,

        symbol_first='<<', symbol_last='>>',

        symbol_previous='<', symbol_next='>',

        curpage_attr={'class': 'pager_curpage'},

        dotdot_attr={'class': 'pager_dotdot'}, **kwargs):

        self.curpage_attr = curpage_attr

        self.separator = separator

        self.pager_kwargs = kwargs

        self.page_param = page_param

        self.partial_param = partial_param

        self.onclick = onclick

        self.link_attr = link_attr

        self.dotdot_attr = dotdot_attr

        # Don't show navigator if there is no more than one page

        if self.page_count == 0 or (self.page_count == 1 and not show_if_single_page):

            return ''

        from string import Template

        # Replace ~...~ in token format by range of pages

        result = re.sub(r'~(\d+)~', self._range, format)

        # Interpolate '%' variables

        result = Template(result).safe_substitute({

            'first_page': self.first_page,

            'last_page': self.last_page,

            'page': self.page,

            'page_count': self.page_count,

            'items_per_page': self.items_per_page,

            'first_item': self.first_item,

            'last_item': self.last_item,

            'item_count': self.item_count,

            'link_first': self.page > self.first_page and \

                    self._pagerlink(self.first_page, symbol_first) or '',

            'link_last': self.page < self.last_page and \

                    self._pagerlink(self.last_page, symbol_last) or '',

            'link_previous': self.previous_page and \

                    self._pagerlink(self.previous_page, symbol_previous) \

                    or HTML.span(symbol_previous, class_="yui-pg-previous"),

            'link_next': self.next_page and \

                    self._pagerlink(self.next_page, symbol_next) \

                    or HTML.span(symbol_next, class_="yui-pg-next")

        })

        return literal(result)

#==============================================================================

# REPO PAGER, PAGER FOR REPOSITORY

#==============================================================================

class RepoPage(Page):

    def __init__(self, collection, page=1, items_per_page=20,

                 item_count=None, url=None, **kwargs):

        """Create a "RepoPage" instance. special pager for paging

        repository

        """

        self._url_generator = url

        # Safe the kwargs class-wide so they can be used in the pager() method

        self.kwargs = kwargs

        # Save a reference to the collection

        self.original_collection = collection

        self.collection = collection

        # The self.page is the number of the current page.

        # The first page has the number 1!

        try:

            self.page = int(page)  # make it int() if we get it as a string

        except (ValueError, TypeError):

            self.page = 1

        self.items_per_page = items_per_page

        # Unless the user tells us how many items the collections has

        # we calculate that ourselves.

        if item_count is not None:

            self.item_count = item_count

        else:

            self.item_count = len(self.collection)

        # Compute the number of the first and last available page

        if self.item_count > 0:

            self.first_page = 1

            self.page_count = int(math.ceil(float(self.item_count) /

                                            self.items_per_page))

            self.last_page = self.first_page + self.page_count - 1

            # Make sure that the requested page number is the range of

            # valid pages

            if self.page > self.last_page:

                self.page = self.last_page

            elif self.page < self.first_page:

                self.page = self.first_page

# -*- coding: utf-8 -*-

"""

    rhodecode.lib.indexers.__init__

    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    Whoosh indexing module for RhodeCode

    :created_on: Aug 17, 2010

    :author: marcink

    :copyright: (C) 2010-2012 Marcin Kuzminski <marcin@python-works.com>

    :license: GPLv3, see COPYING for more details.

"""

# 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/>.

import os

import sys

import logging

from os.path import dirname as dn, join as jn

#to get the rhodecode import

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 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 ''

            text=content,

            terms=self.highlight_items,

            analyzer=ANALYZER,

            fragmenter=FRAGMENTER,

            formatter=FORMATTER,

            top=top

        )

        return hl

# -*- coding: utf-8 -*-

"""

    rhodecode.lib.paster_commands.cache_keys

    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    cleanup-keys paster command for RhodeCode

    :created_on: mar 27, 2013

    :author: marcink

    :copyright: (C) 2010-2013 Marcin Kuzminski <marcin@python-works.com>

    :license: GPLv3, see COPYING for more details.

"""

# 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/>.

from __future__ import with_statement

import os

import sys

import logging

from rhodecode.model.meta import Session

rc_path = dn(dn(dn(os.path.realpath(__file__))))

sys.path.append(rc_path)

log = logging.getLogger(__name__)

class Command(BasePasterCommand):

    max_args = 1

    min_args = 1

    usage = "CONFIG_FILE"

    group_name = "RhodeCode"

    takes_config_file = -1

    parser = BasePasterCommand.standard_parser(verbose=True)

    summary = "Cache keys utils"

    def command(self):

        #get SqlAlchemy session

        self._init_session()

        _caches = CacheInvalidation.query().order_by(CacheInvalidation.cache_key).all()

        if self.options.show:

            for c_obj in _caches:

                print 'key:%s active:%s' % (c_obj.cache_key, c_obj.cache_active)

        elif self.options.cleanup:

            for c_obj in _caches:

                Session().delete(c_obj)

                print 'removing key:%s' % (c_obj.cache_key)

            Session().commit()

        else:

            print 'nothing done exiting...'

        sys.exit(0)

    def update_parser(self):

        self.parser.add_option(

            '--show',

            action='store_true',

            dest='show',

            help=("show existing cache keys with together with status")

        )

        self.parser.add_option(

            '--cleanup',

            action="store_true",

            dest="cleanup",

            help="cleanup existing cache keys"

        )

# -*- coding: utf-8 -*-

"""

    rhodecode.lib.paster_commands.cleanup

    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    cleanup-repos paster command for RhodeCode

    :created_on: Jul 14, 2012

    :author: marcink

    :copyright: (C) 2010-2012 Marcin Kuzminski <marcin@python-works.com>

    :license: GPLv3, see COPYING for more details.

"""

# 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/>.

from __future__ import with_statement

import os

import sys

import re

import shutil

import logging

import datetime

from rhodecode.lib.utils import BasePasterCommand, ask_ok, REMOVED_REPO_PAT

from rhodecode.lib.utils2 import safe_str

from rhodecode.model.db import RhodeCodeUi

log = logging.getLogger(__name__)

class Command(BasePasterCommand):

    max_args = 1

    min_args = 1

    usage = "CONFIG_FILE"

    group_name = "RhodeCode"

    takes_config_file = -1

    parser = BasePasterCommand.standard_parser(verbose=True)

    summary = "Cleanup deleted repos"

    def _parse_older_than(self, val):

        regex = re.compile(r'((?P<days>\d+?)d)?((?P<hours>\d+?)h)?((?P<minutes>\d+?)m)?((?P<seconds>\d+?)s)?')

        parts = regex.match(val)

        if not parts:

            return

        parts = parts.groupdict()

        time_params = {}

        for (name, param) in parts.iteritems():

            if param:

                time_params[name] = int(param)

        return datetime.timedelta(**time_params)

    def _extract_date(self, name):

        """

        Extract the date part from rm__<date> pattern of removed repos,

        and convert it to datetime object

        :param name:

        """

        date_part = name[4:19]  # 4:19 since we don't parse milisecods

        return datetime.datetime.strptime(date_part, '%Y%m%d_%H%M%S')

    def command(self):

        #get SqlAlchemy session

        self._init_session()

        repos_location = RhodeCodeUi.get_repos_location()

        to_remove = []

        for dn, dirs, f in os.walk(safe_str(repos_location)):

            alldirs = list(dirs)

            del dirs[:]

            if ('.hg' in alldirs or

                'objects' in alldirs and ('refs' in alldirs or 'packed-refs' in f)):

                continue

            for loc in alldirs:

                if REMOVED_REPO_PAT.match(loc):

                    to_remove.append([os.path.join(dn, loc),

                                      self._extract_date(loc)])

                else:

                    dirs.append(loc)

        #filter older than (if present)!

        now = datetime.datetime.now()

        older_than = self.options.older_than

        if older_than:

            to_remove_filtered = []

            older_than_date = self._parse_older_than(older_than)

            for name, date_ in to_remove:

                repo_age = now - date_

                if repo_age > older_than_date:

                    to_remove_filtered.append([name, date_])

            to_remove = to_remove_filtered

            print >> sys.stdout, 'removing %s deleted repos older than %s (%s)' \

                % (len(to_remove), older_than, older_than_date)

        else:

            print >> sys.stdout, 'removing all [%s] deleted repos' \

                % len(to_remove)

        if self.options.dont_ask or not to_remove:

            # don't ask just remove !

            remove = True

        else:

            remove = ask_ok('the following repositories will be deleted completely:\n%s\n'

                            'are you sure you want to remove them [y/n]?'

                            % ', \n'.join(['%s removed on %s'

                    % (safe_str(x[0]), safe_str(x[1])) for x in to_remove]))

        if remove:

            for path, date_ in to_remove:

                print >> sys.stdout, 'removing repository %s' % path

                shutil.rmtree(path)

        else:

            print 'nothing done exiting...'

            sys.exit(0)

    def update_parser(self):

        self.parser.add_option(

            '--older-than',

            action='store',

            dest='older_than',

            help=("only remove repos that have been removed "