<!doctype html>
<html lang="en">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<title>crates/resolver-tests/README.md - fork/cargo @ master</title>
<meta name="description" content="crates/resolver-tests/README.md in fork/cargo at master.">
<meta property="og:title" content="crates/resolver-tests/README.md - fork/cargo @ master">
<meta property="og:description" content="crates/resolver-tests/README.md in fork/cargo at master.">
<meta property="og:type" content="website">
<meta property="og:site_name" content="git.julia.blue">
<link rel="stylesheet" href="/css/style.css?v=62">
<script type="module" src="/js/main.js?v=62"></script>
</head>
<body>
<main data-ref="master" data-tip="623444427f04292f3a3c7eac560cfa65ba0bb88e">
<noscript>
  <div class="callout">
    <p>
      hey! this is a static git repo viewer. commit diffs, file history,
      older commits and other revisions won't load without javascript.
    </p>
    <p>
      you are still able to view source files on branch/tag tips,
      but the experience is degraded.
    </p>
  </div>
</noscript>
<header class="repo"><div>
<h1>fork/cargo</h1>
</div>
<pre class="clone">git clone https://git.julia.blue/fork/cargo</pre>
</header>
<p class="snapshot-commit"><span class="commit-author">bors</span><span class="commit-message" data-commit="2652990f5f37c14545bfca387ae5cf38296fae94">Auto merge of #14600 - epage:charter-crates, r=weihanglo</span><span class="snapshot-sha sha" data-commit="2652990f5f37c14545bfca387ae5cf38296fae94">2652990f5</span><time datetime="2024-10-02T18:58:49+00:00" title="2024-10-02 18:58:49 +0000">2024-10-02</time></p>
<header class="topbar"><details class="switcher"><summary>master</summary><div class="menu"><strong>branches</strong><a class="current" href="/fork/cargo/ref/master/">master</a><strong>tags</strong><a href="/fork/cargo/ref/0.87.0/">0.87.0</a><a href="/fork/cargo/ref/0.88.0/">0.88.0</a><a href="/fork/cargo/ref/0.89.0/">0.89.0</a><a href="/fork/cargo/ref/0.90.0/">0.90.0</a><a href="/fork/cargo/ref/0.91.0/">0.91.0</a><a href="/fork/cargo/ref/0.92.0/">0.92.0</a><a href="/fork/cargo/ref/0.93.0/">0.93.0</a><a href="/fork/cargo/ref/home-0.5.12/">home-0.5.12</a><a class="all" href="/fork/cargo/refs">all refs →</a></div></details><nav class="crumbs"><a href="/fork/cargo/">cargo</a> / <a href="/fork/cargo/ref/master/tree/crates/">crates</a> / <a href="/fork/cargo/ref/master/tree/crates/resolver-tests/">resolver-tests</a> / <span class="cur">README.md</span></nav>
<span class="view-stats"><span>1011 B</span><span>17 lines</span></span><span class="actions"><a class="raw" href="/fork/cargo/raw/72a4f7e3c5b1eee0afbfc4f39a06ce3fb53ff708/crates/resolver-tests/README.md">raw</a></span></header>
<div class="markdown-view"><input type="radio" name="markdown-view" id="markdown-rendered" checked><label for="markdown-rendered">rendered</label><input type="radio" name="markdown-view" id="markdown-code"><label for="markdown-code">code</label><section class="readme rendered"><h1>resolver-tests</h1>
<h2>The aim</h2>
<p>This crate aims to test the resolution of Cargo's resolver. It implements a <a href="https://en.wikipedia.org/wiki/SAT_solver">SAT solver</a> to compare with resolution of Cargo's resolver.<br />
This ensures that Cargo's dependency resolution is proven valid by lowering to <a href="https://en.wikipedia.org/wiki/Boolean_satisfiability_problem">SAT problem</a>.</p>
<blockquote>
<p>This crate is maintained by the Cargo team, primarily for use by Cargo
and not intended for external use (except as a transitive dependency). This
crate may make major changes to its APIs or be deprecated without warning.</p>
</blockquote>
<h2>About the test</h2>
<p>The Cargo's resolver is very sensitive to what order it tries to evaluate constraints. This makes it incredibly difficult<br />
to be sure that a handful of tests actually covers all the important permutations of decision-making. The tests not only needs<br />
to hit all the corner cases, it needs to try all of the orders of evaluation. So we use fuzz testing to cover more permutations.</p>
</section><div class="code-panel"><pre class="code src language-markdown"><span class="code-line"><a class="ln" id="L1" href="#L1">1</a><span class="code-text"><a-p>#</a-p> <a-tt>resolver-tests</a-tt></span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L2" href="#L2">2</a><span class="code-text"></span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L3" href="#L3">3</a><span class="code-text"><a-p>##</a-p> <a-tt>The aim</a-tt></span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L4" href="#L4">4</a><span class="code-text"></span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L5" href="#L5">5</a><span class="code-text">This crate aims to test the resolution of Cargo&#39;s resolver. It implements a [SAT solver](https://en.wikipedia.org/wiki/SAT_solver) to compare with resolution of Cargo&#39;s resolver.    </span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L6" href="#L6">6</a><span class="code-text">This ensures that Cargo&#39;s dependency resolution is proven valid by lowering to [SAT problem](https://en.wikipedia.org/wiki/Boolean_satisfiability_problem). </span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L7" href="#L7">7</a><span class="code-text"></span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L8" href="#L8">8</a><span class="code-text"><a-p>&gt; </a-p>This crate is maintained by the Cargo team, primarily for use by Cargo</span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L9" href="#L9">9</a><span class="code-text"><a-p>&gt; </a-p>and not intended for external use (except as a transitive dependency). This</span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L10" href="#L10">10</a><span class="code-text"><a-p>&gt; </a-p>crate may make major changes to its APIs or be deprecated without warning.</span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L11" href="#L11">11</a><span class="code-text"></span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L12" href="#L12">12</a><span class="code-text"><a-p>##</a-p> <a-tt>About the test</a-tt></span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L13" href="#L13">13</a><span class="code-text"></span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L14" href="#L14">14</a><span class="code-text">The Cargo&#39;s resolver is very sensitive to what order it tries to evaluate constraints. This makes it incredibly difficult     </span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L15" href="#L15">15</a><span class="code-text">to be sure that a handful of tests actually covers all the important permutations of decision-making. The tests not only needs    </span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L16" href="#L16">16</a><span class="code-text">to hit all the corner cases, it needs to try all of the orders of evaluation. So we use fuzz testing to cover more permutations.    </span><span class="code-break">
</span></span><span class="code-line"><a class="ln" id="L17" href="#L17">17</a><span class="code-text"></span></span></pre></div></div>
</main>
</body>
</html>
