> Can you add "remove" and "intersect" modes for completeness? > This way we'd have all operators found in set theory. > > Examples: > Assuming f1 contains: [1,4] > > mode="replace" with arguments [1,2] produces [1,2] > mode="append" with arguments [2,3,4] produces [1,2,3,4] (A u B) > mode="intersect" with arguments [1,2,3] produces [1] (A ^ B) > mode="remove" with arguments [1,2] produces [4] (A ^ ~B)
I could add IntersectWith and RemoveFrom methods in mine scenario. Not sure whether this is doable under xml merge proposed by Ian. There also could be problem with includes/excludes etc. Moreover we should think more generally as this should be enabled in all types (notjust FileSet). > BTW. How to copy the fileset and store it with a different name? Good point I thinks it is currently impossible... Any proposals? Martin ------------------------------------------------------- This SF.net email is sponsored by: Perforce Software. Perforce is the Fast Software Configuration Management System offering advanced branching capabilities and atomic changes on 50+ platforms. Free Eval! http://www.perforce.com/perforce/loadprog.html _______________________________________________ nant-developers mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/nant-developers
