Files
ortools-clone/docs/cpp_algorithms/functions_func.html
Laurent Perron faf982ce5d regenerate doc
2019-11-14 13:52:51 -08:00

486 lines
23 KiB
HTML

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>OR-Tools</title>
<meta http-equiv="Content-Type" content="text/html;"/>
<meta charset="utf-8"/>
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
</head>
<body>
<div id="banner-container">
<div id="banner">
<span id="sfml">Google OR-Tools 7.4</span>
</div>
</div>
<div id="content" style="width: 100%; overflow: hidden;">
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
<h2>C++ Reference</h2>
<ul>
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
</ul>
</div>
<div id="content">
<div align="center">
<h1 style="color: #145A32;">C++ Reference: Algorithms</h1>
</div>
<!-- Generated by Doxygen 1.8.16 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow3" class="tabs2">
<ul class="tablist">
<li><a href="functions.html"><span>All</span></a></li>
<li class="current"><a href="functions_func.html"><span>Functions</span></a></li>
<li><a href="functions_vars.html"><span>Variables</span></a></li>
<li><a href="functions_type.html"><span>Typedefs</span></a></li>
<li><a href="functions_enum.html"><span>Enumerations</span></a></li>
<li><a href="functions_eval.html"><span>Enumerator</span></a></li>
</ul>
</div>
<div id="navrow4" class="tabs3">
<ul class="tablist">
<li><a href="#index_a"><span>a</span></a></li>
<li><a href="#index_b"><span>b</span></a></li>
<li><a href="#index_c"><span>c</span></a></li>
<li><a href="#index_d"><span>d</span></a></li>
<li><a href="#index_e"><span>e</span></a></li>
<li><a href="#index_f"><span>f</span></a></li>
<li><a href="#index_g"><span>g</span></a></li>
<li><a href="#index_i"><span>i</span></a></li>
<li><a href="#index_k"><span>k</span></a></li>
<li><a href="#index_l"><span>l</span></a></li>
<li><a href="#index_m"><span>m</span></a></li>
<li><a href="#index_n"><span>n</span></a></li>
<li><a href="#index_p"><span>p</span></a></li>
<li><a href="#index_r"><span>r</span></a></li>
<li><a href="#index_s"><span>s</span></a></li>
<li><a href="#index_t"><span>t</span></a></li>
<li><a href="#index_u"><span>u</span></a></li>
<li><a href="#index_v"><span>v</span></a></li>
<li class="current"><a href="#index__7E"><span>~</span></a></li>
</ul>
</div>
</div><!-- top -->
<div class="contents">
&#160;
<h3><a id="index_a"></a>- a -</h3><ul>
<li>AddMappings()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#aeb46445d022e7bc495f212704791824a">DynamicPermutation</a>
</li>
<li>AllMappingsSrc()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#ac2e0aa1143397953759c0726ec2a865f">DynamicPermutation</a>
</li>
<li>assignment()
: <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#afca45ec0f9ea0c2b36804720f5fa8655">KnapsackSearchNode</a>
</li>
</ul>
<h3><a id="index_b"></a>- b -</h3><ul>
<li>BaseKnapsackSolver()
: <a class="el" href="classoperations__research_1_1BaseKnapsackSolver.html#ac6518fa5a6dd37173c7700bc2d9b6071">BaseKnapsackSolver</a>
</li>
<li>begin()
: <a class="el" href="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#a8497b34029ee966694083aa34c9022b5">DynamicPartition::IterablePart</a>
</li>
<li>best_solution()
: <a class="el" href="classoperations__research_1_1BaseKnapsackSolver.html#af75968e8e76e35de6e7cdfaa0488b131">BaseKnapsackSolver</a>
, <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">KnapsackGenericSolver</a>
</li>
<li>BestSolutionContains()
: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#a57d88f584d14b161580550918c8fbf3b">KnapsackSolver</a>
</li>
</ul>
<h3><a id="index_c"></a>- c -</h3><ul>
<li>ComputeProfitBounds()
: <a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html#a9921c39ed90a9cd32301ee0fee9491cb">KnapsackCapacityPropagator</a>
, <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#a8ae457a5297bac5ad83517ba54b819d1">KnapsackPropagator</a>
</li>
<li>CopyCurrentStateToSolution()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#a1fa45af1bf0d6aa9d5f86e2ed9ae5323">KnapsackPropagator</a>
</li>
<li>CopyCurrentStateToSolutionPropagator()
: <a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html#a706a3a7c9568016131afd718f347ec8d">KnapsackCapacityPropagator</a>
, <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#ab803770e8e21bb448a2f3d940ab125f8">KnapsackPropagator</a>
</li>
<li>CreateSparsePermutation()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#ab2a3a88eea3373db70c745b7b700f79e">DynamicPermutation</a>
</li>
<li>current_profit()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#af41d4ebb02ec2b735851141b01f4769a">KnapsackPropagator</a>
, <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#af41d4ebb02ec2b735851141b01f4769a">KnapsackSearchNode</a>
</li>
</ul>
<h3><a id="index_d"></a>- d -</h3><ul>
<li>DebugString()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#ad07c56b1579801daaf3a9a750d26e792">DynamicPartition</a>
, <a class="el" href="classoperations__research_1_1DynamicPermutation.html#a764be64f3029f8b8e23511061d8de355">DynamicPermutation</a>
, <a class="el" href="classoperations__research_1_1MergingPartition.html#a6097c48821f010becb9a6910f4c39288">MergingPartition</a>
</li>
<li>DenseDoublyLinkedList()
: <a class="el" href="classoperations__research_1_1DenseDoublyLinkedList.html#af3fbdc77fe875334a344eac65f7c556b">DenseDoublyLinkedList</a>
</li>
<li>depth()
: <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#a6fdd73f8011695b97659f2bea29325cb">KnapsackSearchNode</a>
</li>
<li>DistinguishNodeInPartition()
: <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#acb28211fa0581e72d3dcb6b43ebe857a">GraphSymmetryFinder</a>
</li>
<li>DynamicPartition()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#a283c8e838eafb240eb24283ab4288254">DynamicPartition</a>
</li>
<li>DynamicPermutation()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#a460f2957b84beed593ad470bf7c7cd0d">DynamicPermutation</a>
</li>
</ul>
<h3><a id="index_e"></a>- e -</h3><ul>
<li>ElementsInHierarchicalOrder()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#a53166e5f309a55b2753a60b958406340">DynamicPartition</a>
</li>
<li>ElementsInPart()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">DynamicPartition</a>
</li>
<li>ElementsInSamePartAs()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#a897ee69dceefdd60a6a4e90ab8b18a25">DynamicPartition</a>
</li>
<li>end()
: <a class="el" href="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#a152bd708ae8b28ef466f2a3fc7540ae9">DynamicPartition::IterablePart</a>
</li>
</ul>
<h3><a id="index_f"></a>- f -</h3><ul>
<li>FillEquivalenceClasses()
: <a class="el" href="classoperations__research_1_1MergingPartition.html#a62cb833403d7861c5badb4de3389e06e">MergingPartition</a>
</li>
<li>FindSymmetries()
: <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#ad3c41b66c39c8978f4663f3fe74843b5">GraphSymmetryFinder</a>
</li>
<li>FprintOfPart()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#a2a478f293b8fec5ca7e59a82190f0e86">DynamicPartition</a>
</li>
<li>from()
: <a class="el" href="classoperations__research_1_1KnapsackSearchPath.html#aa4d0c972d711bfb97638280fa646f83d">KnapsackSearchPath</a>
</li>
</ul>
<h3><a id="index_g"></a>- g -</h3><ul>
<li>GetEfficiency()
: <a class="el" href="structoperations__research_1_1KnapsackItem.html#a3817595c1fbe521b9f18b15d9b90b1b6">KnapsackItem</a>
</li>
<li>GetLowerAndUpperBoundWhenItem()
: <a class="el" href="classoperations__research_1_1BaseKnapsackSolver.html#ae85c7e2f3bfc7d9a752a3ee4a4205c28">BaseKnapsackSolver</a>
, <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html#a35bfa97bc24861491acb8d3d20087306">KnapsackGenericSolver</a>
</li>
<li>GetName()
: <a class="el" href="classoperations__research_1_1BaseKnapsackSolver.html#ae194e7bee4a383e5ee6c8ed341b49b7e">BaseKnapsackSolver</a>
, <a class="el" href="classoperations__research_1_1KnapsackSolver.html#a9a98946a64f3893b085f650932c9dfee">KnapsackSolver</a>
</li>
<li>GetNextItemId()
: <a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html#afccfe4a5a27c2c805016d82886795da9">KnapsackCapacityPropagator</a>
, <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#a9aea5e61ac71dca1139fda445cc2dfee">KnapsackPropagator</a>
</li>
<li>GetNumberOfItems()
: <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html#a5c677592ee5e7312c64475ebae949eab">KnapsackGenericSolver</a>
, <a class="el" href="classoperations__research_1_1KnapsackState.html#a5c677592ee5e7312c64475ebae949eab">KnapsackState</a>
</li>
<li>GetRoot()
: <a class="el" href="classoperations__research_1_1MergingPartition.html#ae3df79e84e453454062c2c3789b7828e">MergingPartition</a>
</li>
<li>GetRootAndCompressPath()
: <a class="el" href="classoperations__research_1_1MergingPartition.html#ac64dbed5d9196b941f3f53862f77309d">MergingPartition</a>
</li>
<li>GraphSymmetryFinder()
: <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#af0ae1a4d86cfcf11128fe60ea0f8d20b">GraphSymmetryFinder</a>
</li>
</ul>
<h3><a id="index_i"></a>- i -</h3><ul>
<li>ImageOf()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#a1976819faa164a8d10a66200dc2c3a96">DynamicPermutation</a>
</li>
<li>Init()
: <a class="el" href="classoperations__research_1_1BaseKnapsackSolver.html#ac978ac74a7ba1451dd87398ac903234c">BaseKnapsackSolver</a>
, <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html#a51cac72a6280d047002a1b9bf34d7948">KnapsackGenericSolver</a>
, <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#a9fdde4d0e47bfb9ca54f16554a69ce1b">KnapsackPropagator</a>
, <a class="el" href="classoperations__research_1_1KnapsackSearchPath.html#a1e3b6d38df0786ccf7f938d60e386aae">KnapsackSearchPath</a>
, <a class="el" href="classoperations__research_1_1KnapsackSolver.html#a89892382a4f8fa0a4baeb4a3451b8b32">KnapsackSolver</a>
, <a class="el" href="classoperations__research_1_1KnapsackState.html#a6308c7a97200f84f6ebf5b2c487b0362">KnapsackState</a>
</li>
<li>InitPropagator()
: <a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html#ae2545020be753ee6a66c277daac41784">KnapsackCapacityPropagator</a>
, <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#a883cd053b1e7322727eb9e19940f69f6">KnapsackPropagator</a>
</li>
<li>is_bound()
: <a class="el" href="classoperations__research_1_1KnapsackState.html#a89aa280d2321c1316aa1305106f1bb49">KnapsackState</a>
</li>
<li>is_in()
: <a class="el" href="classoperations__research_1_1KnapsackState.html#a862bf4e908cd82ea44f72e98558016ad">KnapsackState</a>
</li>
<li>IsGraphAutomorphism()
: <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#a998043f7ad1e35dc5f6cb23e18f6e7dd">GraphSymmetryFinder</a>
</li>
<li>IsSolutionOptimal()
: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#a9647a5f765048e8662e5efa54c7d8687">KnapsackSolver</a>
</li>
<li>items()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#aa4161d4fb0a577a3e854b7f285d7ace6">KnapsackPropagator</a>
</li>
<li>IterablePart()
: <a class="el" href="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#ac32d6a4490f60f95983b0844091fcbac">DynamicPartition::IterablePart</a>
</li>
</ul>
<h3><a id="index_k"></a>- k -</h3><ul>
<li>KeepOnlyOneNodePerPart()
: <a class="el" href="classoperations__research_1_1MergingPartition.html#a80761f181b521aa284b7e687776b9fde">MergingPartition</a>
</li>
<li>KnapsackAssignment()
: <a class="el" href="structoperations__research_1_1KnapsackAssignment.html#a8f85eb172a4c6bed0d042f7d269fc457">KnapsackAssignment</a>
</li>
<li>KnapsackCapacityPropagator()
: <a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html#a0884060c60d64130c91ee7300cd3c4b0">KnapsackCapacityPropagator</a>
</li>
<li>KnapsackGenericSolver()
: <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html#a2a7bff5cf8a51192eadec54eb0499064">KnapsackGenericSolver</a>
</li>
<li>KnapsackItem()
: <a class="el" href="structoperations__research_1_1KnapsackItem.html#a45f114802d12884173686ec5d073351f">KnapsackItem</a>
</li>
<li>KnapsackPropagator()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#af28391017c090a638200c57b4c8a2ac1">KnapsackPropagator</a>
</li>
<li>KnapsackSearchNode()
: <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#ad17e46a2afcf393a4ec9159162c969f2">KnapsackSearchNode</a>
</li>
<li>KnapsackSearchPath()
: <a class="el" href="classoperations__research_1_1KnapsackSearchPath.html#a3dc3602e1a640bc986956e0ce5e88d04">KnapsackSearchPath</a>
</li>
<li>KnapsackSolver()
: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#a6b46c35c8977efde66ae7ad97423bdf2">KnapsackSolver</a>
</li>
<li>KnapsackState()
: <a class="el" href="classoperations__research_1_1KnapsackState.html#a41f9430cc0090383e7797a88c1dbacbc">KnapsackState</a>
</li>
</ul>
<h3><a id="index_l"></a>- l -</h3><ul>
<li>LooseEnds()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#aa0db30f1e3a5ede55abf64a29259d346">DynamicPermutation</a>
</li>
</ul>
<h3><a id="index_m"></a>- m -</h3><ul>
<li>MergePartsOf()
: <a class="el" href="classoperations__research_1_1MergingPartition.html#a612bd8d97219124a8d6fbac721bcdbc6">MergingPartition</a>
</li>
<li>MergingPartition()
: <a class="el" href="classoperations__research_1_1MergingPartition.html#a4aae0995dc07af7b81fb97104921328d">MergingPartition</a>
</li>
<li>MoveUpToDepth()
: <a class="el" href="classoperations__research_1_1KnapsackSearchPath.html#aa0c092cae536ba7418da2872c7b7d1a4">KnapsackSearchPath</a>
</li>
</ul>
<h3><a id="index_n"></a>- n -</h3><ul>
<li>Next()
: <a class="el" href="classoperations__research_1_1DenseDoublyLinkedList.html#a529953afc5e19c92a74234acf89aa8b5">DenseDoublyLinkedList</a>
</li>
<li>next_item_id()
: <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#a94dca4e57f87ba2a9e3b995c267c0821">KnapsackSearchNode</a>
</li>
<li>NumElements()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#a84daba977c20d7a54c86ef77e8986267">DynamicPartition</a>
</li>
<li>NumNodes()
: <a class="el" href="classoperations__research_1_1MergingPartition.html#af7b62ca470d8de1c1dde577b04671fa7">MergingPartition</a>
</li>
<li>NumNodesInSamePartAs()
: <a class="el" href="classoperations__research_1_1MergingPartition.html#a3d5f7b1e62f42b574085e671ae6dfb73">MergingPartition</a>
</li>
<li>NumParts()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">DynamicPartition</a>
</li>
</ul>
<h3><a id="index_p"></a>- p -</h3><ul>
<li>parent()
: <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#afe9938cf4bbeb06ed8985c37646433fd">KnapsackSearchNode</a>
</li>
<li>ParentOfPart()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#ab8257c32911b0b991bec1af210d993be">DynamicPartition</a>
</li>
<li>PartOf()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#ab22d95d31ef6edfd5a6770ff6d8c4f04">DynamicPartition</a>
</li>
<li>Prev()
: <a class="el" href="classoperations__research_1_1DenseDoublyLinkedList.html#a8946608f3af2665ba4ac8cd789c253b2">DenseDoublyLinkedList</a>
</li>
<li>profit_lower_bound()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#a0dbb4d48acf17b899ecf83ea7e38fdc6">KnapsackPropagator</a>
</li>
<li>profit_upper_bound()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#ade05a213d54a2045bab20c41e56a2144">KnapsackPropagator</a>
, <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#ade05a213d54a2045bab20c41e56a2144">KnapsackSearchNode</a>
</li>
</ul>
<h3><a id="index_r"></a>- r -</h3><ul>
<li>RecursivelyRefinePartitionByAdjacency()
: <a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html#a651a63b1943d8b8fa2346df1d1a2f55c">GraphSymmetryFinder</a>
</li>
<li>Refine()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#a32f3aa9643111b05108d1120e48c1e13">DynamicPartition</a>
</li>
<li>Remove()
: <a class="el" href="classoperations__research_1_1DenseDoublyLinkedList.html#a209f8799ca534e48c873a6613131d358">DenseDoublyLinkedList</a>
</li>
<li>Reset()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#a372de693ad40b3f42839c8ec6ac845f4">DynamicPermutation</a>
, <a class="el" href="classoperations__research_1_1MergingPartition.html#a50eca19efa71a0b70de25f9ad4a2a6f8">MergingPartition</a>
</li>
<li>ResetNode()
: <a class="el" href="classoperations__research_1_1MergingPartition.html#a4368033ed0d5b2fc75727265e0c8f2d7">MergingPartition</a>
</li>
<li>RootOf()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#a5696c0cdd05c22a3fceab054e260660b">DynamicPermutation</a>
</li>
</ul>
<h3><a id="index_s"></a>- s -</h3><ul>
<li>set_current_profit()
: <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#a388481288bf0c9bdc7e3583217150962">KnapsackSearchNode</a>
</li>
<li>set_master_propagator_id()
: <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html#a3df2fc3d96fbcac78a632d7dbf3b8550">KnapsackGenericSolver</a>
</li>
<li>set_next_item_id()
: <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#a9962698a737cd21789c77ff32bef0d98">KnapsackSearchNode</a>
</li>
<li>set_profit_lower_bound()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#a69d95c916b31aeb94a63596cabb507dd">KnapsackPropagator</a>
</li>
<li>set_profit_upper_bound()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#ab7f8c7e53d1f8f72cb6b1a2bffae2407">KnapsackPropagator</a>
, <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html#ab7f8c7e53d1f8f72cb6b1a2bffae2407">KnapsackSearchNode</a>
</li>
<li>set_time_limit()
: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#a6b4f6cbb00a64b0e9745938f9b99d0c8">KnapsackSolver</a>
</li>
<li>set_use_reduction()
: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#aa5b8e0a03c593bfc3cef0ba8d178844f">KnapsackSolver</a>
</li>
<li>Size()
: <a class="el" href="classoperations__research_1_1DenseDoublyLinkedList.html#a24926108b770033792d015cb86aeffb3">DenseDoublyLinkedList</a>
</li>
<li>size()
: <a class="el" href="structoperations__research_1_1DynamicPartition_1_1IterablePart.html#af9593d4a5ff4274efaf429cb4f9e57cc">DynamicPartition::IterablePart</a>
</li>
<li>Size()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#a24926108b770033792d015cb86aeffb3">DynamicPermutation</a>
</li>
<li>SizeOfPart()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#a5634a596b0aa63843c28e8ed69e653ca">DynamicPartition</a>
</li>
<li>Solve()
: <a class="el" href="classoperations__research_1_1BaseKnapsackSolver.html#a64d6539ac3d0d0cd8c1e6c4ea41dac52">BaseKnapsackSolver</a>
, <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html#ad596c251b64c28e1e5b34e9de44b2dd7">KnapsackGenericSolver</a>
, <a class="el" href="classoperations__research_1_1KnapsackSolver.html#a666eb21bb3912d9500caf2c63f5bcefb">KnapsackSolver</a>
</li>
<li>state()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#a9b748c5fb5e1da5da53026ffb91db51f">KnapsackPropagator</a>
</li>
</ul>
<h3><a id="index_t"></a>- t -</h3><ul>
<li>to()
: <a class="el" href="classoperations__research_1_1KnapsackSearchPath.html#af020a457732b35e71f0bce09433ba4f2">KnapsackSearchPath</a>
</li>
</ul>
<h3><a id="index_u"></a>- u -</h3><ul>
<li>UndoLastMappings()
: <a class="el" href="classoperations__research_1_1DynamicPermutation.html#ae8f61c84a06024a7d6343902f44e7e59">DynamicPermutation</a>
</li>
<li>UndoRefineUntilNumPartsEqual()
: <a class="el" href="classoperations__research_1_1DynamicPartition.html#a59a35941a5a6eb3747faddb449a49e2a">DynamicPartition</a>
</li>
<li>Update()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#af4b38123d3654471f0868774c5ff877d">KnapsackPropagator</a>
</li>
<li>UpdatePropagator()
: <a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html#a3cde41b7fa0c9734783a562aadd9ef8c">KnapsackCapacityPropagator</a>
, <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#a5a0d11be6f0d5b521477226fb7573db8">KnapsackPropagator</a>
</li>
<li>UpdateState()
: <a class="el" href="classoperations__research_1_1KnapsackState.html#ab771ac0e538f991b73b011ee3ba11f05">KnapsackState</a>
</li>
<li>use_reduction()
: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#ac7d0a3efa2aabe6a3e667b0724f63688">KnapsackSolver</a>
</li>
</ul>
<h3><a id="index_v"></a>- v -</h3><ul>
<li>via()
: <a class="el" href="classoperations__research_1_1KnapsackSearchPath.html#a1dcc659f782497ac856c5223c0819713">KnapsackSearchPath</a>
</li>
</ul>
<h3><a id="index__7E"></a>- ~ -</h3><ul>
<li>~BaseKnapsackSolver()
: <a class="el" href="classoperations__research_1_1BaseKnapsackSolver.html#ab5b44517ac32ba76590129831a826096">BaseKnapsackSolver</a>
</li>
<li>~KnapsackCapacityPropagator()
: <a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html#aa14e63156675c18c06073ac1cb8aa170">KnapsackCapacityPropagator</a>
</li>
<li>~KnapsackGenericSolver()
: <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html#a2a25594d97a0a532f9d814bdc6dea380">KnapsackGenericSolver</a>
</li>
<li>~KnapsackPropagator()
: <a class="el" href="classoperations__research_1_1KnapsackPropagator.html#accafea74a5951ec85cd803541f3ab3fe">KnapsackPropagator</a>
</li>
<li>~KnapsackSolver()
: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#adecc1cf1fe064b843459dd1f8aec12ff">KnapsackSolver</a>
</li>
</ul>
</div><!-- contents -->
</div>
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>