Speakeasy2

Latest version: v0.1.3

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

Scan your dependencies

Page 1 of 2

0.1.9

Fixed

- Ensure weights are doubled if original graph was triangular since neighbor list collects edges in both direction if undirected.
- Calculation of skew.
- Calculation of mean link weight.
- Nurture stage changed to only work on subgraph containing only worst fitting nodes. Significantly improves performance on some graphs over working on entire graph.
- Previously one less than the requested number of partitions to be discarded was being discarded.

0.1.8

Changed

- (breaking) use igraph's interruption handlers instead of reinventing them.
- (breaking) use igraph's status handlers instead of creating se2 print / puts functions.

Fixed

- Inconsistent definition of `SE2PAR` macro which ended up set differently in different files.
- Mistake in managing the finally stack where `weights` was always getting cleaned instead of only cleaning if it existed.

0.1.7

Added

- Memory checks to workflows.

Changed

- Store labels heard instead of recalculating every step to improve speed at cost of memory.
- Manually calculate neighbors by iterating over edges to remove need for slow searches.

0.1.6

Added

- Error handling to allow graceful exit from threads if error occurs in any thread. This is primarily useful for high level interfaces as it should prevent crashing on error, allow memory cleanup on error, and make it easier to implement user interrupt.
- Ability to interrupt the process in high level interfaces.

Fixed

- Memory error in `remove_diagonal`.
- Move any function that can be supplied by a high level language outside of threaded code.

Changed

- Update igraph from 0.10.12 -> 0.10.13.
- Optimized performance.

0.1.5

Added

- `se2_knn_graph` to create k-nearest neighbor graph from a matrix.

Fixed

- Add explicit `void` in empty function prototype.
- Fix two memory leaks. 1. letting igraph allocated rng objects get destroyed before their memory was freed 2. When creating a new label, it was possible the element one step out of an array's bound was being accessed.
- Correct spelling of "reweigh".

Changed

- Return to including "igraph.h" instead of refined header files since igraph will expect this behavior in 1.0.0.
- Compile only subset of igraph files.
- Move from OpenMP -> pthreads. So CRAN will stop complaining.
- Move `order_nodes` to seperate C file.
- Use doxygen syntax to document public functions.

0.1.4

Added

- Print header to modify print behavior on a programming language basis.

Fixed

- Add OMP critical block to ensure print statements don't run in parallel. This was causing errors with R's `Rprintf` but I believe `printf` isn't guaranteed thread safe either. Should not impact performance since this occurs once per thread before starting the real work.

Changed

- Don't explicitly use internal igraph dependencies.
- Update to igraph 0.10.12.
- Explicitly include needed igraph headers instead of catchall "igraph.h".
- Touch up printed statements.

Page 1 of 2

© 2024 Safety CLI Cybersecurity Inc. All Rights Reserved.