@@ -1895,13 +1895,13 @@ std::shared_ptr<Graph> Graph::optimize_legacy(
1895
1895
// }
1896
1896
bestGraph->constant_and_rotation_elimination ();
1897
1897
return bestGraph;
1898
- } // namespace quartz
1898
+ }
1899
1899
1900
1900
std::shared_ptr<Graph>
1901
1901
Graph::optimize (Context *ctx, const std::string &equiv_file_name,
1902
1902
const std::string &circuit_name, bool print_message,
1903
1903
std::function<float (Graph *)> cost_function,
1904
- double cost_upper_bound, int timeout) {
1904
+ double cost_upper_bound, double timeout) {
1905
1905
if (cost_function == nullptr ) {
1906
1906
cost_function = [](Graph *graph) { return graph->total_cost (); };
1907
1907
}
@@ -1964,7 +1964,7 @@ std::shared_ptr<Graph>
1964
1964
Graph::optimize (const std::vector<GraphXfer *> &xfers, double cost_upper_bound,
1965
1965
const std::string &circuit_name,
1966
1966
const std::string &log_file_name, bool print_message,
1967
- std::function<float (Graph *)> cost_function, int timeout) {
1967
+ std::function<float (Graph *)> cost_function, double timeout) {
1968
1968
if (cost_function == nullptr ) {
1969
1969
cost_function = [](Graph *graph) { return graph->total_cost (); };
1970
1970
}
@@ -2041,8 +2041,8 @@ Graph::optimize(const std::vector<GraphXfer *> &xfers, double cost_upper_bound,
2041
2041
auto new_graph =
2042
2042
graph->apply_xfer (xfer, node, context->has_parameterized_gate ());
2043
2043
auto end = std::chrono::steady_clock::now ();
2044
- if ((int )std::chrono::duration_cast<std::chrono::milliseconds>(end -
2045
- start)
2044
+ if ((double )std::chrono::duration_cast<std::chrono::milliseconds>(end -
2045
+ start)
2046
2046
.count () /
2047
2047
1000.0 >
2048
2048
timeout) {
0 commit comments