Skip to content
Snippets Groups Projects
Select Git revision
  • benchmark-tools
  • postgres-lambda
  • master default
  • REL9_4_25
  • REL9_5_20
  • REL9_6_16
  • REL_10_11
  • REL_11_6
  • REL_12_1
  • REL_12_0
  • REL_12_RC1
  • REL_12_BETA4
  • REL9_4_24
  • REL9_5_19
  • REL9_6_15
  • REL_10_10
  • REL_11_5
  • REL_12_BETA3
  • REL9_4_23
  • REL9_5_18
  • REL9_6_14
  • REL_10_9
  • REL_11_4
23 results

geqo_recombination.c

  • Tom Lane's avatar
    59464bd6
    Improve implementation of GEQO's init_tour() function. · 59464bd6
    Tom Lane authored
    Rather than filling a temporary array and then copying values to the
    output array, we can generate the required random permutation in-place
    using the Fisher-Yates shuffle algorithm.  This is shorter as well as
    more efficient than before.  It's pretty unlikely that anyone would
    notice a speed improvement, but shorter code is better.
    
    Nathan Wagner, edited a bit by me
    59464bd6
    History
    Improve implementation of GEQO's init_tour() function.
    Tom Lane authored
    Rather than filling a temporary array and then copying values to the
    output array, we can generate the required random permutation in-place
    using the Fisher-Yates shuffle algorithm.  This is shorter as well as
    more efficient than before.  It's pretty unlikely that anyone would
    notice a speed improvement, but shorter code is better.
    
    Nathan Wagner, edited a bit by me