Documentation: RobotLocomotion/drake@8443c11

Author: drake-jenkins-bot

doxygen_cxx/add__fixed__objects__to__plant_8h__incl.svg

@@ -278,6 +278,7 @@
 <tr id="row_0_4_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_0_4_" class="arrow" onclick="toggleFolder('0_4_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacedrake_1_1geometry.html" target="_self">geometry</a></td><td class="desc"></td></tr>
 <tr id="row_0_4_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_4_0_" class="arrow" onclick="toggleFolder('0_4_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacedrake_1_1geometry_1_1_d_r_a_k_e___n_o___e_x_p_o_r_t.html" target="_self">DRAKE_NO_EXPORT</a></td><td class="desc"></td></tr>
 <tr id="row_0_4_0_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1_d_r_a_k_e___n_o___e_x_p_o_r_t_1_1_encoded_data.html" target="_self">EncodedData</a></td><td class="desc"></td></tr>
+<tr id="row_0_4_0_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1_d_r_a_k_e___n_o___e_x_p_o_r_t_1_1_vtk_gltf_uri_loader.html" target="_self">VtkGltfUriLoader</a></td><td class="desc"></td></tr>
 <tr id="row_0_4_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_4_1_" class="arrow" onclick="toggleFolder('0_4_1_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacedrake_1_1geometry_1_1optimization.html" target="_self">optimization</a></td><td class="desc"></td></tr>
 <tr id="row_0_4_1_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_affine_ball.html" target="_self">AffineBall</a></td><td class="desc">Implements an ellipsoidal convex set represented as an affine scaling of the unit ball {Bu + center | |u|₂ ≤ 1} </td></tr>
 <tr id="row_0_4_1_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_affine_subspace.html" target="_self">AffineSubspace</a></td><td class="desc">An affine subspace (also known as a "flat", a "linear variety", or a "linear
@@ -620,6 +621,8 @@
 <tr id="row_0_10_0_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1planning_1_1graph__algorithms_1_1_max_clique_solver_base.html" target="_self">MaxCliqueSolverBase</a></td><td class="desc">The problem of finding the maximum clique in a graph is known to be NP-complete </td></tr>
 <tr id="row_0_10_0_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1planning_1_1graph__algorithms_1_1_max_clique_solver_via_greedy.html" target="_self">MaxCliqueSolverViaGreedy</a></td><td class="desc">Approximately solves the maximum clique problem via a greedy heuristic </td></tr>
 <tr id="row_0_10_0_2_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1planning_1_1graph__algorithms_1_1_max_clique_solver_via_mip.html" target="_self">MaxCliqueSolverViaMip</a></td><td class="desc">Solves the maximum clique problem to global optimality by solving the mixed-integer program </td></tr>
+<tr id="row_0_10_0_3_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1planning_1_1graph__algorithms_1_1_min_clique_cover_solver_base.html" target="_self">MinCliqueCoverSolverBase</a></td><td class="desc"></td></tr>
+<tr id="row_0_10_0_4_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1planning_1_1graph__algorithms_1_1_min_clique_cover_solver_via_greedy.html" target="_self">MinCliqueCoverSolverViaGreedy</a></td><td class="desc">Approximately solves the min clique cover problem via a greedy heuristic </td></tr>
 <tr id="row_0_10_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span id="arr_0_10_1_" class="arrow" onclick="toggleFolder('0_10_1_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacedrake_1_1planning_1_1test.html" target="_self">test</a></td><td class="desc"></td></tr>
 <tr id="row_0_10_1_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1planning_1_1test_1_1_collision_checker_abstract_test_suite.html" target="_self">CollisionCheckerAbstractTestSuite</a></td><td class="desc"></td></tr>
 <tr id="row_0_10_1_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1planning_1_1test_1_1_collision_checker_construction_params.html" target="_self">CollisionCheckerConstructionParams</a></td><td class="desc"></td></tr>
@@ -1244,6 +1247,7 @@
 <tr id="row_2_30_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structstd_1_1tuple__size_3_01drake_1_1_sorted_pair_3_01_t_01_4_01_4.html" target="_self">tuple_size&lt; drake::SortedPair&lt; T &gt; &gt;</a></td><td class="desc">Support using <code>SortedPair&lt;T&gt;</code> in structured bindings </td></tr>
 <tr id="row_2_31_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classstd_1_1uniform__real__distribution_3_01drake_1_1symbolic_1_1_expression_01_4.html" target="_self">uniform_real_distribution&lt; drake::symbolic::Expression &gt;</a></td><td class="desc">Provides std::uniform_real_distribution, U(a, b), for symbolic expressions </td></tr>
 <tr id="row_3_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classvtk_command.html" target="_self">vtkCommand</a></td><td class="desc"></td></tr>
+<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classvtk_u_r_i_loader.html" target="_self">vtkURILoader</a></td><td class="desc"></td></tr>
 </table>
 </div><!-- directory -->
 </div><!-- contents -->