code string | signature string | docstring string | loss_without_docstring float64 | loss_with_docstring float64 | factor float64 |
|---|---|---|---|---|---|
should_gzip = app.config.get('FLASKS3_GZIP')
add_mime = app.config.get('FLASKS3_FORCE_MIMETYPE')
gzip_include_only = app.config.get('FLASKS3_GZIP_ONLY_EXTS')
new_hashes = []
static_folder_rel = _path_to_relative_url(static_folder)
for file_path in files:
per_file_should_gzip = shoul... | def _write_files(s3, app, static_url_loc, static_folder, files, bucket,
ex_keys=None, hashes=None) | Writes all the files inside a static folder to S3. | 2.866282 | 2.857275 | 1.003152 |
default_value = DEFAULT_SETTINGS.get(name, None)
return app.config.get(name, default_value) if app else default_value | def get_setting(name, app=None) | Returns the value for `name` settings (looks into `app` config, and into
DEFAULT_SETTINGS). Returns None if not set.
:param name: (str) name of a setting (e.g. FLASKS3_URL_STYLE)
:param app: Flask app instance
:return: setting value or None | 2.986238 | 3.093801 | 0.965233 |
for k, v in DEFAULT_SETTINGS.items():
app.config.setdefault(k, v)
if app.debug and not get_setting('FLASKS3_DEBUG', app):
app.config['FLASKS3_ACTIVE'] = False
if get_setting('FLASKS3_ACTIVE', app):
app.jinja_env.globals['url_for'] = url_for
... | def init_app(self, app) | An alternative way to pass your :class:`flask.Flask` application
object to Flask-S3. :meth:`init_app` also takes care of some
default `settings`_.
:param app: the :class:`flask.Flask` application object. | 2.543677 | 2.65891 | 0.956662 |
if not subsequence:
raise ValueError('Given subsequence is empty!')
max_substitutions, max_insertions, max_deletions, max_l_dist = search_params.unpacked
max_substitutions = min(max_substitutions, max_l_dist)
max_insertions = min(max_insertions, max_l_dist)
subseq_len = len(subsequen... | def find_near_matches_no_deletions_ngrams(subsequence, sequence, search_params) | search for near-matches of subsequence in sequence
This searches for near-matches, where the nearly-matching parts of the
sequence must meet the following limitations (relative to the subsequence):
* the maximum allowed number of character substitutions
* the maximum allowed number of new characters i... | 2.031502 | 2.053609 | 0.989235 |
search_params = LevenshteinSearchParams(max_substitutions,
max_insertions,
max_deletions,
max_l_dist)
search_func = choose_search_func(search_params)
return search_func(su... | def find_near_matches(subsequence, sequence,
max_substitutions=None,
max_insertions=None,
max_deletions=None,
max_l_dist=None) | search for near-matches of subsequence in sequence
This searches for near-matches, where the nearly-matching parts of the
sequence must meet the following limitations (relative to the subsequence):
* the maximum allowed number of character substitutions
* the maximum allowed number of new characters i... | 2.831794 | 2.940629 | 0.962989 |
_check_arguments(subsequence, sequence, max_substitutions)
if max_substitutions == 0:
return [
Match(start_index, start_index + len(subsequence), 0)
for start_index in search_exact(subsequence, sequence)
]
elif len(subsequence) // (max_substitutions + 1) >= 3:
... | def find_near_matches_substitutions(subsequence, sequence, max_substitutions) | Find near-matches of the subsequence in the sequence.
This chooses a suitable fuzzy search implementation according to the given
parameters.
Returns a list of fuzzysearch.Match objects describing the matching parts
of the sequence. | 2.518086 | 2.639465 | 0.954014 |
_check_arguments(subsequence, sequence, max_substitutions)
return list(_find_near_matches_substitutions_lp(subsequence, sequence,
max_substitutions)) | def find_near_matches_substitutions_lp(subsequence, sequence,
max_substitutions) | search for near-matches of subsequence in sequence
This searches for near-matches, where the nearly-matching parts of the
sequence must meet the following limitations (relative to the subsequence):
* the number of character substitutions must be less than max_substitutions
* no deletions or insertions... | 2.571219 | 3.704321 | 0.694114 |
_check_arguments(subsequence, sequence, max_substitutions)
match_starts = set()
matches = []
for match in _find_near_matches_substitutions_ngrams(subsequence, sequence,
max_substitutions):
if match.start not in match_starts:
... | def find_near_matches_substitutions_ngrams(subsequence, sequence,
max_substitutions) | search for near-matches of subsequence in sequence
This searches for near-matches, where the nearly-matching parts of the
sequence must meet the following limitations (relative to the subsequence):
* the number of character substitutions must be less than max_substitutions
* no deletions or insertions... | 2.177779 | 2.62714 | 0.828954 |
_check_arguments(subsequence, sequence, max_substitutions)
for match in _find_near_matches_substitutions_ngrams(subsequence, sequence,
max_substitutions):
return True
return False | def has_near_match_substitutions_ngrams(subsequence, sequence,
max_substitutions) | search for near-matches of subsequence in sequence
This searches for near-matches, where the nearly-matching parts of the
sequence must meet the following limitations (relative to the subsequence):
* the number of character substitutions must be less than max_substitutions
* no deletions or insertions... | 3.011635 | 4.061581 | 0.741493 |
if not subsequence:
raise ValueError('Given subsequence is empty!')
# if the limitations are so strict that only exact matches are allowed,
# use search_exact()
if search_params.max_l_dist == 0:
return [
Match(start_index, start_index + len(subsequence), 0)
... | def find_near_matches_generic(subsequence, sequence, search_params) | search for near-matches of subsequence in sequence
This searches for near-matches, where the nearly-matching parts of the
sequence must meet the following limitations (relative to the subsequence):
* the maximum allowed number of character substitutions
* the maximum allowed number of new characters i... | 3.418004 | 3.769496 | 0.906754 |
if not subsequence:
raise ValueError('Given subsequence is empty!')
matches = list(_find_near_matches_generic_ngrams(subsequence, sequence, search_params))
# don't return overlapping matches; instead, group overlapping matches
# together and return the best match from each group
match... | def find_near_matches_generic_ngrams(subsequence, sequence, search_params) | search for near-matches of subsequence in sequence
This searches for near-matches, where the nearly-matching parts of the
sequence must meet the following limitations (relative to the subsequence):
* the maximum allowed number of character substitutions
* the maximum allowed number of new characters i... | 3.621292 | 4.361744 | 0.830239 |
if not subsequence:
raise ValueError('Given subsequence is empty!')
for match in _find_near_matches_generic_ngrams(subsequence, sequence, search_params):
return True
return False | def has_near_match_generic_ngrams(subsequence, sequence, search_params) | search for near-matches of subsequence in sequence
This searches for near-matches, where the nearly-matching parts of the
sequence must meet the following limitations (relative to the subsequence):
* the maximum allowed number of character substitutions
* the maximum allowed number of new characters i... | 3.68688 | 5.321532 | 0.692823 |
# If given a long sub-sequence and relatively small max distance,
# use a more complex algorithm better optimized for such cases.
if len(subsequence) > max(max_l_dist * 2, 10):
return _expand_long(subsequence, sequence, max_l_dist)
else:
return _expand_short(subsequence, sequence, m... | def _expand(subsequence, sequence, max_l_dist) | Expand a partial match of a Levenstein search.
An expansion must begin at the beginning of the sequence, which makes
this much simpler than a full search, and allows for greater optimization. | 3.933938 | 4.004438 | 0.982395 |
# The following diagram shows the score calculation step.
#
# Each new score is the minimum of:
# * a OR a + 1 (substitution, if needed)
# * b + 1 (deletion, i.e. skipping a sequence character)
# * c + 1 (insertion, i.e. skipping a sub-sequence character)
#
# a -- +1 -> c
#
... | def _py_expand_short(subsequence, sequence, max_l_dist) | Straightforward implementation of partial match expansion. | 4.423315 | 4.348483 | 1.017209 |
# The additional optimization in this version is to limit the part of
# the sub-sequence inspected for each sequence character. The start and
# end of the iteration are limited to the range where the scores are
# smaller than the maximum allowed distance. Additionally, once a good
# expansion... | def _py_expand_long(subsequence, sequence, max_l_dist) | Partial match expansion, optimized for long sub-sequences. | 3.063248 | 2.99278 | 1.023546 |
if not subsequence:
raise ValueError('Given subsequence is empty!')
if max_l_dist < 0:
raise ValueError('Maximum Levenshtein distance must be >= 0!')
if max_l_dist == 0:
return [
Match(start_index, start_index + len(subsequence), 0)
for start_index in se... | def find_near_matches_levenshtein(subsequence, sequence, max_l_dist) | Find near-matches of the subsequence in the sequence.
This chooses a suitable fuzzy search implementation according to the given
parameters.
Returns a list of fuzzysearch.Match objects describing the matching parts
of the sequence. | 2.603953 | 2.606822 | 0.9989 |
'''
:return: 4 hands, obtained by shuffling the 28 dominoes used in
this variation of the game, and distributing them evenly
'''
all_dominoes = [dominoes.Domino(i, j) for i in range(7) for j in range(i, 7)]
random.shuffle(all_dominoes)
return [dominoes.Hand(all_dominoes[0:7]), domin... | def _randomized_hands() | :return: 4 hands, obtained by shuffling the 28 dominoes used in
this variation of the game, and distributing them evenly | 2.90048 | 1.693126 | 1.713092 |
'''
Checks that a player is a valid player. Valid players are: 0, 1, 2, and 3.
:param int player: player to be validated
:return: None
:raises NoSuchPlayerException: if the player is invalid
'''
valid_players = range(4)
if player not in valid_players:
valid_players = ', '.join(s... | def _validate_player(player) | Checks that a player is a valid player. Valid players are: 0, 1, 2, and 3.
:param int player: player to be validated
:return: None
:raises NoSuchPlayerException: if the player is invalid | 3.263401 | 2.168051 | 1.505223 |
'''
:param Domino d: domino to find within the hands
:param list hands: hands to find domino in
:return: index of the hand that contains the specified domino
:raises NoSuchDominoException: if no hand contains the specified domino
'''
for i, hand in enumerate(hands):
if d in hand:
... | def _domino_hand(d, hands) | :param Domino d: domino to find within the hands
:param list hands: hands to find domino in
:return: index of the hand that contains the specified domino
:raises NoSuchDominoException: if no hand contains the specified domino | 3.617105 | 1.96033 | 1.845151 |
'''
:param list hands: hands for which to compute the remaining points
:return: a list indicating the amount of points
remaining in each of the input hands
'''
points = []
for hand in hands:
points.append(sum(d.first + d.second for d in hand))
return points | def _remaining_points(hands) | :param list hands: hands for which to compute the remaining points
:return: a list indicating the amount of points
remaining in each of the input hands | 6.294684 | 2.611466 | 2.410402 |
'''
Validates hands, based on values that
are supposed to be missing from them.
:param list hands: list of Hand objects to validate
:param list missing: list of sets that indicate the values
that are supposed to be missing from
the respective Hand o... | def _validate_hands(hands, missing) | Validates hands, based on values that
are supposed to be missing from them.
:param list hands: list of Hand objects to validate
:param list missing: list of sets that indicate the values
that are supposed to be missing from
the respective Hand objects
:... | 5.691922 | 2.069452 | 2.750449 |
'''
Helper function for Game.all_possible_hands(). Given a set of elements
and the sizes of partitions, yields all possible partitionings of the
elements into partitions of the provided sizes.
:param set elements: a set of elements to partition.
:param list sizes: a list of sizes for the partit... | def _all_possible_partitionings(elements, sizes) | Helper function for Game.all_possible_hands(). Given a set of elements
and the sizes of partitions, yields all possible partitionings of the
elements into partitions of the provided sizes.
:param set elements: a set of elements to partition.
:param list sizes: a list of sizes for the partitions. The su... | 4.080972 | 2.232587 | 1.827912 |
'''
:param Domino starting_domino: the domino that should be played
to start the game. The player
with this domino in their hand
will play first.
:param int starting_player: the p... | def new(cls, starting_domino=None, starting_player=0) | :param Domino starting_domino: the domino that should be played
to start the game. The player
with this domino in their hand
will play first.
:param int starting_player: the player that should pl... | 3.534615 | 1.995844 | 1.770988 |
'''
Updates self.valid_moves according to the latest game state.
Assumes that the board and all hands are non-empty.
'''
left_end = self.board.left_end()
right_end = self.board.right_end()
moves = []
for d in self.hands[self.turn]:
if left_end... | def _update_valid_moves(self) | Updates self.valid_moves according to the latest game state.
Assumes that the board and all hands are non-empty. | 5.072947 | 3.627358 | 1.398524 |
'''
Plays a domino from the hand of the player whose turn it is onto one
end of the game board. If the game does not end, the turn is advanced
to the next player who has a valid move.
Making a move is transactional - if the operation fails at any point,
the game will ret... | def make_move(self, d, left) | Plays a domino from the hand of the player whose turn it is onto one
end of the game board. If the game does not end, the turn is advanced
to the next player who has a valid move.
Making a move is transactional - if the operation fails at any point,
the game will return to its state bef... | 3.511288 | 2.180461 | 1.610342 |
'''
Computes the values that must be missing from each
player's hand, based on when they have passed.
:return: a list of sets, each one containing the
values that must be missing from the
corresponding player's hand
'''
missing = [set() ... | def missing_values(self) | Computes the values that must be missing from each
player's hand, based on when they have passed.
:return: a list of sets, each one containing the
values that must be missing from the
corresponding player's hand | 6.446658 | 3.713077 | 1.736203 |
'''
Returns random possible hands for all players, given the information
known by the player whose turn it is. This information includes the
current player's hand, the sizes of the other players' hands, and the
moves played by every player, including the passes.
:return:... | def random_possible_hands(self) | Returns random possible hands for all players, given the information
known by the player whose turn it is. This information includes the
current player's hand, the sizes of the other players' hands, and the
moves played by every player, including the passes.
:return: a list of possible ... | 5.630251 | 4.112571 | 1.369034 |
'''
Yields all possible hands for all players, given the information
known by the player whose turn it is. This information includes the
current player's hand, the sizes of the other players' hands, and the
moves played by every player, including the passes.
:yields: a l... | def all_possible_hands(self) | Yields all possible hands for all players, given the information
known by the player whose turn it is. This information includes the
current player's hand, the sizes of the other players' hands, and the
moves played by every player, including the passes.
:yields: a list of possible Hand... | 5.643676 | 4.140264 | 1.36312 |
'''
Prefers moves randomly.
:param Game game: game to play
:return: None
'''
game.valid_moves = tuple(sorted(game.valid_moves, key=lambda _: rand.random())) | def random(game) | Prefers moves randomly.
:param Game game: game to play
:return: None | 9.096744 | 4.388214 | 2.072994 |
'''
Prefers to play dominoes with higher point values.
:param Game game: game to play
:return: None
'''
game.valid_moves = tuple(sorted(game.valid_moves, key=lambda m: -(m[0].first + m[0].second))) | def bota_gorda(game) | Prefers to play dominoes with higher point values.
:param Game game: game to play
:return: None | 7.004725 | 3.206808 | 2.184329 |
'''
For each of a Game object's valid moves, yields
a tuple containing the move and the Game object
obtained by playing the move on the original Game
object. The original Game object will be modified.
:param Game game: the game to make moves on
:param callable player: a player to call on th... | def make_moves(game, player=dominoes.players.identity) | For each of a Game object's valid moves, yields
a tuple containing the move and the Game object
obtained by playing the move on the original Game
object. The original Game object will be modified.
:param Game game: the game to make moves on
:param callable player: a player to call on the
... | 4.750806 | 2.25172 | 2.109856 |
'''
Runs minimax search with alpha-beta pruning on the provided game.
:param Game game: game to search
:param tuple alpha_beta: a tuple of two floats that indicate
the initial values of alpha and beta,
respectively. The default is (-inf, inf).
... | def alphabeta(game, alpha_beta=(-float('inf'), float('inf')),
player=dominoes.players.identity) | Runs minimax search with alpha-beta pruning on the provided game.
:param Game game: game to search
:param tuple alpha_beta: a tuple of two floats that indicate
the initial values of alpha and beta,
respectively. The default is (-inf, inf).
:param ca... | 3.115687 | 1.942918 | 1.603612 |
'''
Advances the series to the next game, if possible. Also updates
each team's score with points from the most recently completed game.
:return: the next game, if the previous game did not end the series;
None otherwise
:raises SeriesOverException: if the serie... | def next_game(self) | Advances the series to the next game, if possible. Also updates
each team's score with points from the most recently completed game.
:return: the next game, if the previous game did not end the series;
None otherwise
:raises SeriesOverException: if the series has already ended
... | 3.966881 | 2.640654 | 1.502234 |
'''
:param Board board: board to represent
:return: SkinnyBoard to represent the given Board
'''
if len(board):
left = board.left_end()
right = board.right_end()
else:
left = None
right = None
return cls(left, right... | def from_board(cls, board) | :param Board board: board to represent
:return: SkinnyBoard to represent the given Board | 5.937696 | 3.074159 | 1.931486 |
'''
Adds the provided domino to the left end of the board.
:param Domino d: domino to add
:return: None
:raises EndsMismatchException: if the values do not match
'''
if not self:
self._left = d.first
self._right = d.second
elif d.s... | def _add_left(self, d) | Adds the provided domino to the left end of the board.
:param Domino d: domino to add
:return: None
:raises EndsMismatchException: if the values do not match | 4.077258 | 2.603912 | 1.56582 |
'''
Adds the provided domino to the right end of the board.
:param Domino d: domino to add
:return: None
:raises EndsMismatchException: if the values do not match
'''
if not self:
self._left = d.first
self._right = d.second
elif d.... | def _add_right(self, d) | Adds the provided domino to the right end of the board.
:param Domino d: domino to add
:return: None
:raises EndsMismatchException: if the values do not match | 3.937112 | 2.519742 | 1.562506 |
'''
Adds the provided domino to the specifed end of the board.
:param Domino d: domino to add
:param bool left: end of the board to which to add the
domino (True for left, False for right)
:return: None
:raises EndsMismatchException: if the valu... | def add(self, d, left) | Adds the provided domino to the specifed end of the board.
:param Domino d: domino to add
:param bool left: end of the board to which to add the
domino (True for left, False for right)
:return: None
:raises EndsMismatchException: if the values do not match | 4.765769 | 1.574555 | 3.026741 |
'''
Adds the provided domino to the left end of the board.
:param Domino d: domino to add
:return: None
:raises EndsMismatchException: if the values do not match
'''
if not self:
self.board.append(d)
elif d.first == self.left_end():
... | def _add_left(self, d) | Adds the provided domino to the left end of the board.
:param Domino d: domino to add
:return: None
:raises EndsMismatchException: if the values do not match | 4.318119 | 2.650497 | 1.629173 |
'''
Adds the provided domino to the right end of the board.
:param Domino d: domino to add
:return: None
:raises EndsMismatchException: if the values do not match
'''
if not self:
self.board.append(d)
elif d.first == self.right_end():
... | def _add_right(self, d) | Adds the provided domino to the right end of the board.
:param Domino d: domino to add
:return: None
:raises EndsMismatchException: if the values do not match | 4.18626 | 2.589842 | 1.616415 |
'''
Removes a domino from the hand.
:param Domino d: domino to remove from the hand
:return: the index within the hand of the played domino
:raises NoSuchDominoException: if the domino is not in the hand
'''
try:
i = self._dominoes.index(d)
ex... | def play(self, d) | Removes a domino from the hand.
:param Domino d: domino to remove from the hand
:return: the index within the hand of the played domino
:raises NoSuchDominoException: if the domino is not in the hand | 3.923547 | 2.214634 | 1.771645 |
'''
Adds a domino to the hand.
:param Domino d: domino to add to the hand
:param int i: index at which to add the domino;
by default adds to the end of the hand
:return: None
'''
if i is None:
self._dominoes.append(d)
els... | def draw(self, d, i=None) | Adds a domino to the hand.
:param Domino d: domino to add to the hand
:param int i: index at which to add the domino;
by default adds to the end of the hand
:return: None | 2.939864 | 1.606302 | 1.830206 |
if "PATH" not in os.environ:
return
for p in os.environ["PATH"].split(":"):
pp = "%s/%s" % (p, exec_name)
if os.path.exists(pp):
yield pp | def find_exec_in_path(exec_name) | :param str exec_name:
:return: yields full paths
:rtype: list[str] | 2.579399 | 2.267019 | 1.137793 |
if not isinstance(pkg_config_args, (tuple, list)):
pkg_config_args = [pkg_config_args]
# Maybe we have multiple pkg-config, and maybe some of them finds it.
for pp in find_exec_in_path("pkg-config"):
try:
cmd = [pp] + list(pkg_config_args) + list(packages)
#print... | def get_pkg_config(pkg_config_args, *packages) | :param str|list[str] pkg_config_args: e.g. "--cflags"
:param str packages: e.g. "python3"
:rtype: list[str]|None | 3.355584 | 3.309635 | 1.013883 |
kw = kw.copy()
flag_map = {'-I': 'include_dirs', '-L': 'library_dirs', '-l': 'libraries'} # kwargs of :class:`Extension`
for token in check_output(["pkg-config", "--libs", "--cflags"] + list(packages)).split():
if token[:2] in flag_map:
kw.setdefault(flag_map[token[:2]], []).append(token[2:])
else: # thro... | def pkgconfig(*packages, **kw) | :param str packages: list like 'libavutil', 'libavformat', ...
:rtype: dict[str] | 3.356579 | 3.261928 | 1.029017 |
try:
DST_DRIVER = get_ogr_driver(filepath=dst)
except ValueError:
raise
with fiona.Env():
with fiona.open(src, mode='r') as source:
SCHEMA = source.schema.copy()
SCHEMA.update({'geometry': 'MultiLineString'})
with fiona.open(
... | def create_centerlines(src, dst, density=0.5) | Create centerlines and save the to an ESRI Shapefile.
Reads polygons from the `src` ESRI Shapefile, creates Centerline
objects with the specified `density` parameter and writes them to
the `dst` ESRI Shapefile.
Only Polygon features are converted to centerlines. Features of
different types are ski... | 2.901786 | 2.845424 | 1.019808 |
border = array(self.__densify_border())
vor = Voronoi(border)
vertex = vor.vertices
lst_lines = []
for j, ridge in enumerate(vor.ridge_vertices):
if -1 not in ridge:
line = LineString([
(vertex[ridge[0]][0] + self._minx,
... | def _create_centerline(self) | Calculate the centerline of a polygon.
Densifies the border of a polygon which is then represented by a Numpy
array of points necessary for creating the Voronoi diagram. Once the
diagram is created, the ridges located within the polygon are
joined and returned.
Returns:
... | 3.836055 | 3.571763 | 1.073995 |
if isinstance(self._input_geom, MultiPolygon):
polygons = [polygon for polygon in self._input_geom]
else:
polygons = [self._input_geom]
points = []
for polygon in polygons:
if len(polygon.interiors) == 0:
exterior = LineString... | def __densify_border(self) | Densify the border of a polygon.
The border is densified by a given factor (by default: 0.5).
The complexity of the polygon's geometry is evaluated in order
to densify the borders of its interior rings as well.
Returns:
list: a list of points where each point is represente... | 2.351668 | 2.395786 | 0.981585 |
STARTPOINT = [line.xy[0][0] - self._minx, line.xy[1][0] - self._miny]
ENDPOINT = [line.xy[0][-1] - self._minx, line.xy[1][-1] - self._miny]
count = self._interpolation_dist
newline = [STARTPOINT]
while count < line.length:
point = line.interpolate(count)
... | def __fixed_interpolation(self, line) | Place additional points on the border at the specified distance.
By default the distance is 0.5 (meters) which means that the first
point will be placed 0.5 m from the starting point, the second
point will be placed at the distance of 1.0 m from the first
point, etc. The loop breaks whe... | 2.570895 | 2.585959 | 0.994175 |
if isinstance(geometry, Polygon) or isinstance(geometry, MultiPolygon):
return True
else:
return False | def is_valid_geometry(geometry) | Confirm that the geometry type is of type Polygon or MultiPolygon.
Args:
geometry (BaseGeometry): BaseGeometry instance (e.g. Polygon)
Returns:
bool | 2.820014 | 3.396608 | 0.830244 |
filename, file_extension = os.path.splitext(filepath)
EXTENSION = file_extension[1:]
ogr_driver_count = ogr.GetDriverCount()
for idx in range(ogr_driver_count):
driver = ogr.GetDriver(idx)
driver_extension = driver.GetMetadataItem(str('DMD_EXTENSION')) or ''
driver_extensio... | def get_ogr_driver(filepath) | Get the OGR driver from the provided file extension.
Args:
file_extension (str): file extension
Returns:
osgeo.ogr.Driver
Raises:
ValueError: no driver is found | 2.47258 | 2.606951 | 0.948457 |
numwords = {'and': (1, 0), 'a': (1, 1), 'an': (1, 1)}
for idx, word in enumerate(UNITS):
numwords[word] = (1, idx)
for idx, word in enumerate(TENS):
numwords[word] = (1, idx * 10)
for idx, word in enumerate(SCALES):
numwords[word] = (10 ** (idx * 3 or 2), 0)
all_number... | def get_numwords() | Convert number words to integers in a given text. | 2.678173 | 2.630788 | 1.018012 |
op_keys = sorted(OPERATORS.keys(), key=len, reverse=True)
unit_keys = sorted(l.UNITS.keys(), key=len, reverse=True)
symbol_keys = sorted(l.SYMBOLS.keys(), key=len, reverse=True)
exponent = ur'(?:(?:\^?\-?[0-9%s]*)(?:\ cubed|\ squared)?)(?![a-zA-Z])' % \
SUPERSCRIPTS
all_ops = '... | def get_units_regex() | Build a compiled regex object. | 2.940127 | 2.894373 | 1.015808 |
new_dimensions = defaultdict(int)
for item in dimensions:
new = entities[item['base']].dimensions
if new:
for new_item in new:
new_dimensions[new_item['base']] += new_item['power'] * \
item['power']
else:
... | def get_dimension_permutations(entities, dimensions) | Get all possible dimensional definitions for an entity. | 3.05775 | 2.946623 | 1.037713 |
path = os.path.join(TOPDIR, 'entities.json')
entities = json.load(open(path))
names = [i['name'] for i in entities]
try:
assert len(set(names)) == len(entities)
except AssertionError:
raise Exception('Entities with same name: %s' % [i for i in names if
... | def load_entities() | Load entities from JSON file. | 3.481699 | 3.362856 | 1.03534 |
dimensions_uni = {}
for name in names:
key = get_key_from_dimensions(names[name].dimensions)
dimensions_uni[key] = names[name]
plain_dimensions = [{'base': name, 'power': 1}]
key = get_key_from_dimensions(plain_dimensions)
dimensions_uni[key] = names[name]
... | def get_dimensions_units(names) | Create dictionary of unit dimensions. | 3.637669 | 3.466664 | 1.049329 |
names = {}
lowers = defaultdict(list)
symbols = defaultdict(list)
surfaces = defaultdict(list)
for unit in json.load(open(os.path.join(TOPDIR, 'units.json'))):
try:
assert unit['name'] not in names
except AssertionError:
msg = 'Two units with same name i... | def load_units() | Load units from JSON file. | 3.210601 | 3.182991 | 1.008674 |
ambiguous = [i for i in l.UNITS.items() if len(i[1]) > 1]
ambiguous += [i for i in l.DERIVED_ENT.items() if len(i[1]) > 1]
pages = set([(j.name, j.uri) for i in ambiguous for j in i[1]])
print
objs = []
for num, page in enumerate(pages):
obj = {'url': page[1]}
obj['_id'] =... | def download_wiki() | Download WikiPedia pages of ambiguous units. | 3.50089 | 3.287407 | 1.06494 |
new_text = re.sub(ur'\p{P}+', ' ', text)
new_text = [stem(i) for i in new_text.lower().split() if not
re.findall(r'[0-9]', i)]
new_text = ' '.join(new_text)
return new_text | def clean_text(text) | Clean text for TFIDF. | 3.467264 | 3.216001 | 1.078129 |
if download:
download_wiki()
path = os.path.join(l.TOPDIR, 'train.json')
training_set = json.load(open(path))
path = os.path.join(l.TOPDIR, 'wiki.json')
wiki_set = json.load(open(path))
target_names = list(set([i['unit'] for i in training_set + wiki_set]))
train_data, train_ta... | def train_classifier(download=True, parameters=None, ngram_range=(1, 1)) | Train the intent classifier. | 2.193275 | 2.199625 | 0.997113 |
path = os.path.join(l.TOPDIR, 'clf.pickle')
obj = pickle.load(open(path, 'r'))
return obj['tfidf_model'], obj['clf'], obj['target_names'] | def load_classifier() | Train the intent classifier. | 6.378644 | 6.354943 | 1.003729 |
new_ent = l.DERIVED_ENT[key][0]
if len(l.DERIVED_ENT[key]) > 1:
transformed = TFIDF_MODEL.transform([text])
scores = CLF.predict_proba(transformed).tolist()[0]
scores = sorted(zip(scores, TARGET_NAMES), key=lambda x: x[0],
reverse=True)
names = [i.na... | def disambiguate_entity(key, text) | Resolve ambiguity between entities with same dimensionality. | 4.301049 | 4.045563 | 1.063152 |
new_unit = l.UNITS[unit]
if not new_unit:
new_unit = l.LOWER_UNITS[unit.lower()]
if not new_unit:
raise KeyError('Could not find unit "%s"' % unit)
if len(new_unit) > 1:
transformed = TFIDF_MODEL.transform([clean_text(text)])
scores = CLF.predict_proba(trans... | def disambiguate_unit(unit, text) | Resolve ambiguity.
Distinguish between units that have same names, symbols or abbreviations. | 3.442145 | 3.404178 | 1.011153 |
surface = surface.replace('-', ' ')
no_start = ['and', ' ']
no_end = [' and', ' ']
found = True
while found:
found = False
for word in no_start:
if surface.lower().startswith(word):
surface = surface[len(word):]
span = (span[0] + len(... | def clean_surface(surface, span) | Remove spurious characters from a quantity's surface. | 2.433838 | 2.366422 | 1.028489 |
values = []
for item in r.REG_TXT.finditer(text):
surface, span = clean_surface(item.group(0), item.span())
if not surface or surface.lower() in r.SCALES:
continue
curr = result = 0.0
for word in surface.split():
try:
scale, increment ... | def extract_spellout_values(text) | Convert spelled out numbers in a given text to digits. | 3.712861 | 3.508462 | 1.058259 |
shift, final_text, shifts = 0, text, defaultdict(int)
for value in values:
first = value['old_span'][0] + shift
second = value['old_span'][1] + shift
new_s = value['new_surface']
final_text = final_text[0:first] + new_s + final_text[second:]
shift += len(new_s) - len... | def substitute_values(text, values) | Convert spelled out numbers in a given text to digits. | 3.785017 | 3.729869 | 1.014786 |
fracs = r'|'.join(r.UNI_FRAC)
value = item.group(2)
value = re.sub(ur'(?<=\d)(%s)10' % r.MULTIPLIERS, 'e', value)
value = re.sub(fracs, callback, value, re.IGNORECASE)
value = re.sub(' +', ' ', value)
range_separator = re.findall(ur'\d+ ?(-|and|(?:- ?)?to) ?\d', value)
uncer_separator... | def get_values(item) | Extract value from regex hit. | 3.397702 | 3.322753 | 1.022556 |
name = ''
for unit in dimensions:
if unit['power'] < 0:
name += 'per '
power = abs(unit['power'])
if power == 1:
name += unit['base']
elif power == 2:
name += 'square ' + unit['base']
elif power == 3:
name += 'cubic ' ... | def build_unit_name(dimensions) | Build the name of the unit from its dimensions. | 3.184953 | 3.177967 | 1.002198 |
key = l.get_key_from_dimensions(dimensions)
try:
unit = l.DERIVED_UNI[key]
except KeyError:
logging.debug(u'\tCould not find unit for: %s', key)
unit = c.Unit(name=build_unit_name(dimensions),
dimensions=dimensions,
entity=get_entity_... | def get_unit_from_dimensions(dimensions, text) | Reconcile a unit based on its dimensionality. | 5.622267 | 5.505328 | 1.021241 |
new_dimensions = [{'base': l.NAMES[i['base']].entity.name,
'power': i['power']} for i in dimensions]
final_dimensions = sorted(new_dimensions, key=lambda x: x['base'])
key = l.get_key_from_dimensions(final_dimensions)
try:
if clf.USE_CLF:
ent = clf.disam... | def get_entity_from_dimensions(dimensions, text) | Infer the underlying entity of a unit (e.g. "volume" for "m^3").
Just based on the unit's dimensionality if the classifier is disabled. | 6.145039 | 5.665737 | 1.084596 |
surface = item.group(group).replace('.', '')
power = re.findall(r'\-?[0-9%s]+' % r.SUPERSCRIPTS, surface)
if power:
power = [r.UNI_SUPER[i] if i in r.UNI_SUPER else i for i
in power]
power = ''.join(power)
new_power = (-1 * int(power) if slash else int(power))
... | def parse_unit(item, group, slash) | Parse surface and power from unit text. | 2.745666 | 2.600385 | 1.055869 |
group_units = [1, 4, 6, 8, 10]
group_operators = [3, 5, 7, 9]
item_units = [item.group(i) for i in group_units if item.group(i)]
if len(item_units) == 0:
unit = l.NAMES['dimensionless']
else:
dimensions, slash = [], False
for group in sorted(group_units + group_operato... | def get_unit(item, text) | Extract unit from regex hit. | 4.509005 | 4.301651 | 1.048203 |
span = item.span()
logging.debug(u'\tInitial span: %s ("%s")', span, text[span[0]:span[1]])
real_span = (span[0] - shifts[span[0]], span[1] - shifts[span[1] - 1])
surface = orig_text[real_span[0]:real_span[1]]
logging.debug(u'\tShifted span: %s ("%s")', real_span, surface)
while any(surfa... | def get_surface(shifts, orig_text, item, text) | Extract surface from regex hit. | 2.176828 | 2.151632 | 1.011711 |
res = False
cursor = re.finditer(r'("|\')[^ .,:;?!()*+-].*?("|\')', orig_text)
for item in cursor:
if item.span()[1] == span[1]:
res = True
return res | def is_quote_artifact(orig_text, span) | Distinguish between quotes and units. | 6.323827 | 5.787122 | 1.092741 |
# Discard irrelevant txt2float extractions, cardinal numbers, codes etc.
if surface.lower() in ['a', 'an', 'one'] or \
re.search(r'1st|2nd|3rd|[04-9]th', surface) or \
re.search(r'\d+[A-Z]+\d+', surface) or \
re.search(r'\ba second\b', surface, re.IGNORECASE):
lo... | def build_quantity(orig_text, text, item, values, unit, surface, span, uncert) | Build a Quantity object out of extracted information. | 3.087377 | 3.102715 | 0.995057 |
# Replace a few nasty unicode characters with their ASCII equivalent
maps = {u'×': u'x', u'–': u'-', u'−': '-'}
for element in maps:
text = text.replace(element, maps[element])
# Replace genitives
text = re.sub(r'(?<=\w)\'s\b|(?<=\w)s\'(?!\w)', ' ', text)
logging.debug(u'Clean te... | def clean_text(text) | Clean text before parsing. | 4.910069 | 4.964498 | 0.989037 |
log_format = ('%(asctime)s --- %(message)s')
logging.basicConfig(format=log_format)
root = logging.getLogger()
if verbose:
level = root.level
root.setLevel(logging.DEBUG)
logging.debug(u'Verbose mode')
if isinstance(text, str):
text = text.decode('utf-8')
... | def parse(text, verbose=False) | Extract all quantities from unstructured text. | 4.042057 | 3.834782 | 1.054051 |
if isinstance(text, str):
text = text.decode('utf-8')
parsed = parse(text, verbose=verbose)
shift = 0
for quantity in parsed:
index = quantity.span[1] + shift
to_add = u' {' + unicode(quantity) + u'}'
text = text[0:index] + to_add + text[index:]
shift += le... | def inline_parse(text, verbose=False) | Extract all quantities from unstructured text. | 3.509031 | 3.238611 | 1.083499 |
if self._login_data or self._login_token:
def reconnect_login_callback(error, result):
if error:
if self._login_token:
self._login_token = None
self._login(self._login_data,
... | def _reconnected(self) | Reconnect
Currently we get a new session every time so we have
to clear all the data an resubscribe | 3.201055 | 2.99642 | 1.068293 |
# TODO: keep the tokenExpires around so we know the next time
# we need to authenticate
# hash the password
hashed = hashlib.sha256(password).hexdigest()
# handle username or email address
if '@' in user:
user_object = {
'email'... | def login(self, user, password, token=None, callback=None) | Login with a username and password
Arguments:
user - username or email address
password - the password for the account
Keyword Arguments:
token - meteor resume token
callback - callback function containing error as first argument and login data | 3.77423 | 3.90571 | 0.966336 |
self.ddp_client.call('logout', [], callback=callback)
self.emit('logged_out') | def logout(self, callback=None) | Logout a user
Keyword Arguments:
callback - callback function called when the user has been logged out | 7.698749 | 12.033082 | 0.639799 |
self._wait_for_connect()
self.ddp_client.call(method, params, callback=callback) | def call(self, method, params, callback=None) | Call a remote method
Arguments:
method - remote method name
params - remote method parameters
Keyword Arguments:
callback - callback function containing return data | 6.533659 | 8.653324 | 0.755046 |
self._wait_for_connect()
def subscribed(error, sub_id):
if error:
self._remove_sub_by_id(sub_id)
if callback:
callback(error.get('reason'))
return
if callback:
callback(None)
... | def subscribe(self, name, params=[], callback=None) | Subscribe to a collection
Arguments:
name - the name of the publication
params - the subscription parameters
Keyword Arguments:
callback - a function callback that returns an error (if exists) | 3.216708 | 3.673407 | 0.875674 |
self._wait_for_connect()
if name not in self.subscriptions:
raise MeteorClientException('No subscription for {}'.format(name))
self.ddp_client.unsubscribe(self.subscriptions[name]['id'])
del self.subscriptions[name]
self.emit('unsubscribed', name) | def unsubscribe(self, name) | Unsubscribe from a collection
Arguments:
name - the name of the publication | 3.954366 | 4.529475 | 0.87303 |
results = []
for _id, doc in self.collection_data.data.get(collection, {}).items():
doc.update({'_id': _id})
if selector == {}:
results.append(doc)
for key, value in selector.items():
if key in doc and doc[key] == value:
... | def find(self, collection, selector={}) | Find data in a collection
Arguments:
collection - collection to search
Keyword Arguments:
selector - the query (default returns all items in a collection) | 2.640951 | 3.175209 | 0.831741 |
for _id, doc in self.collection_data.data.get(collection, {}).items():
doc.update({'_id': _id})
if selector == {}:
return doc
for key, value in selector.items():
if key in doc and doc[key] == value:
return doc
... | def find_one(self, collection, selector={}) | Return one item from a collection
Arguments:
collection - collection to search
Keyword Arguments:
selector - the query (default returns first item found) | 2.820845 | 3.512375 | 0.803116 |
self.call("/" + collection + "/insert", [doc], callback=callback) | def insert(self, collection, doc, callback=None) | Insert an item into a collection
Arguments:
collection - the collection to be modified
doc - The document to insert. May not yet have an _id attribute,
in which case Meteor will generate one for you.
Keyword Arguments:
callback - Optional. If present, called with an err... | 8.895993 | 13.517534 | 0.658108 |
self.call("/" + collection + "/update", [selector, modifier], callback=callback) | def update(self, collection, selector, modifier, callback=None) | Insert an item into a collection
Arguments:
collection - the collection to be modified
selector - specifies which documents to modify
modifier - Specifies how to modify the documents
Keyword Arguments:
callback - Optional. If present, called with an error object as the ... | 7.399491 | 11.341109 | 0.652449 |
self.call("/" + collection + "/remove", [selector], callback=callback) | def remove(self, collection, selector, callback=None) | Remove an item from a collection
Arguments:
collection - the collection to be modified
selector - Specifies which documents to remove
Keyword Arguments:
callback - Optional. If present, called with an error object as its argument. | 9.173355 | 13.565125 | 0.676246 |
try:
if self.closed is False:
close_msg = bytearray()
close_msg.extend(struct.pack("!H", status))
if _check_unicode(reason):
close_msg.extend(reason.encode('utf-8'))
else:
close_msg.exten... | def close(self, status=1000, reason=u'') | Send Close frame to the client. The underlying socket is only closed
when the client acknowledges the Close frame.
status is the closing identifier.
reason is the reason for the close. | 2.880816 | 2.876728 | 1.001421 |
opcode = BINARY
if _check_unicode(data):
opcode = TEXT
self._send_message(True, opcode, data) | def send_fragment_start(self, data) | Send the start of a data fragment stream to a websocket client.
Subsequent data should be sent using sendFragment().
A fragment stream is completed when sendFragmentEnd() is called.
If data is a unicode object then the frame is sent as Text.
If the data is a bytearray ob... | 12.088314 | 15.169222 | 0.796897 |
opcode = BINARY
if _check_unicode(data):
opcode = TEXT
self._send_message(False, opcode, data) | def send_message(self, data) | Send websocket data frame to the client.
If data is a unicode object then the frame is sent as Text.
If the data is a bytearray object then the frame is sent as Binary. | 12.304915 | 14.316739 | 0.859478 |
zlibbed_str = zlib.compress(plantuml_text.encode('utf-8'))
compressed_string = zlibbed_str[2:-4]
return encode(compressed_string.decode('latin-1')) | def deflate_and_encode(plantuml_text) | zlib compress the plantuml text and encode it for the plantuml server. | 3.527121 | 3.657549 | 0.96434 |
res = ""
for i in range(0,len(data), 3):
if (i+2==len(data)):
res += _encode3bytes(ord(data[i]), ord(data[i+1]), 0)
elif (i+1==len(data)):
res += _encode3bytes(ord(data[i]), 0, 0)
else:
res += _encode3bytes(ord(data[i]), ord(data[i+1]), ord(data[i... | def encode(data) | encode the plantuml data which may be compresses in the proper
encoding for the plantuml server | 1.763821 | 1.819503 | 0.969397 |
url = self.get_url(plantuml_text)
try:
response, content = self.http.request(url, **self.request_opts)
except self.HttpLib2Error as e:
raise PlantUMLConnectionError(e)
if response.status != 200:
raise PlantUMLHTTPError(response, content)
... | def processes(self, plantuml_text) | Processes the plantuml text into the raw PNG image data.
:param str plantuml_text: The plantuml markup to render
:returns: the raw image data | 3.03575 | 3.515068 | 0.863639 |
if outfile is None:
outfile = os.path.splitext(filename)[0] + '.png'
if errorfile is None:
errorfile = os.path.splitext(filename)[0] + '_error.html'
data = open(filename, 'U').read()
try:
content = self.processes(data)
except PlantUMLH... | def processes_file(self, filename, outfile=None, errorfile=None) | Take a filename of a file containing plantuml text and processes
it into a .png image.
:param str filename: Text file containing plantuml markup
:param str outfile: Filename to write the output image to. If not
supplied, then it will be the input filename with the
... | 2.319298 | 1.892662 | 1.225416 |
'''
For Jira next-gen projects, issue types can be scoped to projects.
For issue types that are scoped to projects, only extract the ones
in the extracted projects.
'''
print('downloading jira issue types... ', end='', flush=True)
result = []
for it in jira_connection.issue_types():
... | def download_issuetypes(jira_connection, project_ids) | For Jira next-gen projects, issue types can be scoped to projects.
For issue types that are scoped to projects, only extract the ones
in the extracted projects. | 4.529395 | 2.356365 | 1.922196 |
# type: (List[AbstractPEMObject], **Any) -> ssl.CerticateOptions
keys = [key for key in pemObjects if isinstance(key, Key)]
if not len(keys):
raise ValueError("Supplied PEM file(s) does *not* contain a key.")
if len(keys) > 1:
raise ValueError("Supplied PEM file(s) contains *more* t... | def certificateOptionsFromPEMs(pemObjects, **kw) | Load a CertificateOptions from the given collection of PEM objects
(already-loaded private keys and certificates).
In those PEM objects, identify one private key and its corresponding
certificate to use as the primary certificate. Then use the rest of the
certificates found as chain certificates. Rai... | 3.168234 | 3.314287 | 0.955932 |
# type: (*str, **Any) -> ssl.CertificateOptions
pems = [] # type: List[AbstractPEMObject]
for pemFile in pemFiles:
pems += parse_file(pemFile)
return certificateOptionsFromPEMs(pems, **kw) | def certificateOptionsFromFiles(*pemFiles, **kw) | Read all files named by *pemFiles*, and parse them using
:func:`certificateOptionsFromPEMs`. | 4.021949 | 4.87273 | 0.8254 |
# type: (bytes) -> List[AbstractPEMObject]
return [
_PEM_TO_CLASS[match.group(1)](match.group(0))
for match in _PEM_RE.finditer(pem_str)
] | def parse(pem_str) | Extract PEM objects from *pem_str*.
:param pem_str: String to parse.
:type pem_str: bytes
:return: list of :ref:`pem-objects` | 4.390557 | 6.586495 | 0.6666 |
# type: () -> str
if self._sha1_hexdigest is None:
self._sha1_hexdigest = hashlib.sha1(self._pem_bytes).hexdigest()
return self._sha1_hexdigest | def sha1_hexdigest(self) | A SHA-1 digest of the whole object for easy differentiation.
.. versionadded:: 18.1.0 | 2.802901 | 3.740046 | 0.74943 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.