chore(ci_visibility): avoid len() in code coverage methods (#14092)

Avoid an infinite recursion where [a
test](https://github.com/DataDog/dd-trace-py/blob/v3.10.2/tests/appsec/appsec/test_common_modules.py#L83)
patches `len()`, which is used by code coverage, which calls the
instrumented patched `len()`, which calls code coverage, and so on.

This solves the problem for `len` in particular, but ideally we would
like to be more robust against patching things that are used by the
tracer, or at least detecting that this happened and gracefully return.

## Checklist
- [x] PR author has checked that all the criteria below are met
- The PR description includes an overview of the change
- The PR description articulates the motivation for the change
- The change includes tests OR the PR description describes a testing
strategy
- The PR description notes risks associated with the change, if any
- Newly-added code is easy to change
- The change follows the [library release note
guidelines](https://ddtrace.readthedocs.io/en/stable/releasenotes.html)
- The change includes or references documentation updates if necessary
- Backport labels are set (if
[applicable](https://ddtrace.readthedocs.io/en/latest/contributing.html#backporting))

## Reviewer Checklist
- [ ] Reviewer has checked that all the criteria below are met 
- Title is accurate
- All changes are related to the pull request's stated goal
- Avoids breaking
[API](https://ddtrace.readthedocs.io/en/stable/versioning.html#interfaces)
changes
- Testing strategy adequately addresses listed risks
- Newly-added code is easy to change
- Release note makes sense to a user of the library
- If necessary, author has acknowledged and discussed the performance
implications of this PR as reported in the benchmarks PR comment
- Backport labels are set in a manner that is consistent with the
[release branch maintenance
policy](https://ddtrace.readthedocs.io/en/latest/contributing.html#backporting)

Author: vitor-de-araujo

ddtrace/internal/test_visibility/coverage_lines.py

@@ -41,8 +41,8 @@ def _num_lines(self) -> int:
     def add(self, line_number: int):
         lines_byte = line_number // 8
 
-        if lines_byte >= len(self._lines):
-            self._lines.extend(bytearray(lines_byte - len(self._lines) + 1))
+        if lines_byte >= self._lines.__len__():
+            self._lines.extend(bytearray(lines_byte - self._lines.__len__() + 1))
 
         # DEV this fun bit allows us to trick ourselves into little-endianness, which is what the backend wants to see
         # in bytes
@@ -62,8 +62,8 @@ def to_sorted_list(self) -> t.List[int]:
 
     def update(self, other: "CoverageLines"):
         # Extend our lines if the other coverage has more lines
-        if len(other._lines) > len(self._lines):
-            self._lines.extend(bytearray(len(other._lines) - len(self._lines)))
+        if other._lines.__len__() > self._lines.__len__():
+            self._lines.extend(bytearray(other._lines.__len__() - self._lines.__len__()))
 
         for _byte_idx, _byte in enumerate(other._lines):
             self._lines[_byte_idx] |= _byte