rset.py
changeset 11057 0b59724cb3f2
parent 11052 058bb3dc685f
child 11058 23eb30449fe5
--- a/rset.py	Mon Jan 04 18:40:30 2016 +0100
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,730 +0,0 @@
-# copyright 2003-2011 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
-# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
-#
-# This file is part of CubicWeb.
-#
-# CubicWeb is free software: you can redistribute it and/or modify it under the
-# terms of the GNU Lesser General Public License as published by the Free
-# Software Foundation, either version 2.1 of the License, or (at your option)
-# any later version.
-#
-# CubicWeb 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 Lesser General Public License for more
-# details.
-#
-# You should have received a copy of the GNU Lesser General Public License along
-# with CubicWeb.  If not, see <http://www.gnu.org/licenses/>.
-"""The `ResultSet` class which is returned as result of an rql query"""
-__docformat__ = "restructuredtext en"
-
-from warnings import warn
-
-from six import PY3
-from six.moves import range
-
-from logilab.common import nullobject
-from logilab.common.decorators import cached, clear_cache, copy_cache
-from rql import nodes, stmts
-
-from cubicweb import NotAnEntity, NoResultError, MultipleResultsError
-
-
-_MARKER = nullobject()
-
-
-class ResultSet(object):
-    """A result set wraps a RQL query result. This object implements
-    partially the list protocol to allow direct use as a list of
-    result rows.
-
-    :type rowcount: int
-    :param rowcount: number of rows in the result
-
-    :type rows: list
-    :param rows: list of rows of result
-
-    :type description: list
-    :param description:
-      result's description, using the same structure as the result itself
-
-    :type rql: str or unicode
-    :param rql: the original RQL query string
-    """
-
-    def __init__(self, results, rql, args=None, description=None, rqlst=None):
-        if rqlst is not None:
-            warn('[3.20] rqlst parameter is deprecated',
-                 DeprecationWarning, stacklevel=2)
-        self.rows = results
-        self.rowcount = results and len(results) or 0
-        # original query and arguments
-        self.rql = rql
-        self.args = args
-        # entity types for each cell (same shape as rows)
-        # maybe discarded if specified when the query has been executed
-        if description is None:
-            self.description = []
-        else:
-            self.description = description
-        # set to (limit, offset) when a result set is limited using the
-        # .limit method
-        self.limited = None
-        # set by the cursor which returned this resultset
-        self.req = None
-        # actions cache
-        self._rsetactions = None
-
-    def __str__(self):
-        if not self.rows:
-            return '<empty resultset %s>' % self.rql
-        return '<resultset %s (%s rows)>' % (self.rql, len(self.rows))
-
-    def __repr__(self):
-        if not self.rows:
-            return '<empty resultset for %r>' % self.rql
-        rows = self.rows
-        if len(rows) > 10:
-            rows = rows[:10] + ['...']
-        if len(rows) > 1:
-            # add a line break before first entity if more that one.
-            pattern = '<resultset %r (%s rows):\n%s>'
-        else:
-            pattern = '<resultset %r (%s rows): %s>'
-
-        if not self.description:
-            return pattern % (self.rql, len(self.rows),
-                                                     '\n'.join(str(r) for r in rows))
-        return pattern % (self.rql, len(self.rows),
-                                                 '\n'.join('%s (%s)' % (r, d)
-                                                           for r, d in zip(rows, self.description)))
-
-    def possible_actions(self, **kwargs):
-        if self._rsetactions is None:
-            self._rsetactions = {}
-        if kwargs:
-            key = tuple(sorted(kwargs.items()))
-        else:
-            key = None
-        try:
-            return self._rsetactions[key]
-        except KeyError:
-            actions = self.req.vreg['actions'].poss_visible_objects(
-                self.req, rset=self, **kwargs)
-            self._rsetactions[key] = actions
-            return actions
-
-    def __len__(self):
-        """returns the result set's size"""
-        return self.rowcount
-
-    def __getitem__(self, i):
-        """returns the ith element of the result set"""
-        return self.rows[i] #ResultSetRow(self.rows[i])
-
-    def __iter__(self):
-        """Returns an iterator over rows"""
-        return iter(self.rows)
-
-    def __add__(self, rset):
-        # XXX buggy implementation (.rql and .args attributes at least much
-        # probably differ)
-        # at least rql could be fixed now that we have union and sub-queries
-        # but I tend to think that since we have that, we should not need this
-        # method anymore (syt)
-        rset = ResultSet(self.rows+rset.rows, self.rql, self.args,
-                         self.description + rset.description)
-        rset.req = self.req
-        return rset
-
-    def copy(self, rows=None, descr=None):
-        if rows is None:
-            rows = self.rows[:]
-            descr = self.description[:]
-        rset = ResultSet(rows, self.rql, self.args, descr)
-        rset.req = self.req
-        return rset
-
-    def transformed_rset(self, transformcb):
-        """ the result set according to a given column types
-
-        :type transormcb: callable(row, desc)
-        :param transformcb:
-          a callable which should take a row and its type description as
-          parameters, and return the transformed row and type description.
-
-
-        :type col: int
-        :param col: the column index
-
-        :rtype: `ResultSet`
-        """
-        rows, descr = [], []
-        rset = self.copy(rows, descr)
-        for row, desc in zip(self.rows, self.description):
-            nrow, ndesc = transformcb(row, desc)
-            if ndesc: # transformcb returns None for ndesc to skip that row
-                rows.append(nrow)
-                descr.append(ndesc)
-        rset.rowcount = len(rows)
-        return rset
-
-    def filtered_rset(self, filtercb, col=0):
-        """filter the result set according to a given filtercb
-
-        :type filtercb: callable(entity)
-        :param filtercb:
-          a callable which should take an entity as argument and return
-          False if it should be skipped, else True
-
-        :type col: int
-        :param col: the column index
-
-        :rtype: `ResultSet`
-        """
-        rows, descr = [], []
-        rset = self.copy(rows, descr)
-        for i in range(len(self)):
-            if not filtercb(self.get_entity(i, col)):
-                continue
-            rows.append(self.rows[i])
-            descr.append(self.description[i])
-        rset.rowcount = len(rows)
-        return rset
-
-
-    def sorted_rset(self, keyfunc, reverse=False, col=0):
-        """sorts the result set according to a given keyfunc
-
-        :type keyfunc: callable(entity)
-        :param keyfunc:
-          a callable which should take an entity as argument and return
-          the value used to compare and sort
-
-        :type reverse: bool
-        :param reverse: if the result should be reversed
-
-        :type col: int
-        :param col: the column index. if col = -1, the whole row are used
-
-        :rtype: `ResultSet`
-        """
-        rows, descr = [], []
-        rset = self.copy(rows, descr)
-        if col >= 0:
-            entities = sorted(enumerate(self.entities(col)),
-                              key=lambda t: keyfunc(t[1]), reverse=reverse)
-        else:
-            entities = sorted(enumerate(self),
-                              key=lambda t: keyfunc(t[1]), reverse=reverse)
-        for index, _ in entities:
-            rows.append(self.rows[index])
-            descr.append(self.description[index])
-        rset.rowcount = len(rows)
-        return rset
-
-    def split_rset(self, keyfunc=None, col=0, return_dict=False):
-        """splits the result set in multiple result sets according to
-        a given key
-
-        :type keyfunc: callable(entity or FinalType)
-        :param keyfunc:
-          a callable which should take a value of the rset in argument and
-          return the value used to group the value. If not define, raw value
-          of the specified columns is used.
-
-        :type col: int
-        :param col: the column index. if col = -1, the whole row are used
-
-        :type return_dict: Boolean
-        :param return_dict: If true, the function return a mapping
-            (key -> rset) instead of a list of rset
-
-        :rtype: List of `ResultSet` or mapping of  `ResultSet`
-
-        """
-        result = []
-        mapping = {}
-        for idx, line in enumerate(self):
-            if col >= 0:
-                try:
-                    key = self.get_entity(idx, col)
-                except NotAnEntity:
-                    key = line[col]
-            else:
-                key = line
-            if keyfunc is not None:
-                key = keyfunc(key)
-
-            if key not in mapping:
-                rows, descr = [], []
-                rset = self.copy(rows, descr)
-                mapping[key] = rset
-                result.append(rset)
-            else:
-                rset = mapping[key]
-            rset.rows.append(self.rows[idx])
-            rset.description.append(self.description[idx])
-        for rset in result:
-            rset.rowcount = len(rset.rows)
-        if return_dict:
-            return mapping
-        else:
-            return result
-
-    def limited_rql(self):
-        """returns a printable rql for the result set associated to the object,
-        with limit/offset correctly set according to maximum page size and
-        currently displayed page when necessary
-        """
-        # try to get page boundaries from the navigation component
-        # XXX we should probably not have a ref to this component here (eg in
-        #     cubicweb)
-        nav = self.req.vreg['components'].select_or_none('navigation', self.req,
-                                                         rset=self)
-        if nav:
-            start, stop = nav.page_boundaries()
-            rql = self._limit_offset_rql(stop - start, start)
-        # result set may have be limited manually in which case navigation won't
-        # apply
-        elif self.limited:
-            rql = self._limit_offset_rql(*self.limited)
-        # navigation component doesn't apply and rset has not been limited, no
-        # need to limit query
-        else:
-            rql = self.printable_rql()
-        return rql
-
-    def _limit_offset_rql(self, limit, offset):
-        rqlst = self.syntax_tree()
-        if len(rqlst.children) == 1:
-            select = rqlst.children[0]
-            olimit, ooffset = select.limit, select.offset
-            select.limit, select.offset = limit, offset
-            rql = rqlst.as_string(kwargs=self.args)
-            # restore original limit/offset
-            select.limit, select.offset = olimit, ooffset
-        else:
-            newselect = stmts.Select()
-            newselect.limit = limit
-            newselect.offset = offset
-            aliases = [nodes.VariableRef(newselect.get_variable(chr(65+i), i))
-                       for i in range(len(rqlst.children[0].selection))]
-            for vref in aliases:
-                newselect.append_selected(nodes.VariableRef(vref.variable))
-            newselect.set_with([nodes.SubQuery(aliases, rqlst)], check=False)
-            newunion = stmts.Union()
-            newunion.append(newselect)
-            rql = newunion.as_string(kwargs=self.args)
-            rqlst.parent = None
-        return rql
-
-    def limit(self, limit, offset=0, inplace=False):
-        """limit the result set to the given number of rows optionally starting
-        from an index different than 0
-
-        :type limit: int
-        :param limit: the maximum number of results
-
-        :type offset: int
-        :param offset: the offset index
-
-        :type inplace: bool
-        :param inplace:
-          if true, the result set is modified in place, else a new result set
-          is returned and the original is left unmodified
-
-        :rtype: `ResultSet`
-        """
-        stop = limit+offset
-        rows = self.rows[offset:stop]
-        descr = self.description[offset:stop]
-        if inplace:
-            rset = self
-            rset.rows, rset.description = rows, descr
-            rset.rowcount = len(rows)
-            clear_cache(rset, 'description_struct')
-            if offset:
-                clear_cache(rset, 'get_entity')
-            # we also have to fix/remove from the request entity cache entities
-            # which get a wrong rset reference by this limit call
-            for entity in self.req.cached_entities():
-                if entity.cw_rset is self:
-                    if offset <= entity.cw_row < stop:
-                        entity.cw_row = entity.cw_row - offset
-                    else:
-                        entity.cw_rset = entity.as_rset()
-                        entity.cw_row = entity.cw_col = 0
-        else:
-            rset = self.copy(rows, descr)
-            if not offset:
-                # can copy built entity caches
-                copy_cache(rset, 'get_entity', self)
-        rset.limited = (limit, offset)
-        return rset
-
-    def printable_rql(self, encoded=_MARKER):
-        """return the result set's origin rql as a string, with arguments
-        substitued
-        """
-        if encoded is not _MARKER:
-            warn('[3.21] the "encoded" argument is deprecated', DeprecationWarning)
-        encoding = self.req.encoding
-        rqlstr = self.syntax_tree().as_string(kwargs=self.args)
-        if PY3:
-            return rqlstr
-        # sounds like we get encoded or unicode string due to a bug in as_string
-        if not encoded:
-            if isinstance(rqlstr, unicode):
-                return rqlstr
-            return unicode(rqlstr, encoding)
-        else:
-            if isinstance(rqlstr, unicode):
-                return rqlstr.encode(encoding)
-            return rqlstr
-
-    # client helper methods ###################################################
-
-    def entities(self, col=0):
-        """iter on entities with eid in the `col` column of the result set"""
-        for i in range(len(self)):
-            # may have None values in case of outer join (or aggregat on eid
-            # hacks)
-            if self.rows[i][col] is not None:
-                yield self.get_entity(i, col)
-
-    def iter_rows_with_entities(self):
-        """ iterates over rows, and for each row
-        eids are converted to plain entities
-        """
-        for i, row in enumerate(self):
-            _row = []
-            for j, col in enumerate(row):
-                try:
-                    _row.append(self.get_entity(i, j) if col is not None else col)
-                except NotAnEntity:
-                    _row.append(col)
-            yield _row
-
-    def complete_entity(self, row, col=0, skip_bytes=True):
-        """short cut to get an completed entity instance for a particular
-        row (all instance's attributes have been fetched)
-        """
-        entity = self.get_entity(row, col)
-        entity.complete(skip_bytes=skip_bytes)
-        return entity
-
-    @cached
-    def get_entity(self, row, col):
-        """convenience method for query retrieving a single entity, returns a
-        partially initialized Entity instance.
-
-        .. warning::
-
-          Due to the cache wrapping this function, you should NEVER give row as
-          a named parameter (i.e. `rset.get_entity(0, 1)` is OK but
-          `rset.get_entity(row=0, col=1)` isn't)
-
-        :type row,col: int, int
-        :param row,col:
-          row and col numbers localizing the entity among the result's table
-
-        :return: the partially initialized `Entity` instance
-        """
-        etype = self.description[row][col]
-        try:
-            eschema = self.req.vreg.schema.eschema(etype)
-            if eschema.final:
-                raise NotAnEntity(etype)
-        except KeyError:
-            raise NotAnEntity(etype)
-        return self._build_entity(row, col)
-
-    def one(self, col=0):
-        """Retrieve exactly one entity from the query.
-
-        If the result set is empty, raises :exc:`NoResultError`.
-        If the result set has more than one row, raises
-        :exc:`MultipleResultsError`.
-
-        :type col: int
-        :param col: The column localising the entity in the unique row
-
-        :return: the partially initialized `Entity` instance
-        """
-        if len(self) == 1:
-            return self.get_entity(0, col)
-        elif len(self) == 0:
-            raise NoResultError("No row was found for one()")
-        else:
-            raise MultipleResultsError("Multiple rows were found for one()")
-
-    def _build_entity(self, row, col):
-        """internal method to get a single entity, returns a partially
-        initialized Entity instance.
-
-        partially means that only attributes selected in the RQL query will be
-        directly assigned to the entity.
-
-        :type row,col: int, int
-        :param row,col:
-          row and col numbers localizing the entity among the result's table
-
-        :return: the partially initialized `Entity` instance
-        """
-        req = self.req
-        if req is None:
-            raise AssertionError('dont call get_entity with no req on the result set')
-        rowvalues = self.rows[row]
-        eid = rowvalues[col]
-        assert eid is not None
-        # return cached entity if exists. This also avoids potential recursion
-        # XXX should we consider updating a cached entity with possible
-        #     new attributes found in this resultset ?
-        try:
-            entity = req.entity_cache(eid)
-        except KeyError:
-            pass
-        else:
-            if entity.cw_rset is None:
-                # entity has no rset set, this means entity has been created by
-                # the querier (req is a repository session) and so jas no rset
-                # info. Add it.
-                entity.cw_rset = self
-                entity.cw_row = row
-                entity.cw_col = col
-            return entity
-        # build entity instance
-        etype = self.description[row][col]
-        entity = self.req.vreg['etypes'].etype_class(etype)(req, rset=self,
-                                                            row=row, col=col)
-        entity.eid = eid
-        # cache entity
-        req.set_entity_cache(entity)
-        # try to complete the entity if there are some additional columns
-        if len(rowvalues) > 1:
-            eschema = entity.e_schema
-            eid_col, attr_cols, rel_cols = self._rset_structure(eschema, col)
-            entity.eid = rowvalues[eid_col]
-            for attr, col_idx in attr_cols.items():
-                entity.cw_attr_cache[attr] = rowvalues[col_idx]
-            for (rtype, role), col_idx in rel_cols.items():
-                value = rowvalues[col_idx]
-                if value is None:
-                    if role == 'subject':
-                        rql = 'Any Y WHERE X %s Y, X eid %s'
-                    else:
-                        rql = 'Any Y WHERE Y %s X, X eid %s'
-                    rrset = ResultSet([], rql % (rtype, entity.eid))
-                    rrset.req = req
-                else:
-                    rrset = self._build_entity(row, col_idx).as_rset()
-                entity.cw_set_relation_cache(rtype, role, rrset)
-        return entity
-
-    @cached
-    def _rset_structure(self, eschema, entity_col):
-        eid_col = col = entity_col
-        rqlst = self.syntax_tree()
-        get_rschema = eschema.schema.rschema
-        attr_cols = {}
-        rel_cols = {}
-        if rqlst.TYPE == 'select':
-            # UNION query, find the subquery from which this entity has been
-            # found
-            select, col = rqlst.locate_subquery(entity_col, eschema.type, self.args)
-        else:
-            select = rqlst
-        # take care, due to outer join support, we may find None
-        # values for non final relation
-        for i, attr, role in attr_desc_iterator(select, col, entity_col):
-            rschema = get_rschema(attr)
-            if rschema.final:
-                if attr == 'eid':
-                    eid_col = i
-                else:
-                    attr_cols[attr] = i
-            else:
-                # XXX takefirst=True to remove warning triggered by ambiguous relations
-                rdef = eschema.rdef(attr, role, takefirst=True)
-                # only keep value if it can't be multivalued
-                if rdef.role_cardinality(role) in '1?':
-                    rel_cols[(attr, role)] = i
-        return eid_col, attr_cols, rel_cols
-
-    @cached
-    def syntax_tree(self):
-        """return the syntax tree (:class:`rql.stmts.Union`) for the
-        originating query. You can expect it to have solutions
-        computed and it will be properly annotated.
-        """
-        return self.req.vreg.parse(self.req, self.rql, self.args)
-
-    @cached
-    def column_types(self, col):
-        """return the list of different types in the column with the given col
-
-        :type col: int
-        :param col: the index of the desired column
-
-        :rtype: list
-        :return: the different entities type found in the column
-        """
-        return frozenset(struc[-1][col] for struc in self.description_struct())
-
-    @cached
-    def description_struct(self):
-        """return a list describing sequence of results with the same
-        description, e.g. :
-        [[0, 4, ('Bug',)]
-        [[0, 4, ('Bug',), [5, 8, ('Story',)]
-        [[0, 3, ('Project', 'Version',)]]
-        """
-        result = []
-        last = None
-        for i, row in enumerate(self.description):
-            if row != last:
-                if last is not None:
-                    result[-1][1] = i - 1
-                result.append( [i, None, row] )
-                last = row
-        if last is not None:
-            result[-1][1] = i
-        return result
-
-    def _locate_query_params(self, rqlst, row, col):
-        locate_query_col = col
-        etype = self.description[row][col]
-        # final type, find a better one to locate the correct subquery
-        # (ambiguous if possible)
-        eschema = self.req.vreg.schema.eschema
-        if eschema(etype).final:
-            for select in rqlst.children:
-                try:
-                    myvar = select.selection[col].variable
-                except AttributeError:
-                    # not a variable
-                    continue
-                for i in range(len(select.selection)):
-                    if i == col:
-                        continue
-                    coletype = self.description[row][i]
-                    # None description possible on column resulting from an
-                    # outer join
-                    if coletype is None or eschema(coletype).final:
-                        continue
-                    try:
-                        ivar = select.selection[i].variable
-                    except AttributeError:
-                        # not a variable
-                        continue
-                    # check variables don't comes from a subquery or are both
-                    # coming from the same subquery
-                    if getattr(ivar, 'query', None) is getattr(myvar, 'query', None):
-                        etype = coletype
-                        locate_query_col = i
-                        if len(self.column_types(i)) > 1:
-                            return etype, locate_query_col
-        return etype, locate_query_col
-
-    @cached
-    def related_entity(self, row, col):
-        """given an cell of the result set, try to return a (entity, relation
-        name) tuple to which this cell is linked.
-
-        This is especially useful when the cell is an attribute of an entity,
-        to get the entity to which this attribute belongs to.
-        """
-        rqlst = self.syntax_tree()
-        # UNION query, we've first to find a 'pivot' column to use to get the
-        # actual query from which the row is coming
-        etype, locate_query_col = self._locate_query_params(rqlst, row, col)
-        # now find the query from which this entity has been found. Returned
-        # select node may be a subquery with different column indexes.
-        select = rqlst.locate_subquery(locate_query_col, etype, self.args)[0]
-        # then get the index of root query's col in the subquery
-        col = rqlst.subquery_selection_index(select, col)
-        if col is None:
-            # XXX unexpected, should fix subquery_selection_index ?
-            return None, None
-        try:
-            myvar = select.selection[col].variable
-        except AttributeError:
-            # not a variable
-            return None, None
-        rel = myvar.main_relation()
-        if rel is not None:
-            index = rel.children[0].root_selection_index()
-            if index is not None and self.rows[row][index]:
-                try:
-                    entity = self.get_entity(row, index)
-                    return entity, rel.r_type
-                except NotAnEntity as exc:
-                    return None, None
-        return None, None
-
-    @cached
-    def searched_text(self):
-        """returns the searched text in case of full-text search
-
-        :return: searched text or `None` if the query is not
-                 a full-text query
-        """
-        rqlst = self.syntax_tree()
-        for rel in rqlst.iget_nodes(nodes.Relation):
-            if rel.r_type == 'has_text':
-                __, rhs = rel.get_variable_parts()
-                return rhs.eval(self.args)
-        return None
-
-def _get_variable(term):
-    # XXX rewritten const
-    # use iget_nodes for (hack) case where we have things like MAX(V)
-    for vref in term.iget_nodes(nodes.VariableRef):
-        return vref.variable
-
-def attr_desc_iterator(select, selectidx, rootidx):
-    """return an iterator on a list of 2-uple (index, attr_relation)
-    localizing attribute relations of the main variable in a result's row
-
-    :type rqlst: rql.stmts.Select
-    :param rqlst: the RQL syntax tree to describe
-
-    :return:
-      a generator on (index, relation, target) describing column being
-      attribute of the main variable
-    """
-    rootselect = select
-    while rootselect.parent.parent is not None:
-        rootselect = rootselect.parent.parent.parent
-    rootmain = rootselect.selection[selectidx]
-    rootmainvar = _get_variable(rootmain)
-    assert rootmainvar
-    root = rootselect.parent
-    selectmain = select.selection[selectidx]
-    for i, term in enumerate(rootselect.selection):
-        try:
-            # don't use _get_variable here: if the term isn't a variable
-            # (function...), we don't want it to be used as an entity attribute
-            # or relation's value (XXX beside MAX/MIN trick?)
-            rootvar = term.variable
-        except AttributeError:
-            continue
-        if rootvar.name == rootmainvar.name:
-            continue
-        if select is not rootselect and isinstance(rootvar, nodes.ColumnAlias):
-            term = select.selection[root.subquery_selection_index(select, i)]
-        var = _get_variable(term)
-        if var is None:
-            continue
-        for ref in var.references():
-            rel = ref.relation()
-            if rel is None or rel.is_types_restriction():
-                continue
-            lhs, rhs = rel.get_variable_parts()
-            if selectmain.is_equivalent(lhs):
-                if rhs.is_equivalent(term):
-                    yield (i, rel.r_type, 'subject')
-            elif selectmain.is_equivalent(rhs):
-                if lhs.is_equivalent(term):
-                    yield (i, rel.r_type, 'object')