difflib.ndiff()
  • References/Python/Python/Text Processing

difflib.ndiff(a, b, linejunk=None, charjunk=IS_CHARACTER_JUNK) Compare a and b (lists of strings); return

2025-01-10 15:47:30
re.regex.fullmatch()
  • References/Python/Python/Text Processing

regex.fullmatch(string[, pos[, endpos]]) If the whole string matches this regular expression, return a corresponding

2025-01-10 15:47:30
readline.get_history_item()
  • References/Python/Python/Text Processing

readline.get_history_item(index) Return the current contents of history item at index. The item index is one-based

2025-01-10 15:47:30
unicodedata.digit()
  • References/Python/Python/Text Processing

unicodedata.digit(chr[, default]) Returns the digit value assigned to the character chr as integer. If no such value

2025-01-10 15:47:30
textwrap.fill()
  • References/Python/Python/Text Processing

textwrap.fill(text, width=70, **kwargs) Wraps the single paragraph in text, and returns a single string containing

2025-01-10 15:47:30
readline.read_init_file()
  • References/Python/Python/Text Processing

readline.read_init_file([filename]) Execute a readline initialization file. The default filename is the last filename used.

2025-01-10 15:47:30
difflib.SequenceMatcher.set_seq1()
  • References/Python/Python/Text Processing

set_seq1(a) Set the first sequence to be compared. The second sequence to be compared is not changed.

2025-01-10 15:47:30
difflib.get_close_matches()
  • References/Python/Python/Text Processing

difflib.get_close_matches(word, possibilities, n=3, cutoff=0.6) Return a list of the best “good enough” matches. word

2025-01-10 15:47:30
stringprep.in_table_c21_c22()
  • References/Python/Python/Text Processing

stringprep.in_table_c21_c22(code) Determine whether code is in tableC.2 (Control characters, union of C.2.1 and C.2

2025-01-10 15:47:30
difflib.SequenceMatcher.get_grouped_opcodes()
  • References/Python/Python/Text Processing

get_grouped_opcodes(n=3) Return a generator of groups with up to n lines of

2025-01-10 15:47:30