if (sides.size() > 1) { // explicit mapping
                    if (sides.size() != 2) {
                        throw new DictionaryException("more than one explicit mapping specified on the same line");
                    }
                    final List<String> inputStrings = split(sides.get(0), ",");
                    inputs = new String[inputStrings.size()];

        int firstQueriesCount = testFacetInfo.getAddedQueries().size();

        // Call init again
        facetQueryView.init();

        // Size should remain the same
        assertEquals(firstSize, facetQueryView.getQueryMap().size());
        // But queries would be added again to FacetInfo (distinct handles duplicates)

        assertNotNull(queryFieldConfig.searchFieldSet);
        assertNotNull(queryFieldConfig.facetFieldSet);
        assertNotNull(queryFieldConfig.sortFieldSet);

        // Sets should contain same values as arrays
        assertEquals(queryFieldConfig.searchFields.length, queryFieldConfig.searchFieldSet.size());
        assertEquals(queryFieldConfig.facetFields.length, queryFieldConfig.facetFieldSet.size());

val Project.buildBranch: Provider<String>
    get() = environmentVariable(BUILD_BRANCH).orElse(currentGitBranchViaFileSystemQuery())


/**
 * The logical branch.
 * For non-merge-queue branches this is the same as {@link #buildBranch}.
 * For merge-queue branches, this is the base branch.
 *
 * For example, for the merge queue branch "gh-readonly-queue/master/pr-12345-1a2b3c4d" the logical branch is "master".
 */

arr\n * @argument prop\n * @argument value\n * @returns index or -1\n */\nexport default function find(arr, check) {\n  // use native find if supported\n  if (Array.prototype.find) {\n    return arr.find(check);\n  }\n\n  // use `filter` to obtain the same behavior of `find`\n  return arr.filter(check)[0];\n}\n","import find from './find';\n\n/**\n * Return the index of the matching object\n * @method\n * @memberof Popper.Utils\n * @argument {Array} arr\n * @argument prop\n * @argument value\n * @returns...

        long firstTime = observedTimes[0];
        assertTrue(firstTime > 0, "Time should be updated");
        for (int i = 1; i < 10; i++) {
            Assertions.assertEquals(firstTime, observedTimes[i], "All threads should see same time due to volatile");
        }
    }

    /**
     * Test cache refresh mechanism with concurrent access.
     * Verifies that cache is refreshed correctly even with concurrent readers.
     */
    @Test

        String[] roles2 = secured.value();

        // Different array instances should be returned
        assertNotSame(roles1, roles2);

        // But values should be the same
        assertEquals(roles1.length, roles2.length);
        for (int i = 0; i < roles1.length; i++) {
            assertEquals(roles1[i], roles2[i]);
        }
    }

    // Test annotation with duplicate roles

      the brackets!)  The text should be enclosed in the appropriate
      comment syntax for the file format. We also recommend that a
      file or class name and description of purpose be included on the
      same "printed page" as the copyright notice for easier
      identification within third-party archives.

   Copyright [yyyy] [name of copyright owner]

   Licensed under the Apache License, Version 2.0 (the "License");

                }
                this.endDate = null;
                this.setStartDate(date.clone());
            } else if (!this.endDate && date.isBefore(this.startDate)) {
                //special case: clicking the same date for start/end,
                //but the time of the end date is before the start date
                this.setEndDate(this.startDate.clone());
            } else { // picking end

                        success = false;
                        continue;
                    }
                }

                // 3. Delete old index and recreate with the same name (Bhv layer caches concrete index names)
                deleteIndex(indexName);
                if (!createIndex(configIndex, indexName)) {