On Friday 27 July 2007 19:48:51 Jonathan Ellis wrote:
> I'd want to make sure this didn't hurt performance first. (Seems
> innocuous enough, but if it's in any sort of inner loop the extra
> hash lookup might be noticeable.)
if lookup is made once in the start of function, should be okay.
which inner loops are so sensitive?
btw there were so many redundantly made dicts and lists before...
my profiling showed (in february or march) that redundant
function-calls kill performance, all else goes negligible.
> On 7/27/07, svilen <[EMAIL PROTECTED]> wrote:
> > one suggesstion / request.
> >
> > As your changing everything anyway, can u replace all important
> > {} and dict() with some util.Dict, and set() with util.Set?
> > util.Ones can point to dict/set.
> > The reason is so they can be further globally replaced by user
> > with OrderedOnes, for example to achieve repeatability - tests
> > etc.
> >
> > example ones are:
> > MetaData.tables
> > unitofwork.UOWTransaction.dependencies
> > unitofwork.UOWTask.objects
> > mapperlib.Mapper.save_obj(): table_to_mapper = {}
> > mapperlib.Mapper._compile_properties(): self.__props = {}
> > sqlalchemy.topological.QueueDependencySorter.sort(): nodes = {}
> > these give 90% repeatabliity, but i could not make it 100%. )-:
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sqlalchemy" group.
To post to this group, send email to sqlalchemy@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups.google.com/group/sqlalchemy?hl=en
-~----------~----~----~----~------~----~------~--~---
