Go to the latest version of this document.
search in docstrings

Search bar offers the following options:

- Term presence. The below example searches for documents that must contain “foo”, might contain “bar” and must not contain “baz”: `+foo bar -baz`
- Wildcards. The below example searches for documents with words beginning with “foo”: `foo*`
- Search in specific fields. The following search matches all objects in "twisted.mail" that matches “search”: `+qname:twisted.mail.* +search`

  Possible fields: 'name', 'qname' (fully qualified name), 'docstring', and 'kind'. Last two fields are only applicable if "search in docstrings" is enabled.

- Fuzzy matches. The following search matches all documents that have a word within 1 edit distance of “foo”: `foo~1`

Results provided by Lunr.js

# ``twisted`.`conch`.`ssh`.`_kex`.`_IKexAlgorithm``

interface documentation

`class _IKexAlgorithm(Interface): (source)`

Known subclasses: `twisted.conch.ssh._kex._IEllipticCurveExchangeKexAlgorithm`, `twisted.conch.ssh._kex._IFixedGroupKexAlgorithm`, `twisted.conch.ssh._kex._IGroupExchangeKexAlgorithm`

View In Hierarchy

An `_IKexAlgorithm` describes a key exchange algorithm.

Attribute | `hashProcessor` | A callable hash algorithm constructor (e.g. `hashlib.sha256`) suitable for use with this key exchange algorithm.
Attribute | `preference` | An `int` giving the preference of the algorithm when negotiating key exchange. Algorithms with lower precedence values are more preferred.

hashProcessor = (source)

A callable hash algorithm constructor (e.g. `hashlib.sha256`) suitable for use with this key exchange algorithm.

preference = (source)

An `int` giving the preference of the algorithm when negotiating key exchange. Algorithms with lower precedence values are more preferred.