Skip to content

Conversation

mpenick
Copy link
Contributor

@mpenick mpenick commented Jul 29, 2016

No description provided.

mpenick added 3 commits July 13, 2016 16:29
- Token map now uses more efficient data structures
- Avoids allocating memory where possible
- Uses more efficient data types for tokens (for murmur3 and random
  partition tokens)
- Avoids comparing strings in tight loops, but instead uses integers.
- Removes the potential for quadratic runtime complexity in
  configurations where a datacenter exists in keyspace metadata, but
  doesn't have any hosts.
  - Fixes the following issues:
  [CPP-289] Avoid quadratic ring processing with invalid replication
  factors
  [CPP-389] Fix token aware routing issues
@aholmberg
Copy link
Contributor

I reviewed these changes in #309. Please see comments there.

Pending connections in a pool were incorrectly moved to use a map keyed
by address. This is incorrect as all addresses in a pool use the same
address. The number of connections tend to be extremely small so a
vector is good choice.
@mpenick mpenick force-pushed the 389 branch 2 times, most recently from 8177db8 to 1e6876e Compare August 17, 2016 18:41
@mpenick
Copy link
Contributor Author

mpenick commented Aug 17, 2016

Merged @ 4c744dc

@mpenick mpenick closed this Aug 17, 2016
@mpenick mpenick deleted the 389 branch August 22, 2016 20:32
mikefero pushed a commit that referenced this pull request Oct 25, 2019
* Fix bug in OpenSSL DNS verification code where certain certificate's CN
  wouldn't be matched correctly
* Fix bug in Socket DNS unit tests
* Fix client certificate validation in unit tests
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants