Skip to content
Snippets Groups Projects
Select Git revision
  • merge_vtus_new
  • cdf-nball_excavation
  • staggered_share_A_x
  • jupytext_cooks_membrane_Fbar
  • imprv_doc
  • petsc_v_test
  • pvec_leastsq
  • LIE_FM1a
  • use_MPL_LIE_HM2
  • use_MPL_LIE_HM
  • LIE_solid_compressibility
  • matrix_split_block_id_petsc_HM
  • b_bar_M_more_test
  • bug_fixing_LIE
  • B_bar
  • imprv_local_x_arg
  • fixing
  • master default protected
  • transverse_E_more
  • HM_Hfracture
  • 6.5.3
  • 6.5.2
  • 6.5.1
  • 6.5.0
  • 6.4.3
  • 6.4.2
  • 6.4.1
  • 6.4.0
  • 6.3.3
  • data-explorer-5
  • 6.3.2
  • 6.3.1
  • 6.3.0
  • 6.2.2
  • 6.2.1
  • 6.2.0
  • 6.2.0-rc1
  • 6.1.0
  • 6.1.0-rc1
  • 6.0.8-insitu
40 results
Blame Permalink
Forked from ogs / ogs
Source project has a limited visibility.
  • Dmitri Naumov's avatar
    6178219d
    [MeL] Optimize find element within radius algo. · 6178219d
    Dmitri Naumov authored 
     - Use contigiuos memory for start element's nodes.
 - Store sizes of arrays before for-loops.
 - Extract element_in_radius predicate. (This is surprisingly also an optimization.)
 - Revert to depth-first search. Uses vector instead of deque.
    6178219d
    History
    [MeL] Optimize find element within radius algo.
    Dmitri Naumov authored 
     - Use contigiuos memory for start element's nodes.
 - Store sizes of arrays before for-loops.
 - Extract element_in_radius predicate. (This is surprisingly also an optimization.)
 - Revert to depth-first search. Uses vector instead of deque.
Code owners
Assign users and groups as approvers for specific file changes. Learn more.