Created
May 25, 2017 19:04
-
-
Save lucasgautheron/530122c9b25c7ce1b5ec497d15b9d5fb to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#0 0x0000000000408e6e in std::__lc_rai<std::random_access_iterator_tag, std::random_access_iterator_tag>::__newlast1<int const*, int const*> ( | |
__last2=__last2@entry=0x7fffffffd938, __first2=__first2@entry=0x7fffffffd930, __last1=__last1@entry=0x7fff64000f28, __first1=__first1@entry=0x7fff64000f20) | |
at /usr/include/c++/5/bits/stl_algobase.h:887 | |
#1 std::__lexicographical_compare_impl<int const*, int const*, __gnu_cxx::__ops::_Iter_less_iter> (__first1=__first1@entry=0x7fff64000f20, | |
__last1=__last1@entry=0x7fff64000f28, __first2=__first2@entry=0x7fffffffd930, __last2=__last2@entry=0x7fffffffd938, __comp=...) | |
at /usr/include/c++/5/bits/stl_algobase.h:895 | |
#2 0x0000000000408ed7 in std::__lexicographical_compare<false>::__lc<int const*, int const*> (__first1=__first1@entry=0x7fff64000f20, | |
__last1=__last1@entry=0x7fff64000f28, __first2=__first2@entry=0x7fffffffd930, __last2=__last2@entry=0x7fffffffd938) at /usr/include/c++/5/bits/stl_algobase.h:922 | |
#3 0x000000000040bdf4 in std::__lexicographical_compare_aux<int const*, int const*> (__last2=<optimized out>, __first2=<optimized out>, __last1=<optimized out>, | |
__first1=<optimized out>) at /usr/include/c++/5/bits/stl_algobase.h:957 | |
#4 std::lexicographical_compare<int const*, int const*> (__last2=<optimized out>, __first2=<optimized out>, __last1=<optimized out>, __first1=<optimized out>) | |
at /usr/include/c++/5/bits/stl_algobase.h:1235 | |
#5 std::operator< <int, 2ul> (__b=..., __a=...) at /usr/include/c++/5/array:253 | |
#6 std::less<std::array<int, 2ul> >::operator() (__y=..., __x=..., this=0x7fff64000ef8) at /usr/include/c++/5/bits/stl_function.h:387 | |
#7 std::_Rb_tree<std::array<int, 2ul>, std::pair<std::array<int, 2ul> const, nuclear_data*>, std::_Select1st<std::pair<std::array<int, 2ul> const, nuclear_data*> >, std::less<std::array<int, 2ul> >, std::allocator<std::pair<std::array<int, 2ul> const, nuclear_data*> > >::_M_lower_bound (this=this@entry=0x6129a0 <nuclear_table>, | |
__x=0x7fff64000f00, __y=0x6cdfa0, __y@entry=0x6129a8 <nuclear_table+8>, __k=...) at /usr/include/c++/5/bits/stl_tree.h:1644 | |
#8 0x000000000040be2a in std::_Rb_tree<std::array<int, 2ul>, std::pair<std::array<int, 2ul> const, nuclear_data*>, std::_Select1st<std::pair<std::array<int, 2ul> const, nuclear_data*> >, std::less<std::array<int, 2ul> >, std::allocator<std::pair<std::array<int, 2ul> const, nuclear_data*> > >::find (this=0x6129a0 <nuclear_table>, | |
__k=...) at /usr/include/c++/5/bits/stl_tree.h:2308 | |
#9 0x000000000040b775 in std::map<std::array<int, 2ul>, nuclear_data*, std::less<std::array<int, 2ul> >, std::allocator<std::pair<std::array<int, 2ul> const, nuclear_data*> > >::count (__x=..., this=<optimized out>) at /usr/include/c++/5/bits/stl_map.h:892 | |
#10 nucleus_mass (Z=35, A=93) at ./includes/nuclear.h:54 | |
#11 beta_decay_Q (Z=35, A=93) at ./includes/nuclear.h:62 | |
#12 electron_capture_fit (A=A@entry=93, Z=Z@entry=35, T=T@entry=0.43651583224016599, mu_e=mu_e@entry=19.830531175942845, mu_nu=mu_nu@entry=0, Q=Q@entry=10000000000) | |
at src/physics.cpp:17 | |
#13 0x000000000040616f in main._omp_fn.0(void) () at src/main.cpp:141 | |
#14 0x00007ffff6a1bcbf in GOMP_parallel () from /usr/lib/x86_64-linux-gnu/libgomp.so.1 | |
#15 0x000000000040671b in main (argc=<optimized out>, argv=<optimized out>) at src/main.cpp:78 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment