}
                                    }
                                },
                            },
                        },
                        "summary": "Create Index Weights",
                        "operationId": "create_index_weights_index_weights__post",
                        "requestBody": {
                            "content": {

            result.setValue(DfTypeUtil.toString(source.get("value")));
            return updateEntity(source, result);
        } catch (InstantiationException | IllegalAccessException e) {
            final String msg = "Cannot create a new instance: " + entityType.getName();
            throw new IllegalBehaviorStateException(msg, e);
        }
    }

            result.setValue(DfTypeUtil.toString(source.get("value")));
            return updateEntity(source, result);
        } catch (InstantiationException | IllegalAccessException e) {
            final String msg = "Cannot create a new instance: " + entityType.getName();
            throw new IllegalBehaviorStateException(msg, e);
        }
    }

    protected <RESULT extends RoleType> RESULT updateEntity(Map<String, Object> source, RESULT result) {

            result.setUpdatedAt(toLocalDateTime(source.get("updatedAt")));
            return updateEntity(source, result);
        } catch (InstantiationException | IllegalAccessException e) {
            final String msg = "Cannot create a new instance: " + entityType.getName();
            throw new IllegalBehaviorStateException(msg, e);
        }
    }

    protected <RESULT extends UserInfo> RESULT updateEntity(Map<String, Object> source, RESULT result) {

 * highest valued character that requires escaping. For example a replacement map containing the
 * single character '{@code \}{@code u1000}' will require approximately 16K of memory. If you need
 * to create multiple escaper instances that have the same character replacement mapping consider
 * using {@link ArrayBasedEscaperMap}.
 *
 * @author Sven Mawson
 * @author David Beaumont
 * @since 15.0
 */
@GwtCompatible

        super.setUp(testInfo);
        responseHeaders = new HashMap<>();
        processCalled = false;
        processOrigin = null;
        processRequest = null;
        processResponse = null;

        // Create a test implementation of CorsHandler
        corsHandler = new CorsHandler() {
            @Override
            public void process(String origin, ServletRequest request, ServletResponse response) {

    public KuromojiNumberFilterFactory(IndexSettings indexSettings, Environment environment, String name, Settings settings) {
        super(indexSettings, name, settings);
    }

    @Override
    public TokenStream create(TokenStream tokenStream) {
        return new JapaneseNumberFilter(tokenStream);
    }

        @Test
        @DisplayName("Should create appropriate response")
        void testCreateResponse() {
            Smb2LockResponse response = request.createResponse(mockContext, request);
            assertNotNull(response);
            assertTrue(response instanceof Smb2LockResponse);
        }

        @Test
        @DisplayName("Should create response with same configuration")

            try {
                final long sourceCount = getDocumentCount(indexName);

                // 1. Create backup index with new mappings
                if (!createIndex(configIndex, backupIndex)) {
                    logger.warn("[Rebuild] Failed to create backup index: {}", backupIndex);
                    success = false;
                    continue;
                }

 * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger
 * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code
 * add(x)} operations <i>do not</i> create objects for the garbage collector to deal with, and for
 * every element added, the garbage collector will have to traverse {@code 1.5} references on
 * average, in the marking phase, not {@code 5.0} as in {@code java.util.HashSet}.