/dports/databases/percona56-client/percona-server-5.6.51-91.0/sql/ |
H A D | gcalc_tools.h | 254 int count_all(Gcalc_heap *hp); 390 const Gcalc_heap::Info *p0, 391 const Gcalc_heap::Info *p1, 396 const Gcalc_heap::Info *p0, 397 const Gcalc_heap::Info *p1, 399 int add_single_point(const Gcalc_heap::Info *p); 403 const Gcalc_heap::Info *p0, 404 const Gcalc_heap::Info *p1, 408 const Gcalc_heap::Info *p0, 409 const Gcalc_heap::Info *p1, [all …]
|
H A D | gcalc_slicescan.h | 127 class Gcalc_heap : public Gcalc_dyn_list 147 Gcalc_heap(size_t blk_size=8192) : 213 Gcalc_heap::Info *m_first; 214 Gcalc_heap::Info *m_prev; 218 Gcalc_heap *m_heap; 257 Gcalc_shape_transporter(Gcalc_heap *heap) : in Gcalc_shape_transporter() 332 Gcalc_heap::Info *pi; 333 Gcalc_heap::Info *next_pi; 371 void init(Gcalc_heap *points); /* Iterator can be reused */ 379 inline Gcalc_heap::Info *more_points() { return m_cur_pi; } in more_points() [all …]
|
H A D | gcalc_slicescan.cc | 128 static inline void trim_node(Gcalc_heap::Info *node, Gcalc_heap::Info *prev_node) in trim_node() 139 static double find_first_different(const Gcalc_heap::Info *p) in find_first_different() 156 const Gcalc_heap::Info *i0= (const Gcalc_heap::Info *)e0; in compare_point_info() 157 const Gcalc_heap::Info *i1= (const Gcalc_heap::Info *)e1; in compare_point_info() 169 void Gcalc_heap::Info::dbug_print() const in dbug_print() 184 void Gcalc_heap::prepare_operation() in prepare_operation() 207 void Gcalc_heap::reset() in reset() 236 Gcalc_heap::Info *point; in int_add_point() 281 const Gcalc_heap::Info *p0, const Gcalc_heap::Info *p1) in GET_DX_DY() 314 void Gcalc_scan_iterator::init(Gcalc_heap *points) in init() [all …]
|
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/sql/ |
H A D | gcalc_tools.h | 254 int count_all(Gcalc_heap *hp); 390 const Gcalc_heap::Info *p0, 391 const Gcalc_heap::Info *p1, 396 const Gcalc_heap::Info *p0, 397 const Gcalc_heap::Info *p1, 399 int add_single_point(const Gcalc_heap::Info *p); 403 const Gcalc_heap::Info *p0, 404 const Gcalc_heap::Info *p1, 408 const Gcalc_heap::Info *p0, 409 const Gcalc_heap::Info *p1, [all …]
|
H A D | gcalc_slicescan.h | 127 class Gcalc_heap : public Gcalc_dyn_list 147 Gcalc_heap(size_t blk_size=8192) : 213 Gcalc_heap::Info *m_first; 214 Gcalc_heap::Info *m_prev; 218 Gcalc_heap *m_heap; 257 Gcalc_shape_transporter(Gcalc_heap *heap) : in Gcalc_shape_transporter() 332 Gcalc_heap::Info *pi; 333 Gcalc_heap::Info *next_pi; 371 void init(Gcalc_heap *points); /* Iterator can be reused */ 379 inline Gcalc_heap::Info *more_points() { return m_cur_pi; } in more_points() [all …]
|
H A D | gcalc_slicescan.cc | 128 static inline void trim_node(Gcalc_heap::Info *node, Gcalc_heap::Info *prev_node) in trim_node() 139 static double find_first_different(const Gcalc_heap::Info *p) in find_first_different() 156 const Gcalc_heap::Info *i0= (const Gcalc_heap::Info *)e0; in compare_point_info() 157 const Gcalc_heap::Info *i1= (const Gcalc_heap::Info *)e1; in compare_point_info() 169 void Gcalc_heap::Info::dbug_print() const in dbug_print() 184 void Gcalc_heap::prepare_operation() in prepare_operation() 207 void Gcalc_heap::reset() in reset() 236 Gcalc_heap::Info *point; in int_add_point() 281 const Gcalc_heap::Info *p0, const Gcalc_heap::Info *p1) in GET_DX_DY() 314 void Gcalc_scan_iterator::init(Gcalc_heap *points) in init() [all …]
|
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/sql/ |
H A D | gcalc_tools.h | 254 int count_all(Gcalc_heap *hp); 390 const Gcalc_heap::Info *p0, 391 const Gcalc_heap::Info *p1, 396 const Gcalc_heap::Info *p0, 397 const Gcalc_heap::Info *p1, 399 int add_single_point(const Gcalc_heap::Info *p); 403 const Gcalc_heap::Info *p0, 404 const Gcalc_heap::Info *p1, 408 const Gcalc_heap::Info *p0, 409 const Gcalc_heap::Info *p1, [all …]
|
H A D | gcalc_slicescan.h | 127 class Gcalc_heap : public Gcalc_dyn_list 147 Gcalc_heap(size_t blk_size=8192) : 213 Gcalc_heap::Info *m_first; 214 Gcalc_heap::Info *m_prev; 218 Gcalc_heap *m_heap; 257 Gcalc_shape_transporter(Gcalc_heap *heap) : in Gcalc_shape_transporter() 332 Gcalc_heap::Info *pi; 333 Gcalc_heap::Info *next_pi; 371 void init(Gcalc_heap *points); /* Iterator can be reused */ 379 inline Gcalc_heap::Info *more_points() { return m_cur_pi; } in more_points() [all …]
|
H A D | gcalc_slicescan.cc | 128 static inline void trim_node(Gcalc_heap::Info *node, Gcalc_heap::Info *prev_node) in trim_node() 139 static double find_first_different(const Gcalc_heap::Info *p) in find_first_different() 156 const Gcalc_heap::Info *i0= (const Gcalc_heap::Info *)e0; in compare_point_info() 157 const Gcalc_heap::Info *i1= (const Gcalc_heap::Info *)e1; in compare_point_info() 169 void Gcalc_heap::Info::dbug_print() const in dbug_print() 184 void Gcalc_heap::prepare_operation() in prepare_operation() 207 void Gcalc_heap::reset() in reset() 236 Gcalc_heap::Info *point; in int_add_point() 281 const Gcalc_heap::Info *p0, const Gcalc_heap::Info *p1) in GET_DX_DY() 314 void Gcalc_scan_iterator::init(Gcalc_heap *points) in init() [all …]
|
/dports/databases/percona56-server/percona-server-5.6.51-91.0/sql/ |
H A D | gcalc_tools.h | 254 int count_all(Gcalc_heap *hp); 390 const Gcalc_heap::Info *p0, 391 const Gcalc_heap::Info *p1, 396 const Gcalc_heap::Info *p0, 397 const Gcalc_heap::Info *p1, 399 int add_single_point(const Gcalc_heap::Info *p); 403 const Gcalc_heap::Info *p0, 404 const Gcalc_heap::Info *p1, 408 const Gcalc_heap::Info *p0, 409 const Gcalc_heap::Info *p1, [all …]
|
H A D | gcalc_slicescan.h | 127 class Gcalc_heap : public Gcalc_dyn_list 147 Gcalc_heap(size_t blk_size=8192) : 213 Gcalc_heap::Info *m_first; 214 Gcalc_heap::Info *m_prev; 218 Gcalc_heap *m_heap; 257 Gcalc_shape_transporter(Gcalc_heap *heap) : in Gcalc_shape_transporter() 332 Gcalc_heap::Info *pi; 333 Gcalc_heap::Info *next_pi; 371 void init(Gcalc_heap *points); /* Iterator can be reused */ 379 inline Gcalc_heap::Info *more_points() { return m_cur_pi; } in more_points() [all …]
|
/dports/databases/mysql56-client/mysql-5.6.51/sql/ |
H A D | gcalc_tools.h | 254 int count_all(Gcalc_heap *hp); 390 const Gcalc_heap::Info *p0, 391 const Gcalc_heap::Info *p1, 396 const Gcalc_heap::Info *p0, 397 const Gcalc_heap::Info *p1, 399 int add_single_point(const Gcalc_heap::Info *p); 403 const Gcalc_heap::Info *p0, 404 const Gcalc_heap::Info *p1, 408 const Gcalc_heap::Info *p0, 409 const Gcalc_heap::Info *p1, [all …]
|
H A D | gcalc_slicescan.h | 127 class Gcalc_heap : public Gcalc_dyn_list 147 Gcalc_heap(size_t blk_size=8192) : 213 Gcalc_heap::Info *m_first; 214 Gcalc_heap::Info *m_prev; 218 Gcalc_heap *m_heap; 257 Gcalc_shape_transporter(Gcalc_heap *heap) : in Gcalc_shape_transporter() 332 Gcalc_heap::Info *pi; 333 Gcalc_heap::Info *next_pi; 371 void init(Gcalc_heap *points); /* Iterator can be reused */ 379 inline Gcalc_heap::Info *more_points() { return m_cur_pi; } in more_points() [all …]
|
/dports/databases/mariadb105-client/mariadb-10.5.15/sql/ |
H A D | gcalc_slicescan.h | 229 Gcalc_heap(size_t blk_size=8192) : 234 Gcalc_heap(const Gcalc_heap &gh) : in Gcalc_heap() function 281 Gcalc_heap::Info *m_first; 282 Gcalc_heap::Info *m_prev; 287 Gcalc_heap *m_heap; 381 Gcalc_heap::Info *pi; 382 Gcalc_heap::Info *next_pi; 383 Gcalc_heap::Info *ev_pi; 462 const Gcalc_heap::Info *pi; 501 Gcalc_heap *m_heap; [all …]
|
H A D | gcalc_slicescan.cc | 839 void Gcalc_heap::free_point_info(Gcalc_heap::Info *i, in free_point_info() 850 Gcalc_heap::Info *Gcalc_heap::new_point_info(double x, double y, in new_point_info() 874 Gcalc_heap::Info *isc= (Gcalc_heap::Info *)heap->new_item(); in new_intersection() 888 Gcalc_heap *heap, const Gcalc_heap::Info *p, in new_eq_point() 891 Gcalc_heap::Info *eqp= (Gcalc_heap::Info *)heap->new_item(); in new_eq_point() 969 const Gcalc_heap::Info *i0= (const Gcalc_heap::Info *)e0; in compare_point_info() 970 const Gcalc_heap::Info *i1= (const Gcalc_heap::Info *)e1; in compare_point_info() 1386 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) in node_on_right() 1424 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) in cmp_tops() 1890 const Gcalc_heap::Info *p1, const Gcalc_heap::Info *p2, in calc_t() [all …]
|
/dports/databases/mariadb103-server/mariadb-10.3.34/sql/ |
H A D | gcalc_slicescan.h | 229 Gcalc_heap(size_t blk_size=8192) : 234 Gcalc_heap(const Gcalc_heap &gh) : in Gcalc_heap() function 281 Gcalc_heap::Info *m_first; 282 Gcalc_heap::Info *m_prev; 287 Gcalc_heap *m_heap; 381 Gcalc_heap::Info *pi; 382 Gcalc_heap::Info *next_pi; 383 Gcalc_heap::Info *ev_pi; 462 const Gcalc_heap::Info *pi; 501 Gcalc_heap *m_heap; [all …]
|
H A D | gcalc_slicescan.cc | 839 void Gcalc_heap::free_point_info(Gcalc_heap::Info *i, 850 Gcalc_heap::Info *Gcalc_heap::new_point_info(double x, double y, 874 Gcalc_heap::Info *isc= (Gcalc_heap::Info *)heap->new_item(); 888 Gcalc_heap *heap, const Gcalc_heap::Info *p, 891 Gcalc_heap::Info *eqp= (Gcalc_heap::Info *)heap->new_item(); 969 const Gcalc_heap::Info *i0= (const Gcalc_heap::Info *)e0; 970 const Gcalc_heap::Info *i1= (const Gcalc_heap::Info *)e1; 1386 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) 1424 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) 1890 const Gcalc_heap::Info *p1, const Gcalc_heap::Info *p2, [all …]
|
/dports/databases/mariadb104-server/mariadb-10.4.24/sql/ |
H A D | gcalc_slicescan.h | 229 Gcalc_heap(size_t blk_size=8192) : 234 Gcalc_heap(const Gcalc_heap &gh) : in Gcalc_heap() function 281 Gcalc_heap::Info *m_first; 282 Gcalc_heap::Info *m_prev; 287 Gcalc_heap *m_heap; 381 Gcalc_heap::Info *pi; 382 Gcalc_heap::Info *next_pi; 383 Gcalc_heap::Info *ev_pi; 462 const Gcalc_heap::Info *pi; 501 Gcalc_heap *m_heap; [all …]
|
H A D | gcalc_slicescan.cc | 839 void Gcalc_heap::free_point_info(Gcalc_heap::Info *i, in free_point_info() 850 Gcalc_heap::Info *Gcalc_heap::new_point_info(double x, double y, in new_point_info() 874 Gcalc_heap::Info *isc= (Gcalc_heap::Info *)heap->new_item(); in new_intersection() 888 Gcalc_heap *heap, const Gcalc_heap::Info *p, in new_eq_point() 891 Gcalc_heap::Info *eqp= (Gcalc_heap::Info *)heap->new_item(); in new_eq_point() 969 const Gcalc_heap::Info *i0= (const Gcalc_heap::Info *)e0; in compare_point_info() 970 const Gcalc_heap::Info *i1= (const Gcalc_heap::Info *)e1; in compare_point_info() 1386 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) in node_on_right() 1424 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) in cmp_tops() 1890 const Gcalc_heap::Info *p1, const Gcalc_heap::Info *p2, in calc_t() [all …]
|
/dports/databases/mariadb104-client/mariadb-10.4.24/sql/ |
H A D | gcalc_slicescan.h | 229 Gcalc_heap(size_t blk_size=8192) : 234 Gcalc_heap(const Gcalc_heap &gh) : in Gcalc_heap() function 281 Gcalc_heap::Info *m_first; 282 Gcalc_heap::Info *m_prev; 287 Gcalc_heap *m_heap; 381 Gcalc_heap::Info *pi; 382 Gcalc_heap::Info *next_pi; 383 Gcalc_heap::Info *ev_pi; 462 const Gcalc_heap::Info *pi; 501 Gcalc_heap *m_heap; [all …]
|
H A D | gcalc_slicescan.cc | 839 void Gcalc_heap::free_point_info(Gcalc_heap::Info *i, 850 Gcalc_heap::Info *Gcalc_heap::new_point_info(double x, double y, 874 Gcalc_heap::Info *isc= (Gcalc_heap::Info *)heap->new_item(); 888 Gcalc_heap *heap, const Gcalc_heap::Info *p, 891 Gcalc_heap::Info *eqp= (Gcalc_heap::Info *)heap->new_item(); 969 const Gcalc_heap::Info *i0= (const Gcalc_heap::Info *)e0; 970 const Gcalc_heap::Info *i1= (const Gcalc_heap::Info *)e1; 1386 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) 1424 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) 1890 const Gcalc_heap::Info *p1, const Gcalc_heap::Info *p2, [all …]
|
/dports/databases/mariadb103-client/mariadb-10.3.34/sql/ |
H A D | gcalc_slicescan.h | 229 Gcalc_heap(size_t blk_size=8192) : 234 Gcalc_heap(const Gcalc_heap &gh) : in Gcalc_heap() function 281 Gcalc_heap::Info *m_first; 282 Gcalc_heap::Info *m_prev; 287 Gcalc_heap *m_heap; 381 Gcalc_heap::Info *pi; 382 Gcalc_heap::Info *next_pi; 383 Gcalc_heap::Info *ev_pi; 462 const Gcalc_heap::Info *pi; 501 Gcalc_heap *m_heap; [all …]
|
H A D | gcalc_slicescan.cc | 839 void Gcalc_heap::free_point_info(Gcalc_heap::Info *i, in free_point_info() 850 Gcalc_heap::Info *Gcalc_heap::new_point_info(double x, double y, in new_point_info() 874 Gcalc_heap::Info *isc= (Gcalc_heap::Info *)heap->new_item(); in new_intersection() 888 Gcalc_heap *heap, const Gcalc_heap::Info *p, in new_eq_point() 891 Gcalc_heap::Info *eqp= (Gcalc_heap::Info *)heap->new_item(); in new_eq_point() 969 const Gcalc_heap::Info *i0= (const Gcalc_heap::Info *)e0; in compare_point_info() 970 const Gcalc_heap::Info *i1= (const Gcalc_heap::Info *)e1; in compare_point_info() 1386 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) in node_on_right() 1424 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) in cmp_tops() 1890 const Gcalc_heap::Info *p1, const Gcalc_heap::Info *p2, in calc_t() [all …]
|
/dports/databases/mariadb105-server/mariadb-10.5.15/sql/ |
H A D | gcalc_slicescan.h | 229 Gcalc_heap(size_t blk_size=8192) : 234 Gcalc_heap(const Gcalc_heap &gh) : in Gcalc_heap() function 281 Gcalc_heap::Info *m_first; 282 Gcalc_heap::Info *m_prev; 287 Gcalc_heap *m_heap; 381 Gcalc_heap::Info *pi; 382 Gcalc_heap::Info *next_pi; 383 Gcalc_heap::Info *ev_pi; 462 const Gcalc_heap::Info *pi; 501 Gcalc_heap *m_heap; [all …]
|
H A D | gcalc_slicescan.cc | 839 void Gcalc_heap::free_point_info(Gcalc_heap::Info *i, in free_point_info() 850 Gcalc_heap::Info *Gcalc_heap::new_point_info(double x, double y, in new_point_info() 874 Gcalc_heap::Info *isc= (Gcalc_heap::Info *)heap->new_item(); in new_intersection() 888 Gcalc_heap *heap, const Gcalc_heap::Info *p, in new_eq_point() 891 Gcalc_heap::Info *eqp= (Gcalc_heap::Info *)heap->new_item(); in new_eq_point() 969 const Gcalc_heap::Info *i0= (const Gcalc_heap::Info *)e0; in compare_point_info() 970 const Gcalc_heap::Info *i1= (const Gcalc_heap::Info *)e1; in compare_point_info() 1386 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) in node_on_right() 1424 const Gcalc_heap::Info *edge_a, const Gcalc_heap::Info *edge_b) in cmp_tops() 1890 const Gcalc_heap::Info *p1, const Gcalc_heap::Info *p2, in calc_t() [all …]
|