Hackfut Security File Manager
Current Path:
/opt/alt/postgresql11/usr/include/pgsql/server/optimizer
opt
/
alt
/
postgresql11
/
usr
/
include
/
pgsql
/
server
/
optimizer
/
📁
..
📄
clauses.h
(2.88 KB)
📄
cost.h
(7.33 KB)
📄
geqo.h
(2.12 KB)
📄
geqo_copy.h
(966 B)
📄
geqo_gene.h
(1.09 KB)
📄
geqo_misc.h
(1.1 KB)
📄
geqo_mutation.h
(959 B)
📄
geqo_pool.h
(1.29 KB)
📄
geqo_random.h
(1.28 KB)
📄
geqo_recombination.h
(2.58 KB)
📄
geqo_selection.h
(1015 B)
📄
joininfo.h
(836 B)
📄
pathnode.h
(5.53 KB)
📄
paths.h
(6.83 KB)
📄
placeholder.h
(1.2 KB)
📄
plancat.h
(1.65 KB)
📄
planmain.h
(5.1 KB)
📄
planner.h
(1.33 KB)
📄
predtest.h
(668 B)
📄
prep.h
(1.73 KB)
📄
restrictinfo.h
(1.71 KB)
📄
subselect.h
(1.38 KB)
📄
tlist.h
(1.69 KB)
📄
var.h
(1.5 KB)
Editing: geqo_recombination.h
/*------------------------------------------------------------------------- * * geqo_recombination.h * prototypes for recombination in the genetic query optimizer * * Portions Copyright (c) 1996-2012, PostgreSQL Global Development Group * Portions Copyright (c) 1994, Regents of the University of California * * src/include/optimizer/geqo_recombination.h * *------------------------------------------------------------------------- */ /* contributed by: =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*= * Martin Utesch * Institute of Automatic Control * = = University of Mining and Technology = * utesch@aut.tu-freiberg.de * Freiberg, Germany * =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*= */ /* -- parts of this are adapted from D. Whitley's Genitor algorithm -- */ #ifndef GEQO_RECOMBINATION_H #define GEQO_RECOMBINATION_H #include "optimizer/geqo.h" extern void init_tour(PlannerInfo *root, Gene *tour, int num_gene); /* edge recombination crossover [ERX] */ typedef struct Edge { Gene edge_list[4]; /* list of edges */ int total_edges; int unused_edges; } Edge; extern Edge *alloc_edge_table(PlannerInfo *root, int num_gene); extern void free_edge_table(PlannerInfo *root, Edge *edge_table); extern float gimme_edge_table(PlannerInfo *root, Gene *tour1, Gene *tour2, int num_gene, Edge *edge_table); extern int gimme_tour(PlannerInfo *root, Edge *edge_table, Gene *new_gene, int num_gene); /* partially matched crossover [PMX] */ #define DAD 1 /* indicator for gene from dad */ #define MOM 0 /* indicator for gene from mom */ extern void pmx(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene); typedef struct City { int tour2_position; int tour1_position; int used; int select_list; } City; extern City *alloc_city_table(PlannerInfo *root, int num_gene); extern void free_city_table(PlannerInfo *root, City *city_table); /* cycle crossover [CX] */ extern int cx(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene, City *city_table); /* position crossover [PX] */ extern void px(PlannerInfo *root, Gene *tour1, Gene *tour2, Gene *offspring, int num_gene, City *city_table); /* order crossover [OX1] according to Davis */ extern void ox1(PlannerInfo *root, Gene *mom, Gene *dad, Gene *offspring, int num_gene, City *city_table); /* order crossover [OX2] according to Syswerda */ extern void ox2(PlannerInfo *root, Gene *mom, Gene *dad, Gene *offspring, int num_gene, City *city_table); #endif /* GEQO_RECOMBINATION_H */
Upload File
Create Folder