c-ares is based on ares, and these are the people that have worked on it since
the fork was made:

Albert Chin
Alexander Lazic
Alexey Simak
Andreas Rieke
Andrew C. Morrow
Ashish Sharma
Ben Greear
Ben Noordhuis
BogDan Vatra
Brad House
Brad Spencer
Bram Matthys
Dan Fandrich
Daniel Johnson
Daniel Stenberg
David Stuart
Denis Bilenko
Dima Tisnek
Dirk Manske
Dominick Meglio
Doug Goldstein
Duncan Wilcox

the fork was made:

Albert Chin
Alex Loukissas
Alexander Klauer
Alexander Lazic
Alexey Simak
Andreas Rieke
Andrew Andkjar
Andrew Ayer
Andrew C. Morrow
Ashish Sharma
Ben Greear
Ben Noordhuis
BogDan Vatra
Brad House
Brad Spencer
Bram Matthys
Chris Araman
Dan Fandrich
Daniel Johnson
Daniel Stenberg
David Drysdale
David Stuart
Denis Bilenko
Dima Tisnek

"""
Extended Euclidean Algorithm.

Finds 2 numbers a and b such that it satisfies
the equation am + bn = gcd(m, n) (a.k.a Bezout's Identity)
"""

# @Author: S. Sharma <silentcat>
# @Date:   2019-02-25T12:08:53-06:00
# @Email:  ******@****.***
# @Last modified by:   PatOnTheBack
# @Last modified time: 2019-07-05

import sys


def extended_euclidean_algorithm(m, n):
    """
    Extended Euclidean Algorithm.

 * "()()[()]" is properly nested but "[(()]" is not. The function called
 * is_balanced takes as input a string S which is a sequence of brackets and
 * returns true if S is nested and false otherwise.
 *
 * @author akshay sharma
 * @author <a href="https://github.com/khalil2535">khalil2535<a>
 * @author shellhub
 */
class BalancedBrackets {

    /**
     * Check if {@code leftBracket} and {@code rightBracket} is paired or not
     *

"""
Code contributed by Honey Sharma
Source: https://en.wikipedia.org/wiki/Cycle_sort
"""


def cycle_sort(array: list) -> list:
    """
    >>> cycle_sort([4, 3, 2, 1])
    [1, 2, 3, 4]

    >>> cycle_sort([-4, 20, 0, -50, 100, -1])
    [-50, -4, -1, 0, 20, 100]

    >>> cycle_sort([-.1, -.2, 1.3, -.8])
    [-0.8, -0.2, -0.1, 1.3]

    >>> cycle_sort([])
    []
    """
    array_len = len(array)

~~~~~~~~~~~~~~~~~~~~~

The ALBERT model was proposed in `ALBERT: A Lite BERT for Self-supervised Learning of Language Representations <https://arxiv.org/abs/1909.11942>`_
by Zhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel, Piyush Sharma, Radu Soricut. It presents
two parameter-reduction techniques to lower memory consumption and increase the training speed of BERT:

- Splitting the embedding matrix into two smaller matrices

  instead of its sum over all samples. By `Hervé Bredin`_.

- The outcome of :func:`manifold.spectral_embedding` was made deterministic
  by flipping the sign of eigenvectors. By :user:`Hasil Sharma <Hasil-Sharma>`.

- Significant performance and memory usage improvements in
  :class:`preprocessing.PolynomialFeatures`. By `Eric Martin`_.

- Numerical stability improvements for :class:`preprocessing.StandardScaler`

Sebastian Schuberth <******@****.***> <******@****.***>
Seth Falcon <******@****.***> <******@****.***>
Shawn O. Pearce <******@****.***>
Wei Shuyu <******@****.***> Shuyu Wei
Sidhant Sharma <******@****.***> Sidhant Sharma [:tk]
Simon Hausmann <******@****.***> <******@****.***>
Simon Hausmann <******@****.***> <******@****.***>
Stefan Beller <******@****.***> <******@****.***>

Florent Bruneau <******@****.***> <******@****.***>
Francis Ricci <******@****.***> <******@****.***>
GauravDS <******@****.***> <gaurav.sharma@punchh.com>
Graydon Hoare <******@****.***> <******@****.***>
Greg Parker <******@****.***> <******@****.***>
Greg Titus <******@****.***>

        'Rai', 'Raimajhi', 'Rana', 'Ranabhat', 'Rasali', 'Rauniyar', 'Rawat', 'Regmi', 'Rijal', 'Rimal', 'Rinpoche',
        'Sarraf', 'Shah', 'Shahi', 'Shakya', 'Sharma', 'Sherpa', 'Shrestha', 'Silwal', 'Simkhada', 'Singh', 'Sitoula', 'Subedi',
        'Tamang', 'Tamrakar', 'Thakur', 'Thapa', 'Thapa Magar', 'Thuladhar', 'Thule', 'Tuladhar',
        'Upadhyaya',
        'Veswakar',