requestBody.put(KEY_PROPERTY, keyProp);
        requestBody.put("permissions", "Radmin-api");
        return requestBody;
    }

    @Override
    protected Map<String, Object> getUpdateMap() {
        final Map<String, Object> updateMap = new HashMap<>();
        updateMap.put("permissions", "Radmin-api2");
        return updateMap;
    }

    @Override
    protected void checkUpdate() {

                + DEFAULT_TEST_TOKEN_ID
                + "\"}}\n{\"updatedTime\":1490250145200,\"updatedBy\":\"admin\",\"createdBy\":\"admin\",\"permissions\":[\"Radmin-api\",\"Rguest\"],\"name\":\"Admin API\",\"createdTime\":1490250145200,\"token\":\""
                + DEFAULT_TEST_TOKEN + "\"}\n").when().post(getEsUrl() + "/_bulk");

    /** The key of the configuration. e.g.  */
    String API_ACCESS_TOKEN_REQUEST_PARAMETER = "api.access.token.request.parameter";

    /** The key of the configuration. e.g. Radmin-api */
    String API_ADMIN_ACCESS_PERMISSIONS = "api.admin.access.permissions";

    /** The key of the configuration. e.g.  */
    String API_SEARCH_ACCEPT_REFERERS = "api.search.accept.referers";

      }
    }
    throw new AssertionError();
  }

  /*
   * If n <= millerRabinBases[i][0], then testing n against bases millerRabinBases[i][1..] suffices
   * to prove its primality. Values from miller-rabin.appspot.com.
   *
   * NOTE: We could get slightly better bases that would be treated as unsigned, but benchmarks
   * showed negligible performance improvements.
   */

        .isEqualTo(0x6cf78a4b139a4e2aL);
  }

  public void testParseLongEmptyString() {
    try {
      UnsignedLongs.parseUnsignedLong("");
      fail("NumberFormatException should have been raised.");
    } catch (NumberFormatException expected) {
    }
  }

  public void testParseLongFails() {
    try {
      // One more than maximum value

     * determined experimentally to match our desired probability of false positives.
     */
    // NB: yes, this is surprisingly high, but that's what the experiments said was necessary
    // Raising this number slows the worst-case contains behavior, speeds up hashFloodingDetected,
    // and reduces the false-positive probability.
    static final int MAX_RUN_MULTIPLIER = 13;

    /**

        .isEqualTo(0x6cf78a4b139a4e2aL);
  }

  public void testParseLongEmptyString() {
    try {
      UnsignedLongs.parseUnsignedLong("");
      fail("NumberFormatException should have been raised.");
    } catch (NumberFormatException expected) {
    }
  }

  public void testParseLongFails() {
    try {
      // One more than maximum value

a&-morf,colottad,rebil-a-si,?f-morf,i&-morf,am&-sndnyd,detsohpw,??l&ecelffaw,uf-ytnuob:.a&hpla,teb,?,?ppmswa,ru-&elpmis,taen,?ssukoreh,xegap,?m&n-morf,pml.ppa,rofe&pyt.orp,rerac-htlaeh,?sacrasevres,uirarret-yltsaf,?n&a&cilbuper-a-si,f&-sllub-a-si,racsan-a-si,?i&cisum-a-si,ratrebil-a-si,?tarukas,?c,dc&hsums,umpw,xirtrepmi,?eerg-a-si,i&-morf,jod,?m-morf,o&ehtnaptog,isam-al-a-tse,r&italik,tap-el-tse,?s&iam-al-a-tse,replausunu,??pj,t-morf,?o&bordym,c,hce-namtsop,jodsnd,m&-morf,ed-baltlow,?n:iloxip,,...

    }
  }

  @GwtIncompatible // isPrime is GWT-incompatible
  public void testIsPrimeManyConstants() {
    // Test the thorough test inputs, which also includes special constants in the Miller-Rabin
    // tests.
    for (long l : POSITIVE_LONG_CANDIDATES) {
      assertEquals(BigInteger.valueOf(l).isProbablePrime(100), LongMath.isPrime(l));
    }
  }

  @GwtIncompatible // isPrime is GWT-incompatible