hSr"SS\5rSSjr\S:Xa=SSKrSSKr\R"\R"\RS9R5 gg) zAfontTools.misc.classifyTools.py -- tools for classifying things. cF\rSrSrSrS SjrSrSrSrSr Sr S r S r g ) ClassifierzD Main Classifier object, used to classify things into similar sets. cX[5Ul/Ul0UlSUlXlg)NF)set_things_sets_mapping_dirty_sort)selfsorts N/var/www/html/env/lib/python3.13/site-packages/fontTools/misc/classifyTools.py__init__Classifier.__init__ s%u     c*U(dgSUlURURURpCn[ U5nUR U5nUR U5 UnAU(a/URU5 URU5 UHnXtU'M AU(asU[[U55n U R U5n U R U 5 UR U 5 URU 5 U HnXU'M A U(aMrgg)z9 Add a set to the classifier. Any iterable is accepted. NT) r rrr r intersectiondifference_updateupdateappendnextiter) r set_of_thingsthingssetsmappingsr differencething old_classold_class_intersections raddClassifier.adds  $ djj$--g  ~~f-  L)   MM* % KK ##!+$ T,%7 89I%.%;%;L%I "  ' '(> ?  * *+A B KK. //!70&lrc8UHnURU5 M g)zQ Add a a list of sets to the classifier. Any iterable of iterables is accepted. N)r")r list_of_setsrs rrClassifier.update;sA HHQKrcUR(dgURnUVs/sH o"(dM UPM snUlUR(a[URSS9UlSUlgs snf)Nc0[U5*[U54$)N)lensorted)rs r%Classifier._process..KsCF7F1I:Nr)keyF)r rr r*)r rrs r_processClassifier._processBsU{{ zz!%+Aa+ :: 0NODJ ,s A2A2c:UR5 UR$)zReturns the set of all things known so far. The return value belongs to the Classifier object and should NOT be modified while the classifier is still in use. )r.rr s r getThingsClassifier.getThingsQs ||rc:UR5 UR$)zReturns the mapping from things to their class set. The return value belongs to the Classifier object and should NOT be modified while the classifier is still in use. )r.r r1s r getMappingClassifier.getMappingZs }}rc:UR5 UR$)zReturns the list of class sets. The return value belongs to the Classifier object and should NOT be modified while the classifier is still in use. )r.rr1s r getClassesClassifier.getClassescs zzr)r r rr rNT) __name__ __module__ __qualname____firstlineno____doc__rr"rr.r2r5r8__static_attributes__rrrrs+('T rrcv[US9nURU5 UR5UR54$)a3 Takes a iterable of iterables (list of sets from here on; but any iterable works.), and returns the smallest list of sets such that each set, is either a subset, or is disjoint from, each of the input sets. In other words, this function classifies all the things present in any of the input sets, into similar classes, based on which sets things are a member of. If sort=True, return class sets are sorted by decreasing size and their natural sort order within each class size. Otherwise, class sets are returned in the order that they were identified, which is generally not significant. >>> classify([]) == ([], {}) True >>> classify([[]]) == ([], {}) True >>> classify([[], []]) == ([], {}) True >>> classify([[1]]) == ([{1}], {1: {1}}) True >>> classify([[1,2]]) == ([{1, 2}], {1: {1, 2}, 2: {1, 2}}) True >>> classify([[1],[2]]) == ([{1}, {2}], {1: {1}, 2: {2}}) True >>> classify([[1,2],[2]]) == ([{1}, {2}], {1: {1}, 2: {2}}) True >>> classify([[1,2],[2,4]]) == ([{1}, {2}, {4}], {1: {1}, 2: {2}, 4: {4}}) True >>> classify([[1,2],[2,4,5]]) == ( ... [{4, 5}, {1}, {2}], {1: {1}, 2: {2}, 4: {4, 5}, 5: {4, 5}}) True >>> classify([[1,2],[2,4,5]], sort=False) == ( ... [{1}, {4, 5}, {2}], {1: {1}, 2: {2}, 4: {4, 5}, 5: {4, 5}}) True >>> classify([[1,2,9],[2,4,5]], sort=False) == ( ... [{1, 9}, {4, 5}, {2}], {1: {1, 9}, 2: {2}, 4: {4, 5}, 5: {4, 5}, ... 9: {1, 9}}) True >>> classify([[1,2,9,15],[2,4,5]], sort=False) == ( ... [{1, 9, 15}, {4, 5}, {2}], {1: {1, 9, 15}, 2: {2}, 4: {4, 5}, ... 5: {4, 5}, 9: {1, 9, 15}, 15: {1, 9, 15}}) True >>> classes, mapping = classify([[1,2,9,15],[2,4,5],[15,5]], sort=False) >>> set([frozenset(c) for c in classes]) == set( ... [frozenset(s) for s in ({1, 9}, {4}, {2}, {5}, {15})]) True >>> mapping == {1: {1, 9}, 2: {2}, 4: {4}, 5: {5}, 9: {1, 9}, 15: {15}} True )r )rrr8r5)r%r classifiers rclassifyrDms:j&Jl#  "J$9$9$; ;;r__main__N) optionflagsr:) r?objectrrDr;sysdoctestexittestmodELLIPSISfailedrArrrOsReeP7