mirror of https://github.com/YosysHQ/yosys.git
0265d7b100
std::set<> internally is often a red-black tree which is fairly expensive to create but fast to lookup. In the case of sort_and_unify(), a set<> is constructed as a temporary object to attempt to speed up lookups. Being a temporarily, however, the cost of creation far outweights the lookup improvement and is a net performance loss. Instead, sort the vector<> that already exists and then apply std::unique(). |
||
|---|---|---|
| .. | ||
| bitpattern.h | ||
| calc.cc | ||
| cellaigs.cc | ||
| cellaigs.h | ||
| celltypes.h | ||
| consteval.h | ||
| cost.h | ||
| driver.cc | ||
| hashlib.h | ||
| log.cc | ||
| log.h | ||
| macc.h | ||
| modtools.h | ||
| register.cc | ||
| register.h | ||
| rtlil.cc | ||
| rtlil.h | ||
| satgen.h | ||
| sigtools.h | ||
| utils.h | ||
| yosys.cc | ||
| yosys.h | ||