Tue, 30 Mar 2010 11:17:21 +0200 [undo] consistent is/is_instance_of processing stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 11:17:21 +0200] rev 5074
[undo] consistent is/is_instance_of processing
Tue, 30 Mar 2010 11:15:57 +0200 [repo] don't need rset description on those queries stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 11:15:57 +0200] rev 5073
[repo] don't need rset description on those queries
Tue, 30 Mar 2010 11:15:08 +0200 [cleanup] style fixes, add nodes, 0.2 cents refactorings stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 11:15:08 +0200] rev 5072
[cleanup] style fixes, add nodes, 0.2 cents refactorings
Tue, 30 Mar 2010 11:06:13 +0200 [undo] during undoing, call hooks in the [active]integrity and undo categories stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 11:06:13 +0200] rev 5071
[undo] during undoing, call hooks in the [active]integrity and undo categories
Tue, 30 Mar 2010 11:01:34 +0200 [repo] refactor fti operation to use set_operation and a single operation whatever the number of entities to ft index stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 11:01:34 +0200] rev 5070
[repo] refactor fti operation to use set_operation and a single operation whatever the number of entities to ft index
Tue, 30 Mar 2010 10:57:42 +0200 [querier] introduce RepeatList class, used to optimize size of data returned for result set description stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 10:57:42 +0200] rev 5069
[querier] introduce RepeatList class, used to optimize size of data returned for result set description When rql query has no ambiguity, we used to return the same description * N where N is the size of the result set. Returning RepeatList class avoid that multiplication. According to quick benchmark this improve performance for result set whose size is ~ > 50, has very small penalty for rset < 50, and in any case improve the size of data to be transfered over the network through pyro connection.
Tue, 30 Mar 2010 10:50:46 +0200 [repo] on add entity, set cache as soon as possible + fill type/source cache stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 10:50:46 +0200] rev 5068
[repo] on add entity, set cache as soon as possible + fill type/source cache
Tue, 30 Mar 2010 10:39:16 +0200 [repo] more efficient eid cache operations handling based on set_operation; refactor stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 10:39:16 +0200] rev 5067
[repo] more efficient eid cache operations handling based on set_operation; refactor * split CleanupEidTypeCache operation into one operation for deleted eids and another for added eids, and put them in cw.server.hook * for consistency, move fti unindexing handling from the repository to the system source * handling of deleted eids is done in plan execution (ssplanner), no needs to redo it in *delete_info -> no more need for _prepare_delete_info method, killed
Tue, 30 Mar 2010 10:28:41 +0200 [repo] move eschema_eid function from hooks.metadata to server.utils stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 10:28:41 +0200] rev 5066
[repo] move eschema_eid function from hooks.metadata to server.utils
Tue, 30 Mar 2010 10:20:03 +0200 [primary view] skip virtual rtypes anyway stable
Sylvain Thénault <sylvain.thenault@logilab.fr> [Tue, 30 Mar 2010 10:20:03 +0200] rev 5065
[primary view] skip virtual rtypes anyway
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 tip