「view this page in B3 βῆτα server」

Revisions №60615

branch: master 「№60615」
Commited by: Jack Maguire
GitHub commit link: 「664c7d28d7cb2c69」 「№3789」
Difference from previous tested commit:  code diff
Commit date: 2019-02-07 14:40:15
linux.clang linux.gcc linux.srlz mac.clang
linux.PyRosetta.unit linux.gcc.python36.PyRosetta4.unit mac.PyRosetta.unit build.clean.debug cppcheck mysql postgres linux.zeromq.debug mpi mpi.serialization linux.icc.build.debug OpenCL build.header build.levels ninja graphics static linux.ui mac.ui build.xcode beautification code_quality.clang_analysis serialization integration.mpi integration.release_debug integration.tutorials integration.ubsan integration maintenance.documentation performance profile linux.clang.python35.release.PyRosetta4.Debug linux.clang.python36.release.PyRosetta4.Debug release.PyRosetta4.MinSizeRel ubuntu.clang.python27.release.PyRosetta4.Release ubuntu.clang.python35.release.PyRosetta4.Release ubuntu.clang.python36.release.PyRosetta4.Release release.source linux.clang.score linux.gcc.score mac.clang.score linux.scripts.pyrosetta scripts.rosetta.parse scripts.rosetta.validate scripts.rosetta.verify unit.addsan linux.clang.unit.release linux.gcc.unit.release

Merge pull request #3789 from RosettaCommons/JackMaguire/HBNetFlatSet Replacing HBNet's sorted vectors with boost flat_sets One of the messiest things I added to HBNet was sorted vectors. They helped with performance but littered the code with `std::lower_bound` and `std::binary_search`. I'm going through and replacing them with boost's flat containers (ordered sets and maps that are built on top of vectors) to keep the performance benefits without all the mess. Thanks to Brian for the review!

Test: linux.clang.integration.tutorials

Failed sub-tests (click for more details):
Test: ubuntu.gcc.integration.ubsan

Failed sub-tests (click for more details):