Skip to content
Native build

Implement Transitive Paths using binary search instead of a hash map #4355

Sign in to view logs

Implement Transitive Paths using binary search instead of a hash map

Implement Transitive Paths using binary search instead of a hash map #4355

Run time

Learn about OS pricing on GitHub Actions
Job Run time
build (gcc, 11, -Wall -Wextra -Werror , Release, true)
29m 58s
build (gcc, 12, -Wall -Wextra -Werror , Release, true)
33m 51s
build (gcc, 13, -Wall -Wextra -Werror , Release, true)
31m 4s
build (clang, 16, -Wall -Wextra -Werror , Release, true)
33m 41s
build (clang, 17, -Wall -Wextra -Werror , Release, true)
33m 44s
build (clang, 18, -Wall -Wextra -Werror , Release, true)
32m 34s
build (clang, 16, RelWithDebInfo, false, -fsanitize=address -fno-omit-frame-pointer)
46m 36s
build (clang, 16, RelWithDebInfo, false, -fsanitize=undefined)
39m 46s
build (clang, 17, Debug, false, -fsanitize=thread -O1 -g)
39m 32s
5h 20m 46s