Bump actions/setup-python from 6.0.0 to 6.1.0

Bumps [actions/setup-python](https://github.com/actions/setup-python) from 6.0.0 to 6.1.0.
- [Release notes](https://github.com/actions/setup-python/releases)
- [Commits](e797f83bcb...83679a892e)

---
updated-dependencies:
- dependency-name: actions/setup-python
  dependency-version: 6.1.0
  dependency-type: direct:production
  update-type: version-update:semver-minor
...

Signed-off-by: dependabot[bot] <support@github.com>

.github/workflows/build_test.yml

@@ -321,7 +321,7 @@ jobs:
         # cd integration
         # mvn -B verify
 
-    - uses: actions/setup-python@e797f83bcb11b83ae66e0230d6156d7c80228e7c # v6.0.0
+    - uses: actions/setup-python@83679a892e2d95755f2dac6acb0bfd1e9ac5d548 # v6.1.0
       if: ${{ matrix.build_system == 'python' }}
       with:
         python-version: ${{ matrix.python_version }}

c/enc/backward_references.c

@@ -131,14 +131,6 @@ static BROTLI_INLINE size_t ComputeDistanceCode(size_t distance,
 #define PREFIX() D
 #define ENABLE_COMPOUND_DICTIONARY 1
 
-#define HASHER() H3
-/* NOLINTNEXTLINE(build/include) */
-#include "backward_references_inc.h"
-#undef HASHER
-#define HASHER() H4
-/* NOLINTNEXTLINE(build/include) */
-#include "backward_references_inc.h"
-#undef HASHER
 #define HASHER() H5
 /* NOLINTNEXTLINE(build/include) */
 #include "backward_references_inc.h"
@@ -200,8 +192,6 @@ void BrotliCreateBackwardReferences(size_t num_bytes,
             literal_context_lut, params, hasher, dist_cache,        \
             last_insert_len, commands, num_commands, num_literals); \
         return;
-      CASE_(3)
-      CASE_(4)
       CASE_(5)
       CASE_(6)
 #if defined(BROTLI_MAX_SIMD_QUALITY)

c/enc/hash_longest_match_quickly_inc.h

@@ -168,7 +168,7 @@ static BROTLI_INLINE void FN(FindLongestMatch)(
   BROTLI_DCHECK(cur_ix_masked + max_length <= ring_buffer_mask + 1);
 
   out->len_code_delta = 0;
-  if (prev_ix < cur_ix && cached_backward <= max_backward) {
+  if (prev_ix < cur_ix) {
     prev_ix &= (uint32_t)ring_buffer_mask;
     if (compare_char == data[prev_ix + best_len]) {
       const size_t len = FindMatchLengthWithLimit(