* **Step down considerately**: Members of every project come and go. When somebody leaves or
   disengages from the project, they should make it known and take the proper steps to ensure that
   others can pick up where they left off.

This code is not exhaustive or complete. It serves to distill our common understanding of a
collaborative, shared environment, and goals. We expect it to be followed in spirit as much as in
the letter.

* key (as in key-value pair, dictionary key): clave
* array (as in JSON array): array
* API key: API key (do not translate to "clave API")
* 100% test coverage: cobertura de tests del 100%
* back and forth: de un lado a otro
* I/O (as in "input and output"): I/O (do not translate to "E/S")
* Machine Learning: Machine Learning (do not translate to "Aprendizaje Automático")

                            <div class="card-footer">
                                <c:if test="${crudMode == 4}">
                                    <button type="submit" class="btn btn-default" name="back"
                                            value="<la:message key="labels.crawling_info_button_back" />">
                                        <em class="fa fa-arrow-circle-left">

    } else if (exponent > MAX_EXPONENT) {
      return x.signum() * POSITIVE_INFINITY;
    }

    /*
     * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding
     * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or
     * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the
     * top SIGNIFICAND_BITS + 1.
     *

 limitations under the License.
-->
Contributing to Apache Maven
======================

You have found a bug or you have an idea for a cool new feature? Contributing
code is a great way to give something back to the open source community. Before
you dig right into the code, there are a few guidelines that we need
contributors to follow so that we can have a chance of keeping on top of
things.

        assertTrue(queryCommand.lowercaseWildcard);

        // Test setting to false
        queryCommand.setLowercaseWildcard(false);
        assertFalse(queryCommand.lowercaseWildcard);

        // Test setting back to true
        queryCommand.setLowercaseWildcard(true);
        assertTrue(queryCommand.lowercaseWildcard);
    }

    public void test_convertWildcardQuery_withBoost() throws Exception {

        assertEquals("updated", item.toLineString());

        // When marked for deletion
        item.setNewInput("");
        assertEquals("", item.toLineString());

        // When newInput is set back to null
        item.setNewInput(null);
        assertEquals("original", item.toLineString());
    }

    public void test_toLineString_withEmptyInput() {
        // Test toLineString with empty original input

    Iterator<String> iterator = Lists.newArrayList("manny", "mo", "jack").iterator();
    assertEquals(1, Iterators.indexOf(iterator, equalTo("mo")));
    assertEquals("jack", iterator.next());
    assertFalse(iterator.hasNext());
  }

  public void testIndexOf_consumedDataWithDuplicates() {
    Iterator<String> iterator = Lists.newArrayList("manny", "mo", "mo", "jack").iterator();

But it's signed. So, when you receive a token that you emitted, you can verify that you actually emitted it.

That way, you can create a token with an expiration of, let's say, 1 week. And then when the user comes back the next day with the token, you know that user is still logged in to your system.

   * input.
   */
  @VisibleForTesting(
      )
  static final double HASH_FLOODING_FPP = 0.001;

  /**
   * Maximum allowed length of a hash table bucket before falling back to a j.u.LinkedHashSet based
   * implementation. Experimentally determined.
   */
  private static final int MAX_HASH_BUCKET_LENGTH = 9;