import static com.google.common.collect.Multisets.union;
import static com.google.common.collect.Multisets.unmodifiableMultiset;
import static java.util.Arrays.asList;
import static java.util.Collections.sort;

import com.google.common.annotations.GwtIncompatible;
import com.google.common.base.Predicate;
import com.google.common.base.Predicates;
import com.google.common.collect.testing.features.CollectionFeature;

///

### Format the code

There is a script that you can run that will format and clean all your code:

<div class="termy">

```console
$ bash scripts/format.sh
```

</div>

It will also auto-sort all your imports.

## Tests

There is a script that you can run locally to test all the code and generate coverage reports in HTML:

<div class="termy">

```console
$ bash scripts/test-cov-html.sh
```

                    workingDir = "%teamcity.build.checkoutDir%/dogfood-first-for-hash"
                    scriptContent =
                        """
                        set -x
                        MD5=`find . -type f | sort | xargs md5sum | md5sum | awk '{ print $1 }'`
                        echo "##teamcity[setParameter name='env.ORG_GRADLE_PROJECT_versionQualifier' value='gradleception-${'$'}MD5']"
                        """.trimIndent()

 * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data.
 *
 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * topological sort) that only need a way of accessing the predecessors of a node in a graph.
 *
 * <h3>Usage</h3>
 *
 * Given an algorithm, for example:
 *
 * {@snippet :

 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.common.collect;

import static java.util.Collections.sort;
import static java.util.Collections.unmodifiableMap;

import com.google.caliper.BeforeExperiment;
import com.google.caliper.Benchmark;
import com.google.caliper.Param;

        StringBuilder output = new StringBuilder();
        output.append(readFileToString(inputFile, "UTF-8"));
        output.append("\n\n");
        // This is a map rather than a set so that the sort order is the 3rd
        // party component names, unaffected by the full path to the various files
        final Map<String, File> seen = new TreeMap<String, File>();
        FileCollection noticeFiles = getNoticeFiles();

		</la:select>
	</fieldset>
	<fieldset class="mb-3">
		<legend><la:message key="labels.index_sort" /></legend>
		<label for="sortSearchOption"><la:message key="labels.index_sort" /></label>
		<la:select property="sort" styleId="sortSearchOption"
			styleClass="form-control">
			<option value="">
				<la:message key="labels.search_result_select_sort" />
			</option>
			<la:option value="score.desc">

		</la:select>
	</fieldset>
	<fieldset class="mb-3">
		<legend><la:message key="labels.index_sort" /></legend>
		<label for="sortSearchOption"><la:message key="labels.index_sort" /></label>
		<la:select property="sort" styleId="sortSearchOption"
			styleClass="form-control">
			<option value="">
				<la:message key="labels.search_result_select_sort" />
			</option>
			<la:option value="score.desc">

func (m metaCacheEntries) less(i, j int) bool {
	return m[i].name < m[j].name
}

// sort entries by name.
// m is sorted and a sorted metadata object is returned.
// Changes to m will also be reflected in the returned object.
func (m metaCacheEntries) sort() metaCacheEntriesSorted {
	if m.isSorted() {
		return metaCacheEntriesSorted{o: m}
	}
	sort.Slice(m, m.less)
	return metaCacheEntriesSorted{o: m}
}

standards, including sustained inappropriate behavior,  harassment of an
individual, or aggression toward or disparagement of classes of individuals.

**Consequence**: A permanent ban from any sort of public interaction within
the community.

## Attribution

This Code of Conduct is adapted from the [Contributor Covenant][homepage],
version 2.0, available at