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

Revisions №62009

branch: master 「№62009」
Commited by: Rocco Moretti
GitHub commit link: 「bc73dcc1df28c14a」 「№6390」
Difference from previous tested commit:  code diff
Commit date: 2023-05-10 12:29:39
linux.clang linux.gcc linux.srlz mac.clang
debug
release
unit
linux.clang.cxx11thread.serialization.python37.PyRosetta.unit mac.clang.python38.PyRosetta.unit mpi mpi.serialization build.header build.levels build.ninja_debug beautification code_quality.cppcheck code_quality.merge_size serialization code_quality.submodule_regression integration.mpi integration.release_debug integration.tensorflow integration.thread integration performance profile release.PyRosetta.MinSizeRel release.PyRosetta.Release linux.clang.score linux.gcc.score mac.clang.score linux.scripts.pyrosetta scripts.rosetta.parse scripts.rosetta.validate scripts.rosetta.verify util.apps windows.build.debug windows.build.release

Merge pull request #6390 from RosettaCommons/roccomoretti/iterative_kinematic_clone Convert kinematics::tree::Atom::clone() to use a non-recursive algorithm The kinematics::tree::Atom::clone() is currently a recursive one, which looks to potentially have issues with stack size limits on certain machines for large proteins. (Well, possibly. That's the best tea-leaf reading we have for some issues we see on Foldit with M1 Macs.) It looks rather straightforward to hold the "todo" list on the heap, and handle the parent/child reassignment non-recursively. This should avoid ultra-deep program stacks, and does not seem to affect program runtime.

...
Test: linux.gcc.code_quality.beautification

 View log

Loading...

 View log in dialog  View log in log in separate window
Test: linux.gcc.mpi.serialization.integration.mpi

Failed sub-tests (click for more details):
replica_docking