[augeas-devel] [Augeas] #41: Improve typechecker performance

[Augeas]

#41: Improve typechecker performance
-------------------------+--------------------------------------------------
 Reporter:  lutter       |       Owner:  lutter  
     Type:  enhancement  |      Status:  new     
 Priority:  major        |   Milestone:  wishlist
Component:  Augeas       |     Version:  devel   
 Keywords:               |  
-------------------------+--------------------------------------------------
 The major bottleneck in the typechecker is checking branches of unions for
 disjointness. fa_intersect(fa, fb) is very computationally intensive since
 it needs to traverse the product of fa and fb. Speeding up this operation
 would make the typechecker much faster. Ultimately, computing the full
 intersection is overkill. All we need is a way to check that fa and fb are
 disjoint.

 I have tried a few things, with no real speedup. Things I haven't tried
 (and which aren't very hard to do) are

  * Look at the sets of possible last characters of words in fa and fb; if
 those are disjoint, so are fa and fb as a whole
  * Try the above with suffixes of a fixed (small) length
  * Try to identify a small set of characters that all words in fa and fb
 have to contain; if those sets are disjoint, so are fa and fb

-- 
Ticket URL: <https://fedorahosted.org/augeas/ticket/41>
Augeas <http://augeas.net/>
a configuration API