*/
    public abstract OptionalEntity<T> get(long id);

    /**
     * Inserts a new dictionary item.
     *
     * @param item the item to insert
     */
    public abstract void insert(T item);

    /**
     * Updates an existing dictionary item.
     *
     * @param item the item to update
     */
    public abstract void update(T item);

    /**

substr(0,1).toUpperCase()+b.substr(1,b.length)}),c.join(" ")},insert:function(a,b,c){var d=(b.attr("data-sanitize-insert-"+c)||"").replace(/\[SPACE\]/g," ");return"left"===c&&0===a.indexOf(d)||"right"===c&&a.substring(a.length-d.length)===d?a:("left"===c?d:"")+a+("right"===c?d:"")},insertRight:function(a,b){return this.insert(a,b,"right")},insertLeft:function(a,b){return this.insert(a,b,"left")},numberFormat:function(a,c){if(0===a.length)return a;if(!("numeral"in b))throw new ReferenceError('Using...

 * use a secondary key to break ties in primary priority values. For example, here is a class that
 * applies first-in-first-out tie-breaking to comparable elements. To use it, you would insert a
 * {@code new FIFOEntry(anEntry)} instead of a plain entry object.
 *
 * <pre>{@code
 * class FIFOEntry<E extends Comparable<? super E>> implements Comparable<FIFOEntry<E>> {
 *   static final AtomicLong seq = new AtomicLong();
 *

//
// Permission to use, copy, modify, and distribute this software
// and its documentation for NON-COMMERCIAL or COMMERCIAL purposes and
// without fee is hereby granted, provided that this copyright notice is kept
// intact.
//
// WIDGET WORKSHOP MAKES NO REPRESENTATIONS OR WARRANTIES ABOUT THE SUITABILITY
// OF THE SOFTWARE, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
// TO THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A

        }

        return new PagingList<>(synonymItemList.subList(offset, toIndex), offset, size, synonymItemList.size());
    }

    @Override
    public synchronized void insert(final SynonymItem item) {
        try (SynonymUpdater updater = new SynonymUpdater(item)) {
            reload(updater);
        }
    }

    @Override

		mkTest(16, 4, 8),
		// Exact simple majority consensus
		mkTest(16, 4, 9),
		// non-tiered object require read quorum of EcM
		nonTieredTest(15, 3, 12),
		// non-tiered object with fewer than EcM in consensus
		nonTieredTest(15, 3, 11),
		// non-tiered object require read quorum of EcM
		nonTieredTest(16, 4, 12),
		// non-tiered object with fewer than EcM in consensus
		nonTieredTest(16, 4, 11),
	}
	for i, test := range tests {

    //                                                                              ======
    public void insert(CrawlingInfo entity) {
        doInsert(entity, null);
    }

    public void insert(CrawlingInfo entity, RequestOptionCall<IndexRequestBuilder> opLambda) {
        entity.asDocMeta().indexOption(opLambda);
        doInsert(entity, null);
    }

    //                                                                              ======
    public void insert(ElevateWord entity) {
        doInsert(entity, null);
    }

    public void insert(ElevateWord entity, RequestOptionCall<IndexRequestBuilder> opLambda) {
        entity.asDocMeta().indexOption(opLambda);
        doInsert(entity, null);
    }

    //                                                                              ======
    public void insert(PathMapping entity) {
        doInsert(entity, null);
    }

    public void insert(PathMapping entity, RequestOptionCall<IndexRequestBuilder> opLambda) {
        entity.asDocMeta().indexOption(opLambda);
        doInsert(entity, null);
    }

    //                                                                              ======
    public void insert(FileAuthentication entity) {
        doInsert(entity, null);
    }

    public void insert(FileAuthentication entity, RequestOptionCall<IndexRequestBuilder> opLambda) {
        entity.asDocMeta().indexOption(opLambda);
        doInsert(entity, null);
    }