Most of the regular expression engines use backtracking to try all
possible execution paths of the regular expression when evaluating an
input, in some cases it can cause performance issues, called
catastrophic backtracking situations.

In the worst case, the complexity of the regular expression is
exponential in the size of the input, this means that a small
carefully-crafted input (like 20 chars) can trigger catastrophic
backtracking and cause a denial of service of the application.

Super-linear regex complexity can lead to the same impact too with, in
this case, a large carefully-crafted input (thousands chars).

Signed-off-by: Chris Sdogkos <work@chris-sdogkos.com>

- docs(calculateSubscribeTarget): improve JavaDocs
- refactor: rename to DynamicVoiceChannelListener

Signed-off-by: Chris Sdogkos <work@chris-sdogkos.com>

Signed-off-by: Chris Sdogkos <work@chris-sdogkos.com>