toxiproxy-cli h t

gives me an incorrect example for adding new toxic:

toxic add:
usage: toxiproxy-cli add --type --toxicName
--attribute <key=value> --upstream --downstream

example: toxiproxy-cli toxic add myProxy -t latency -n myToxic -a latency=100,jitter=50

This leads to:

Failed to add toxic: AddToxic: HTTP 409: toxic alre

Feature Request

Is your feature request related to a problem? Please describe:

At present, we support to define the percentage of injection errors and provides a number from 0-100 when to use IOChaos, but sometimes we want the smaller probability, such as 0.01%

**Describe the fe

Hey, thanks for this useful tool. The documentation has me confused, as it instructs installation via a helm deployment (which is cool), but 90% of the documentation references a binary (chaoskube) but there isn't any documentation on how to get access to that binary. Am I supposed to clone repository this and put something in my PATH? Am I expected to create a local binary which runs this tool

The current logo is acyclic. I think that using small, invisible nudges along the trajectory it might possible to move it into to a cyclic orbit.

If you find that interesting, could you provide me with the code that a generated the original animation?

In this arXiv paper: https://arxiv.org/abs/1904.05663 the authors discuss corrected transmission and refraction formulas for light and curved boundaries.

Even though in this package we don't have light rays (although we may have in the future, see #178 ) it still may be worth it to implement these laws as a function similar to [law_of_refraction](https://juliadynamics.github.io/DynamicalBil

The docstring of crossprediction, which btw we may want to rename to crossestimation has:

crossprediction(source_train, target_train, source_pred,

yet none of these terms are in the source code for the function , which reads:

function crossprediction(train_in ::AbstractVector{<:AbstractArray{T, Φ}},
                        train_out::AbstractVector{<:AbstractArray{T, Φ}}

Hi @tkf , since you contributed permentropy in #20, I'd appreciate it if you could answer the following questions:

1. What happens for points that are equal to their predecessor? There are different approaches in the literature: their order also defines which one is the largest. Or deciding at random. Or allowing permutations with equal positions. What happens in our implementation?
2. It is