throw new RuntimeException("Test exception in listener");
            }
        });

        try {
            factory.destroyObject(pooledObject);
            fail("Should propagate exception from listener");
        } catch (Exception e) {
            assertTrue(e.getMessage().contains("Test exception"));
        }
    }

    /**
     * Test getter and setter for componentName
     */

            verify(mockChunk2, times(1)).encode(eq(buffer), eq(HEADER_SIZE + CHUNK_SIZE));
        }

        @Test
        @DisplayName("Should accumulate encoded bytes from chunks")
        void testAccumulatesEncodedBytes() {
            // Given
            byte[] sourceKey = new byte[SOURCE_KEY_SIZE];
            SrvCopychunk mockChunk1 = mock(SrvCopychunk.class);

  private static final SuccessorsFunction<Character> CYCLIC_GRAPH_CONTAINING_TREE =
      createDirectedGraph("ab", "bc", "bd", "ed", "ef", "fe");

  /**
   * A graph that is not a tree (for example, {@code h} is reachable from {@code f} via both {@code
   * e} and {@code g}) but is a valid input to {@link Traverser#forTree} when starting e.g. at node
   * {@code a} (all edges are directed facing downwards):
   *
   * {@snippet :
   *     a   f

            byte[] counter = new byte[8];
            System.arraycopy(nonces[i], 0, counter, 0, 8);
            uniqueCounters.add(bytesToHex(counter));
        }

        // All nonces should be unique (high entropy from SecureRandom)
        assertEquals(sampleSize, uniqueCounters.size(), "All nonces should have unique values");

        // Verify that nonces have good entropy (not predictable)

  private static final SuccessorsFunction<Character> CYCLIC_GRAPH_CONTAINING_TREE =
      createDirectedGraph("ab", "bc", "bd", "ed", "ef", "fe");

  /**
   * A graph that is not a tree (for example, {@code h} is reachable from {@code f} via both {@code
   * e} and {@code g}) but is a valid input to {@link Traverser#forTree} when starting e.g. at node
   * {@code a} (all edges are directed facing downwards):
   *
   * {@snippet :
   *     a   f

        };

        this.callback = function() { };

        //some state information
        this.isShowing = false;
        this.leftCalendar = {};
        this.rightCalendar = {};

        //custom options from user
        if (typeof options !== 'object' || options === null)
            options = {};

        //allow setting options with data attributes
        //data-api options will be overwritten with custom javascript options

          .and(CharMatcher.noneOf("()<>@,;:\\\"/[]?="));

  private static final CharMatcher QUOTED_TEXT_MATCHER = ascii().and(CharMatcher.noneOf("\"\\\r"));

  /*
   * This matches the same characters as linear-white-space from RFC 822, but we make no effort to
   * enforce any particular rules with regards to line folding as stated in the class docs.
   */
  private static final CharMatcher LINEAR_WHITE_SPACE = CharMatcher.anyOf(" \t\r\n");

        // page navi
        RenderDataUtil.register(data, "charMappingItemItems", charMappingService.getCharMappingList(form.dictId, charMappingPager));

        // restore from pager
        BeanUtil.copyBeanToBean(charMappingPager, form, op -> {
            op.exclude(Constants.PAGER_CONVERSION_RULE);
        });
    }

        // Test with null
        searchRenderData.setFacetResponse(null);
        assertNull(searchRenderData.getFacetResponse());

        // Test with FacetResponse object created from empty Aggregations
        List<Aggregation> aggregationList = new ArrayList<>();
        Aggregations aggregations = new Aggregations(aggregationList);
        FacetResponse facetResponse = new FacetResponse(aggregations);

 * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
 * good job of distributing the elements to the buckets to a distribution not far from uniform), and
 * amortized since some operations can trigger a hash table resize.
 *
 * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()},