Grandiso

Latest version: v2.2.0

Safety actively analyzes 681866 Python packages for vulnerabilities to keep your Python projects secure.

Scan your dependencies

Page 1 of 2

2.2.0

- Features
- (39) Adds streaming match generators (thanks davidmezzetti!)
- Fixes
- (37) Improve performance of `find_motifs` by remembering to actually update `_greatest_backbone_count` (thanks nobutoba!)

2.1.1

- Fixes
- Fixed a minor bug in which counts were one-off when using `count_only=False` and `limit=int`.
- Achieved 100% test coverage, woo!
- Added support for Python 3.6 (thanks aleclearmind!), and added 3.9 and 3.10 to CI.

2.1.0

- Features
- (23) Adds edge-attribute matching alongside node-attribute matching (thanks MelomanCool!), along with tests for attribute-matching (24)
- (25) Pass edge-attribute matching functions along through all methods to enable user-defined edge-attribute matching
- (27) Improves usage of the `interestingness` metric for sorting nodes in candidate-finding routing (thanks aleclearmind!)
- Housekeeping
- (26) Added a codecov config file to ignore setup.py from test suite

2.0.1

- Fixes
- Fixes an installation error where older versions of python misread the long description of the package
- Fixes a namespace resolution error in `queues`

2.0.0

- Features
- Memoize node match function calls, and enable the user to pass custom node match functions. This greatly improves worst-case performance by removing excess calls to the note match functions, at the cost of additional memory.
- Housekeeping
- Remove the `profile` argument and profiling flow. (For profiling needs, you can now pass a profiling queue from the `queues` submodule.)

1.2.0

- Features
- Adds a `queues` submodule to enable customized queue construction behavior (breadth-first or depth-first traversal).
- Adds a new `find_motifs_iter` function call which returns a generator. You can now sip results from this iterable without waiting for the full search to complete. Thanks to Raphtor!

Page 1 of 2

© 2024 Safety CLI Cybersecurity Inc. All Rights Reserved.