![]() ![]() This also gives you multiple ways to get all of the priority levels (ex. Ideally, you'd never want that to be False, but if you separately manage deques and elem_sets then perhaps they could get out of sync. The fact that you assert sorted(()) = sorted(self.elem_sets.keys()) is an indication that you have a data dependency that could probably be refactored. For parity with Python sets rename put to insert. ![]() It may not be, and eliminating it makes the logic simpler (if you take my advice and use python heap stuff)
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |