constraints.CronExpression.message = {item} は正しい CRON 表記ではありません。

# ----------------------------------------------------------
# Application Exception
# ---------------------
# /- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# five framework-embedded messages (don't change key names)
# - - - - - - - - - -/
errors.login.failure = ログインに失敗しました。
errors.app.illegal.transition = 不正な遷移のため、再度実行してください。

   *     DIRTY 1ab96a171faeeee38496d8b330771a7a
   *     CLEAN 1ab96a171faeeee38496d8b330771a7a 1600 234
   *     READ 335c4c6028171cfddfbaae1a9c313c52
   *     READ 3400330d1dfc7f3f7f4b8d4d803dfcf6
   *
   * The first five lines of the journal form its header. They are the constant string
   * "libcore.io.DiskLruCache", the disk cache's version, the application's version, the value
   * count, and a blank line.
   *

 *
 * <p>{@code Multiset} refines the specifications of several methods from {@code Collection}. It
 * also defines an additional query operation, {@link #count}, which returns the count of an
 * element. There are five new bulk-modification operations, for example {@link #add(Object, int)},
 * to add or remove multiple occurrences of an element at once, or to set the count of an element to

    return ImmutableList.copyOf(SORTED_NUMBER_NAMES.subList(i, j));
  }

  private static final ImmutableList<String> NUMBER_NAMES =
      ImmutableList.of("one", "two", "three", "four", "five", "six", "seven");

  private static final ImmutableList<String> SORTED_NUMBER_NAMES =
      Ordering.<String>natural().immutableSortedCopy(NUMBER_NAMES);

a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library.  The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom.  The Lesser General
Public License permits more lax criteria for linking other code with
the library.

  We call this license the "Lesser" General Public License because it

aign\u000faffinitylottery\u0004glug\u0003lug\u0004lugs\u000braffleentry\rweeklylottery\u0003phx\u0009ann-arbor\u0003cog\u0003dst\u0005eaton\u0009washtenaw\u0003mel\nlambda-url\u000ftransfer-webapp\u0014transfer-webapp-fips\u0008notebook\u0008labeling\rnotebook-fips\u000bstudio-fips\u0004alp1\u0003eur\u0008fr-par-1\u0008fr-par-2\u0008nl-ams-1\u0007cockpit\u0003ddl\u0004dtwh\u0003fnc\u0003ifr\u0004kafk\u0004mgdb\u0003rdb\ns3-website\u0004scbl\u0003whm\ncn-north-1\u000ecn-northwest-1\u0002eb\naws-c...

	FCVTZUS F12, R29                           // 9d01399e
	FCVTZUDW F27, R22                          // 7603791e
	FCVTZUD F25, R22                           // 3603799e
	//TODO VFDIV V6.D2, V1.D2, V27.D2          // 3bfc666e
	FDIVS F16, F10, F20                        // 5419301e
	FDIVD F11, F25, F30                        // 3e1b6b1e
	FMADDS F15, F2, F8, F1                     // 01090f1f
	FMADDD F15, F21, F25, F9                   // 29574f1f

      assertIntact(queue);
      assertThat(queue).containsExactlyElementsIn(elements);
    }
  }

  private enum Element {
    ONE,
    TWO,
    THREE,
    FOUR,
    FIVE;
  }

  public void testRandomAddsAndRemoves_duplicateElements() {
    Random random = new Random(0);
    Multiset<Element> elements = HashMultiset.create();

of this is `junit`.</dd>
</dl>


Reviewing and accepting your contribution
-----------------------------------------

We review every contribution carefully to ensure that the change is of high
quality and fits well with the rest of the Elasticsearch codebase. If accepted,
we will merge your change and usually take care of backporting it to
appropriate branches ourselves.

    return ImmutableList.copyOf(SORTED_NUMBER_NAMES.subList(i, j));
  }

  private static final ImmutableList<String> NUMBER_NAMES =
      ImmutableList.of("one", "two", "three", "four", "five", "six", "seven");

  private static final ImmutableList<String> SORTED_NUMBER_NAMES =
      Ordering.<String>natural().immutableSortedCopy(NUMBER_NAMES);