File size: 6,239 Bytes
18e5876 6b4f111 af22a0d 18e5876 978aa85 18e5876 6b4f111 72b3b4a 18e5876 56b3c5a 18e5876 56b3c5a 18e5876 56b3c5a 18e5876 6b4f111 18e5876 6b4f111 72b3b4a 18e5876 6b4f111 72b3b4a 18e5876 6b4f111 72b3b4a 18e5876 56b3c5a 18e5876 56b3c5a 18e5876 6b4f111 18e5876 978aa85 72b3b4a 978aa85 72b3b4a 978aa85 18e5876 978aa85 18e5876 978aa85 18e5876 009cdd3 18e5876 978aa85 18e5876 978aa85 18e5876 978aa85 18e5876 978aa85 18e5876 978aa85 18e5876 6b4f111 72b3b4a 18e5876 56b3c5a 80cbdc9 af22a0d |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 |
import re
import shutil
from typing import List, Tuple
from .logging_utils import get_logger
logger = get_logger()
def split_words(s):
"""Splits a string into words based on PascalCase, camelCase, snake_case, kebab-case, and numbers attached to strings.
Args:
s (str): The string to be split.
Returns:
list: The list of words obtained after splitting the string.
"""
# Split PascalCase or camelCase
s = re.sub(r"([A-Z][a-z]+)", r" \1", re.sub(r"([A-Z]+)", r" \1", s)).strip()
# Split snake_case or kebab-case
s = re.sub(r"[_-]", " ", s)
# Split numbers attached to strings
s = re.sub(r"([a-zA-Z])(\d)", r"\1 \2", s)
s = re.sub(r"(\d)([a-zA-Z])", r"\1 \2", s)
# Split the string into words based on spaces
return s.split()
def is_camel_case(s):
"""Checks if a string is in camelCase.
Args:
s (str): The string to be checked.
Returns:
bool: True if the string is in camelCase, False otherwise.
"""
return re.match(r"^[A-Z]+([a-z0-9]*[A-Z]*[a-z0-9]*)*$", s) is not None
def is_snake_case(s):
"""Checks if a string is in snake_case.
Args:
s (str): The string to be checked.
Returns:
bool: True if the string is in snake_case, False otherwise.
"""
return re.match(r"^[a-z0-9]+(_[a-z0-9]+)*$", s) is not None
def camel_to_snake_case(s):
"""Converts a string from camelCase to snake_case.
Args:
s (str): The string to be converted.
Returns:
str: The string converted to snake_case.
"""
# Add an underscore before every uppercase letter that is followed by a lowercase letter or digit and not preceded by an underscore, a hyphen or an uppercase letter
s = re.sub(r"(?<=[^A-Z_-])([A-Z])", r"_\1", s)
# Ensure there's an underscore before any uppercase letter that's followed by a lowercase letter or digit and comes after a sequence of uppercase letters
s = re.sub(r"([A-Z]+)([A-Z][a-z0-9])", r"\1_\2", s)
return s.lower()
def construct_dict_str(d, indent=0, indent_delta=4, max_chars=None):
"""Constructs a formatted string of a dictionary.
Args:
d (dict): The dictionary to be formatted.
indent (int, optional): The current level of indentation. Defaults to 0.
indent_delta (int, optional): The amount of spaces to add for each level of indentation. Defaults to 4.
max_chars (int, optional): The maximum number of characters for each line. Defaults to terminal width - 10.
"""
max_chars = max_chars or shutil.get_terminal_size()[0] - 10
indent_str = " " * indent
indent_delta_str = " " * indent_delta
res = ""
for key, value in d.items():
if isinstance(value, dict):
res += f"{indent_str}{key}:\n"
res += construct_dict_str(value, indent + indent_delta, max_chars=max_chars)
else:
str_value = str(value)
str_value = re.sub(r"\w+=None, ", "", str_value)
str_value = re.sub(r"\w+={}, ", "", str_value)
str_value = re.sub(r"\w+=\[\], ", "", str_value)
line_width = max_chars - indent
lines = str_value.split("\n")
res += f"{indent_str}{key} ({type(value).__name__}):\n"
for line in lines:
if len(line) + len(indent_str) + indent_delta > line_width:
res += f"{indent_str}{indent_delta_str}{line[:line_width]}\n"
for i in range(line_width, len(line), line_width):
res += f"{indent_str}{indent_delta_str}{line[i:i+line_width]}\n"
else:
res += f"{indent_str}{indent_delta_str}{line}\n"
key = "" # Empty the key for lines after the first one
return res
def print_dict(d, indent=0, indent_delta=4, max_chars=None):
dict_str = construct_dict_str(d, indent, indent_delta, max_chars)
dict_str = "\n" + dict_str
logger.info(dict_str)
def nested_tuple_to_string(nested_tuple: tuple) -> str:
"""Converts a nested tuple to a string, with elements separated by underscores.
Args:
nested_tuple (tuple): The nested tuple to be converted.
Returns:
str: The string representation of the nested tuple.
"""
result = []
for item in nested_tuple:
if isinstance(item, tuple):
result.append(nested_tuple_to_string(item))
else:
result.append(str(item))
return "_".join(result)
def is_made_of_sub_strings(string, sub_strings):
pattern = "^(" + "|".join(map(re.escape, sub_strings)) + ")+$"
return bool(re.match(pattern, string))
# Giveמ all the lines of a file, e.g. all the lines of prepare/cards/cohere_for_ai.py,
# and an object name, e.g. TaskCard,
# return the ordinal number of the line that starts that object, in our example: the
# line number of the following line (notice that the line where TaskCard is imported
# is not supposed to return):
# card = TaskCard(
# and the line number of the line that ends the object, in our case the line that include
# the matching close:
# )
# This util depends on ruff to ensure this setting of the card file: that a close of one
# tag and the open of the next tag, do not sit in same line, both tags being
# major level within TaskCard
# flake8: noqa: B007
def lines_defining_obj(
all_lines: List[str], obj_name: str, start_search_at_line: int = 0
) -> Tuple[int, int]:
for starting_line in range(start_search_at_line, len(all_lines)):
line = all_lines[starting_line]
if obj_name in line:
break
if obj_name not in line:
# obj_name found no where in the input lines
return (-1, -1)
num_of_opens = 0
num_of_closes = 0
for ending_line in range(starting_line, len(all_lines)):
num_of_opens += len(re.findall(r"[({[]", all_lines[ending_line]))
num_of_closes += len(re.findall(r"[)}\]]", all_lines[ending_line]))
if num_of_closes == num_of_opens:
break
if num_of_closes != num_of_opens:
raise ValueError(
"input lines were exhausted before the matching close is found"
)
return (starting_line, ending_line)
|