}
    }

    /**
     * Modifies an entry by adding a new attribute.
     *
     * @param modifyList The list of modification items.
     * @param name The name of the attribute.
     * @param value The value of the attribute.
     */

 * requested entries may be evicted on each cache modification.
 *
 * <p>If {@link #expireAfterWrite expireAfterWrite} or {@link #expireAfterAccess expireAfterAccess}
 * is requested entries may be evicted on each cache modification, on occasional cache accesses, or
 * on calls to {@link Cache#cleanUp}. Expired entries may be counted by {@link Cache#size}, but will

 * requested entries may be evicted on each cache modification.
 *
 * <p>If {@link #expireAfterWrite expireAfterWrite} or {@link #expireAfterAccess expireAfterAccess}
 * is requested entries may be evicted on each cache modification, on occasional cache accesses, or
 * on calls to {@link Cache#cleanUp}. Expired entries may be counted by {@link Cache#size}, but will

// Get list of all inputs of a specific operation.  `inputs` must point to
// an array of length at least `max_inputs` (ideally set to
// TF_OperationNumInputs(oper)).  Beware that a concurrent
// modification of the graph can increase the number of inputs of
// an operation.
TF_CAPI_EXPORT extern void TF_OperationAllInputs(TF_Operation* oper,
                                                 TF_Output* inputs,

labels.search_result_sort_content_length_asc=par taille (asc)
labels.search_result_sort_content_length_desc=par taille (desc)
labels.search_result_sort_last_modified_asc=par dernière modification (asc)
labels.search_result_sort_last_modified_desc=par dernière modification (desc)
labels.search_result_sort_click_count_asc=par nombre de clics (asc)
labels.search_result_sort_click_count_desc=par nombre de clics (desc)

    assertTrue(cycle.hasNext());
    cycle.remove();
    assertEquals(emptyList(), iterable);
    assertFalse(cycle.hasNext());
  }

  /** An Iterable whose Iterator is rigorous in checking for concurrent modification. */
  private static final class PickyIterable<E> implements Iterable<E> {
    final List<E> elements;
    int modCount = 0;

    PickyIterable(E... elements) {

    assertTrue(cycle.hasNext());
    cycle.remove();
    assertEquals(emptyList(), iterable);
    assertFalse(cycle.hasNext());
  }

  /** An Iterable whose Iterator is rigorous in checking for concurrent modification. */
  private static final class PickyIterable<E> implements Iterable<E> {
    final List<E> elements;
    int modCount = 0;

    PickyIterable(E... elements) {

              }
              i++;
              /*
               * The cast is safe because of the containsKey check in hasNext(). (That means it's
               * unsafe under concurrent modification, but all bets are off then, anyway.)
               */
              return uncheckedCastNullableTToT(map.get(key));
            }

            @Override
            public void remove() {

              }
              i++;
              /*
               * The cast is safe because of the containsKey check in hasNext(). (That means it's
               * unsafe under concurrent modification, but all bets are off then, anyway.)
               */
              return uncheckedCastNullableTToT(map.get(key));
            }

            @Override
            public void remove() {

labels.search_result_sort_content_length_asc=Tamaño (asc)
labels.search_result_sort_content_length_desc=Tamaño (desc)
labels.search_result_sort_last_modified_asc=Última modificación (asc)
labels.search_result_sort_last_modified_desc=Última modificación (desc)
labels.search_result_sort_click_count_asc=Clics (asc)
labels.search_result_sort_click_count_desc=Clics (desc)
labels.search_result_sort_favorite_count_asc=Favoritos (asc)