File Manager

X7ROOT File Manager

Current Path: /usr/include/mysql/server/private

usr / include / mysql / server / private /

ðŸ“ ..
ðŸ“„ aligned.h(1.11 KB)
ðŸ“„ aria_backup.h(1.51 KB)
ðŸ“„ assume_aligned.h(2.29 KB)
ðŸ“ atomic
ðŸ“„ authors.h(9.9 KB)
ðŸ“„ backup.h(1.66 KB)
ðŸ“„ bounded_queue.h(5.95 KB)
ðŸ“„ client_settings.h(1.89 KB)
ðŸ“„ compat56.h(2.23 KB)
ðŸ“„ config.h(14.23 KB)
ðŸ“„ contributors.h(4.76 KB)
ðŸ“„ create_options.h(4.42 KB)
ðŸ“„ create_tmp_table.h(2.74 KB)
ðŸ“„ cset_narrowing.h(3.88 KB)
ðŸ“„ custom_conf.h(1.06 KB)
ðŸ“„ datadict.h(1.66 KB)
ðŸ“„ ddl_log.h(12.39 KB)
ðŸ“„ debug.h(1.21 KB)
ðŸ“„ debug_sync.h(2 KB)
ðŸ“„ derived_handler.h(2.32 KB)
ðŸ“„ derror.h(980 B)
ðŸ“„ des_key_file.h(1.21 KB)
ðŸ“„ discover.h(1.53 KB)
ðŸ“„ dur_prop.h(1.06 KB)
ðŸ“„ embedded_priv.h(1.69 KB)
ðŸ“„ event_data_objects.h(4.09 KB)
ðŸ“„ event_db_repository.h(3.56 KB)
ðŸ“„ event_parse_data.h(2.83 KB)
ðŸ“„ event_queue.h(3.36 KB)
ðŸ“„ event_scheduler.h(3.21 KB)
ðŸ“„ events.h(4.59 KB)
ðŸ“„ field.h(215.25 KB)
ðŸ“„ field_comp.h(1.15 KB)
ðŸ“„ filesort.h(7.11 KB)
ðŸ“„ filesort_utils.h(8 KB)
ðŸ“„ ft_global.h(3.04 KB)
ðŸ“„ gcalc_slicescan.h(16.87 KB)
ðŸ“„ gcalc_tools.h(11.62 KB)
ðŸ“„ grant.h(2.69 KB)
ðŸ“„ group_by_handler.h(3.45 KB)
ðŸ“„ gstream.h(2.38 KB)
ðŸ“„ ha_handler_stats.h(2.28 KB)
ðŸ“„ ha_partition.h(62.9 KB)
ðŸ“„ ha_sequence.h(6.1 KB)
ðŸ“„ handle_connections_win.h(884 B)
ðŸ“„ handler.h(196.46 KB)
ðŸ“„ hash.h(4.34 KB)
ðŸ“„ hash_filo.h(5.55 KB)
ðŸ“„ heap.h(9.26 KB)
ðŸ“„ hostname.h(5.29 KB)
ðŸ“„ ilist.h(6.88 KB)
ðŸ“„ init.h(852 B)
ðŸ“„ innodb_priv.h(1.29 KB)
ðŸ“„ item.h(272.64 KB)
ðŸ“„ item_cmpfunc.h(131.86 KB)
ðŸ“„ item_create.h(11.23 KB)
ðŸ“„ item_func.h(133.45 KB)
ðŸ“„ item_geofunc.h(37.99 KB)
ðŸ“„ item_jsonfunc.h(21.99 KB)
ðŸ“„ item_row.h(5.1 KB)
ðŸ“„ item_strfunc.h(70.55 KB)
ðŸ“„ item_subselect.h(57.77 KB)
ðŸ“„ item_sum.h(70.59 KB)
ðŸ“„ item_timefunc.h(63.1 KB)
ðŸ“„ item_vers.h(4.23 KB)
ðŸ“„ item_windowfunc.h(33.51 KB)
ðŸ“„ item_xmlfunc.h(4.5 KB)
ðŸ“„ json_table.h(9.28 KB)
ðŸ“„ key.h(2.08 KB)
ðŸ“„ keycaches.h(1.95 KB)
ðŸ“„ lex.h(29.13 KB)
ðŸ“„ lex_string.h(3.97 KB)
ðŸ“„ lex_symbol.h(1.29 KB)
ðŸ“„ lf.h(6.31 KB)
ðŸ“„ lock.h(2.15 KB)
ðŸ“„ log.h(45 KB)
ðŸ“„ log_event.h(182.04 KB)
ðŸ“„ log_event_data_type.h(1.85 KB)
ðŸ“„ log_event_old.h(19.37 KB)
ðŸ“„ log_slow.h(2.38 KB)
ðŸ“„ maria.h(5.73 KB)
ðŸ“„ mariadb.h(1.25 KB)
ðŸ“„ mdl.h(37.57 KB)
ðŸ“„ mem_root_array.h(6.94 KB)
ðŸ“„ message.h(1.17 KB)
ðŸ“„ multi_range_read.h(22.64 KB)
ðŸ“„ my_alarm.h(2.37 KB)
ðŸ“„ my_apc.h(4.64 KB)
ðŸ“„ my_atomic.h(7.11 KB)
ðŸ“„ my_atomic_wrapper.h(2.98 KB)
ðŸ“„ my_base.h(26.57 KB)
ðŸ“„ my_bit.h(6.05 KB)
ðŸ“„ my_bitmap.h(5.74 KB)
ðŸ“„ my_check_opt.h(2.56 KB)
ðŸ“„ my_compare.h(10.93 KB)
ðŸ“„ my_counter.h(1.68 KB)
ðŸ“„ my_cpu.h(4.74 KB)
ðŸ“„ my_crypt.h(904 B)
ðŸ“„ my_decimal.h(14.15 KB)
ðŸ“„ my_default.h(1.84 KB)
ðŸ“„ my_handler_errors.h(4.77 KB)
ðŸ“„ my_json_writer.h(17.95 KB)
ðŸ“„ my_libwrap.h(1.16 KB)
ðŸ“„ my_md5.h(1.45 KB)
ðŸ“„ my_minidump.h(848 B)
ðŸ“„ my_nosys.h(1.4 KB)
ðŸ“„ my_rdtsc.h(8.23 KB)
ðŸ“„ my_rnd.h(1.04 KB)
ðŸ“„ my_service_manager.h(2 KB)
ðŸ“„ my_stack_alloc.h(6.34 KB)
ðŸ“„ my_stacktrace.h(3.14 KB)
ðŸ“„ my_time.h(10.22 KB)
ðŸ“„ my_tree.h(3.9 KB)
ðŸ“„ my_uctype.h(67.9 KB)
ðŸ“„ my_user.h(1.1 KB)
ðŸ“„ myisam.h(17.1 KB)
ðŸ“„ myisamchk.h(4.61 KB)
ðŸ“„ myisammrg.h(4.78 KB)
ðŸ“„ myisampack.h(14.58 KB)
ðŸ“„ mysqld.h(39.55 KB)
ðŸ“„ mysqld_default_groups.h(204 B)
ðŸ“„ mysqld_suffix.h(1.17 KB)
ðŸ“„ mysys_err.h(2.95 KB)
ðŸ“„ opt_range.h(58.19 KB)
ðŸ“„ opt_subselect.h(14.21 KB)
ðŸ“„ opt_trace.h(8.29 KB)
ðŸ“„ opt_trace_context.h(3.21 KB)
ðŸ“„ parse_file.h(4.28 KB)
ðŸ“„ partition_element.h(5.09 KB)
ðŸ“„ partition_info.h(18.85 KB)
ðŸ“„ password.h(1.14 KB)
ðŸ“„ pfs_file_provider.h(3.08 KB)
ðŸ“„ pfs_idle_provider.h(1.35 KB)
ðŸ“„ pfs_memory_provider.h(1.59 KB)
ðŸ“„ pfs_metadata_provider.h(1.85 KB)
ðŸ“„ pfs_socket_provider.h(2.21 KB)
ðŸ“„ pfs_stage_provider.h(1.52 KB)
ðŸ“„ pfs_statement_provider.h(4.25 KB)
ðŸ“„ pfs_table_provider.h(2.56 KB)
ðŸ“„ pfs_thread_provider.h(5.43 KB)
ðŸ“„ pfs_transaction_provider.h(2.78 KB)
ðŸ“„ privilege.h(27.97 KB)
ðŸ“„ probes_mysql.h(973 B)
ðŸ“„ probes_mysql_dtrace.h(32.23 KB)
ðŸ“„ probes_mysql_nodtrace.h(4.89 KB)
ðŸ“„ procedure.h(6.63 KB)
ðŸ“„ protocol.h(12.2 KB)
ðŸ“„ proxy_protocol.h(548 B)
ðŸ“„ queues.h(3.4 KB)
ðŸ“„ records.h(3.07 KB)
ðŸ“„ repl_failsafe.h(1.55 KB)
ðŸ“„ replication.h(15.73 KB)
ðŸ“„ rijndael.h(1.67 KB)
ðŸ“„ rowid_filter.h(15.11 KB)
ðŸ“„ rpl_constants.h(3.28 KB)
ðŸ“„ rpl_filter.h(4.43 KB)
ðŸ“„ rpl_gtid.h(13.36 KB)
ðŸ“„ rpl_injector.h(9.4 KB)
ðŸ“„ rpl_mi.h(14.64 KB)
ðŸ“„ rpl_parallel.h(17.05 KB)
ðŸ“„ rpl_record.h(1.55 KB)
ðŸ“„ rpl_record_old.h(1.37 KB)
ðŸ“„ rpl_reporting.h(3.63 KB)
ðŸ“„ rpl_rli.h(31.98 KB)
ðŸ“„ rpl_tblmap.h(3.1 KB)
ðŸ“„ rpl_utility.h(9.4 KB)
ðŸ“„ scheduler.h(3.12 KB)
ðŸ“„ scope.h(4.29 KB)
ðŸ“„ select_handler.h(2.18 KB)
ðŸ“„ semisync.h(2.23 KB)
ðŸ“„ semisync_master.h(24.96 KB)
ðŸ“„ semisync_master_ack_receiver.h(8.5 KB)
ðŸ“„ semisync_slave.h(3.65 KB)
ðŸ“„ service_versions.h(2 KB)
ðŸ“„ session_tracker.h(13.94 KB)
ðŸ“„ set_var.h(16.16 KB)
ðŸ“„ slave.h(11.99 KB)
ðŸ“„ socketpair.h(842 B)
ðŸ“„ source_revision.h(67 B)
ðŸ“„ sp.h(22.06 KB)
ðŸ“„ sp_cache.h(2 KB)
ðŸ“„ sp_head.h(63 KB)
ðŸ“„ sp_pcontext.h(24.31 KB)
ðŸ“„ sp_rcontext.h(14 KB)
ðŸ“„ span.h(3.84 KB)
ðŸ“„ spatial.h(21.78 KB)
ðŸ“„ sql_acl.h(13.8 KB)
ðŸ“„ sql_admin.h(2.85 KB)
ðŸ“„ sql_alloc.h(1.69 KB)
ðŸ“„ sql_alter.h(14.92 KB)
ðŸ“„ sql_analyse.h(10.86 KB)
ðŸ“„ sql_analyze_stmt.h(12.38 KB)
ðŸ“„ sql_array.h(6.71 KB)
ðŸ“„ sql_audit.h(13.62 KB)
ðŸ“„ sql_base.h(25.27 KB)
ðŸ“„ sql_basic_types.h(9.3 KB)
ðŸ“„ sql_binlog.h(895 B)
ðŸ“„ sql_bitmap.h(7.66 KB)
ðŸ“„ sql_bootstrap.h(1.77 KB)
ðŸ“„ sql_cache.h(21.17 KB)
ðŸ“„ sql_callback.h(1.51 KB)
ðŸ“„ sql_class.h(261.11 KB)
ðŸ“„ sql_cmd.h(9.2 KB)
ðŸ“„ sql_connect.h(3.99 KB)
ðŸ“„ sql_const.h(10.96 KB)
ðŸ“„ sql_crypt.h(1.4 KB)
ðŸ“„ sql_cte.h(16.15 KB)
ðŸ“„ sql_cursor.h(2.26 KB)
ðŸ“„ sql_db.h(2.38 KB)
ðŸ“„ sql_debug.h(5.51 KB)
ðŸ“„ sql_delete.h(1.31 KB)
ðŸ“„ sql_derived.h(1.26 KB)
ðŸ“„ sql_digest.h(3.73 KB)
ðŸ“„ sql_digest_stream.h(1.53 KB)
ðŸ“„ sql_do.h(954 B)
ðŸ“„ sql_error.h(38.66 KB)
ðŸ“„ sql_explain.h(28.34 KB)
ðŸ“„ sql_expression_cache.h(4.26 KB)
ðŸ“„ sql_get_diagnostics.h(7.68 KB)
ðŸ“„ sql_handler.h(2.84 KB)
ðŸ“„ sql_help.h(995 B)
ðŸ“„ sql_hset.h(3.32 KB)
ðŸ“„ sql_i_s.h(8.04 KB)
ðŸ“„ sql_insert.h(2.59 KB)
ðŸ“„ sql_join_cache.h(47.53 KB)
ðŸ“„ sql_lex.h(168.5 KB)
ðŸ“„ sql_lifo_buffer.h(9.45 KB)
ðŸ“„ sql_limit.h(3.11 KB)
ðŸ“„ sql_list.h(21.93 KB)
ðŸ“„ sql_load.h(1.25 KB)
ðŸ“„ sql_locale.h(2.64 KB)
ðŸ“„ sql_manager.h(960 B)
ðŸ“„ sql_mode.h(6.58 KB)
ðŸ“„ sql_parse.h(8.43 KB)
ðŸ“„ sql_partition.h(11.79 KB)
ðŸ“„ sql_partition_admin.h(5.8 KB)
ðŸ“„ sql_plist.h(7.55 KB)
ðŸ“„ sql_plugin.h(7.37 KB)
ðŸ“„ sql_plugin_compat.h(2.18 KB)
ðŸ“„ sql_prepare.h(11.14 KB)
ðŸ“„ sql_priv.h(18.16 KB)
ðŸ“„ sql_profile.h(7.63 KB)
ðŸ“„ sql_reload.h(1.01 KB)
ðŸ“„ sql_rename.h(982 B)
ðŸ“„ sql_repl.h(2.97 KB)
ðŸ“„ sql_schema.h(3.23 KB)
ðŸ“„ sql_select.h(86.81 KB)
ðŸ“„ sql_sequence.h(5.06 KB)
ðŸ“„ sql_servers.h(1.74 KB)
ðŸ“„ sql_show.h(9.39 KB)
ðŸ“„ sql_signal.h(3.28 KB)
ðŸ“„ sql_sort.h(21.45 KB)
ðŸ“„ sql_statistics.h(12.16 KB)
ðŸ“„ sql_string.h(38.84 KB)
ðŸ“„ sql_table.h(9.39 KB)
ðŸ“„ sql_tablespace.h(956 B)
ðŸ“„ sql_test.h(1.55 KB)
ðŸ“„ sql_time.h(8.18 KB)
ðŸ“„ sql_trigger.h(12.04 KB)
ðŸ“„ sql_truncate.h(2.03 KB)
ðŸ“„ sql_tvc.h(2.36 KB)
ðŸ“„ sql_type.h(288.51 KB)
ðŸ“„ sql_type_fixedbin.h(62.81 KB)
ðŸ“„ sql_type_fixedbin_storage.h(5.34 KB)
ðŸ“„ sql_type_geom.h(18.64 KB)
ðŸ“„ sql_type_int.h(9.77 KB)
ðŸ“„ sql_type_json.h(6.01 KB)
ðŸ“„ sql_type_real.h(1.23 KB)
ðŸ“„ sql_type_string.h(1.59 KB)
ðŸ“„ sql_udf.h(4.74 KB)
ðŸ“„ sql_union.h(1.04 KB)
ðŸ“„ sql_update.h(1.88 KB)
ðŸ“„ sql_view.h(2.41 KB)
ðŸ“„ sql_window.h(6.65 KB)
ðŸ“„ ssl_compat.h(3.07 KB)
ðŸ“„ strfunc.h(2.22 KB)
ðŸ“„ structs.h(25.76 KB)
ðŸ“„ sys_vars_shared.h(2.67 KB)
ðŸ“„ t_ctype.h(5.51 KB)
ðŸ“„ table.h(113.03 KB)
ðŸ“„ table_cache.h(4.13 KB)
ðŸ“„ thr_alarm.h(2.86 KB)
ðŸ“„ thr_lock.h(7.18 KB)
ðŸ“„ thr_malloc.h(1.17 KB)
ðŸ“„ thr_timer.h(1.53 KB)
ðŸ“„ thread_cache.h(5.77 KB)
ðŸ“„ threadpool.h(4.7 KB)
ðŸ“„ threadpool_generic.h(3.88 KB)
ðŸ“„ threadpool_winsockets.h(2.24 KB)
ðŸ“„ transaction.h(1.43 KB)
ðŸ“„ tzfile.h(4.9 KB)
ðŸ“„ tztime.h(3.32 KB)
ðŸ“„ uniques.h(4.12 KB)
ðŸ“„ unireg.h(7.54 KB)
ðŸ“„ vers_string.h(2.47 KB)
ðŸ“„ violite.h(9.85 KB)
ðŸ“„ waiting_threads.h(4.43 KB)
ðŸ“„ welcome_copyright_notice.h(1.19 KB)
ðŸ“„ win_tzname_data.h(6.35 KB)
ðŸ“„ winservice.h(1.17 KB)
ðŸ“„ wqueue.h(1.53 KB)
ðŸ“„ wsrep.h(3.23 KB)
ðŸ“„ wsrep_applier.h(2.64 KB)
ðŸ“„ wsrep_binlog.h(3.36 KB)
ðŸ“„ wsrep_client_service.h(2.5 KB)
ðŸ“„ wsrep_client_state.h(1.53 KB)
ðŸ“„ wsrep_condition_variable.h(1.45 KB)
ðŸ“„ wsrep_high_priority_service.h(4.8 KB)
ðŸ“„ wsrep_mutex.h(1.19 KB)
ðŸ“„ wsrep_mysqld.h(20.64 KB)
ðŸ“„ wsrep_mysqld_c.h(1.2 KB)
ðŸ“„ wsrep_on.h(1.68 KB)
ðŸ“„ wsrep_priv.h(1.6 KB)
ðŸ“„ wsrep_schema.h(4.83 KB)
ðŸ“„ wsrep_server_service.h(3.55 KB)
ðŸ“„ wsrep_server_state.h(2.23 KB)
ðŸ“„ wsrep_sst.h(3.86 KB)
ðŸ“„ wsrep_storage_service.h(1.77 KB)
ðŸ“„ wsrep_thd.h(10.9 KB)
ðŸ“„ wsrep_trans_observer.h(17.69 KB)
ðŸ“„ wsrep_types.h(997 B)
ðŸ“„ wsrep_utils.h(9.07 KB)
ðŸ“„ wsrep_var.h(4.5 KB)
ðŸ“„ wsrep_xid.h(1.51 KB)
ðŸ“„ xa.h(1.8 KB)

Editing: gcalc_tools.h

This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; version 2 of the License.

This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1335 USA */

#ifndef GCALC_TOOLS_INCLUDED
#define GCALC_TOOLS_INCLUDED

#include "gcalc_slicescan.h"
#include "sql_string.h"

/*
  The Gcalc_function class objects are used to check for a binary relation.
  The relation can be constructed with the prefix notation using predicates as
        op_not (as !A)
        op_union ( A || B || C... )
        op_intersection ( A && B && C ... )
        op_symdifference ( A+B+C+... == 1 )
        op_difference ( A && !(B||C||..))
  with the calls of the add_operation(operation, n_operands) method.
  The relation is calculated over a set of shapes, that in turn have
  to be added with the add_new_shape() method. All the 'shapes' can
  be set to 0 with clear_shapes() method and single value
  can be changed with the invert_state() method.
  Then the value of the relation can be calculated with the count() method.
  Frequently used method is find_function(Gcalc_scan_iterator it) that
  iterates through the 'it' until the relation becomes TRUE.
*/

class Gcalc_function
{
private:
  String shapes_buffer;
  String function_buffer;
  int *i_states;
  int *b_states;
  uint32 cur_object_id;
  uint n_shapes;
  int count_internal(const char *cur_func, uint set_type,
                     const char **end);
public:
  enum op_type
  {
    v_empty=          0x00000000,
    v_find_t=         0x01000000,
    v_find_f=         0x02000000,
    v_t_found=        0x03000000,
    v_f_found=        0x04000000,
    v_mask=           0x07000000,

op_not=           0x80000000,
    op_shape=         0x00000000,
    op_union=         0x10000000,
    op_intersection=  0x20000000,
    op_symdifference= 0x30000000,
    op_difference=    0x40000000,
    op_repeat=        0x50000000,
    op_border=        0x60000000,
    op_internals=     0x70000000,
    op_false=         0x08000000,
    op_any=           0x78000000 /* The mask to get any of the operations */
  };
  enum shape_type
  {
    shape_point= 0,
    shape_line= 1,
    shape_polygon= 2,
    shape_hole= 3
  };
  enum count_result
  {
    result_false= 0,
    result_true= 1,
    result_unknown= 2
  };
  Gcalc_function() : n_shapes(0) {}
  gcalc_shape_info add_new_shape(uint32 shape_id, shape_type shape_kind);
  /*
    Adds the leaf operation that returns the shape value.
    Also adds the shape to the list of operands.
  */
  int single_shape_op(shape_type shape_kind, gcalc_shape_info *si);
  void add_operation(uint operation, uint32 n_operands);
  void add_not_operation(op_type operation, uint32 n_operands);
  uint32 get_next_expression_pos() { return function_buffer.length(); }
  void add_operands_to_op(uint32 operation_pos, uint32 n_operands);
  int repeat_expression(uint32 exp_pos);
  void set_cur_obj(uint32 cur_obj) { cur_object_id= cur_obj; }
  int reserve_shape_buffer(uint n_shapes);
  int reserve_op_buffer(uint n_ops);
  uint get_nshapes() const { return n_shapes; }
  shape_type get_shape_kind(gcalc_shape_info si) const
  {
    return (shape_type) uint4korr(shapes_buffer.ptr() + (si*4));
  }

void set_states(int *shape_states) { i_states= shape_states; }
  int alloc_states();
  void invert_i_state(gcalc_shape_info shape) { i_states[shape]^= 1; }
  void set_i_state(gcalc_shape_info shape) { i_states[shape]= 1; }
  void clear_i_state(gcalc_shape_info shape) { i_states[shape]= 0; }
  void set_b_state(gcalc_shape_info shape) { b_states[shape]= 1; }
  void clear_b_state(gcalc_shape_info shape) { b_states[shape]= 0; }
  int get_state(gcalc_shape_info shape)
    { return i_states[shape] | b_states[shape]; }
  int get_i_state(gcalc_shape_info shape) { return i_states[shape]; }
  int get_b_state(gcalc_shape_info shape) { return b_states[shape]; }
  int count()
    { return count_internal(function_buffer.ptr(), 0, 0); }
  int count_last()
    { return count_internal(function_buffer.ptr(), 1, 0); }
  void clear_i_states();
  void clear_b_states();
  void reset();

int check_function(Gcalc_scan_iterator &scan_it);
};

/*
  Gcalc_operation_transporter class extends the Gcalc_shape_transporter.
  In addition to the parent's functionality, it fills the Gcalc_function
  object so it has the function that determines the proper shape.
  For example Multipolyline will be represented as an union of polylines.
*/

class Gcalc_operation_transporter : public Gcalc_shape_transporter
{
protected:
  Gcalc_function *m_fn;
  gcalc_shape_info m_si;
public:
  Gcalc_operation_transporter(Gcalc_function *fn, Gcalc_heap *heap) :
    Gcalc_shape_transporter(heap), m_fn(fn) {}

int single_point(double x, double y) override;
  int start_line() override;
  int complete_line() override;
  int start_poly() override;
  int complete_poly() override;
  int start_ring() override;
  int complete_ring() override;
  int add_point(double x, double y) override;
  int start_collection(int n_objects) override;
  int empty_shape() override;
};

/*
   When we calculate the result of an spatial operation like
   Union or Intersection, we receive vertexes of the result
   one-by-one, and probably need to treat them in variative ways.
   So, the Gcalc_result_receiver class designed to get these
   vertexes and construct shapes/objects out of them.
   and to store the result in an appropriate format
*/

class Gcalc_result_receiver
{
  String buffer;
  uint32 n_points;
  Gcalc_function::shape_type common_shapetype;
  bool collection_result;
  uint32 n_shapes;
  uint32 n_holes;

Gcalc_function::shape_type cur_shape;
  uint32 shape_pos;
  double first_x, first_y, prev_x, prev_y;
  double shape_area;
public:
Gcalc_result_receiver() :
    n_points(0),
    common_shapetype(Gcalc_function::shape_point),
    collection_result(FALSE), n_shapes(0), n_holes(0),
    cur_shape(Gcalc_function::shape_point), shape_pos(0)
    {}
  int start_shape(Gcalc_function::shape_type shape);
  int add_point(double x, double y);
  int complete_shape();
  int single_point(double x, double y);
  int done();
  void reset();

const char *result() { return buffer.ptr(); }
  uint length() { return buffer.length(); }
  int get_nshapes() { return n_shapes; }
  int get_nholes() { return n_holes; }
  int get_result_typeid();
  uint32 position() { return buffer.length(); }
  int move_hole(uint32 dest_position, uint32 source_position,
                uint32 *position_shift);
};

/*
  Gcalc_operation_reducer class incapsulates the spatial
  operation functionality. It analyses the slices generated by
  the slicescan and calculates the shape of the result defined
  by some Gcalc_function.
*/

class Gcalc_operation_reducer : public Gcalc_dyn_list
{
public:
  enum modes
  {
    /* Numeric values important here - careful with changing */
    default_mode= 0,
    prefer_big_with_holes= 1,
    polygon_selfintersections_allowed= 2,  /* allowed in the result */
    line_selfintersections_allowed= 4      /* allowed in the result */
  };

Gcalc_operation_reducer(size_t blk_size=8192);
  Gcalc_operation_reducer(const Gcalc_operation_reducer &gor);
  void init(Gcalc_function *fn, modes mode= default_mode);
  Gcalc_operation_reducer(Gcalc_function *fn, modes mode= default_mode,
		       size_t blk_size=8192);
  GCALC_DECL_TERMINATED_STATE(killed)
  int count_slice(Gcalc_scan_iterator *si);
  int count_all(Gcalc_heap *hp);
  int get_result(Gcalc_result_receiver *storage);
  void reset();

#ifndef GCALC_DBUG_OFF
  int n_res_points;
#endif /*GCALC_DBUG_OFF*/
  class res_point : public Gcalc_dyn_list::Item
  {
  public:
    int intersection_point;
    union
    {
      const Gcalc_heap::Info *pi;
      res_point *first_poly_node;
    };
    union
    {
      res_point *outer_poly;
      uint32 poly_position;
    };
    res_point *up;
    res_point *down;
    res_point *glue;
    Gcalc_function::shape_type type;
    Gcalc_dyn_list::Item **prev_hook;
#ifndef GCALC_DBUG_OFF
    int point_n;
#endif /*GCALC_DBUG_OFF*/
    void set(const Gcalc_scan_iterator *si);
    res_point *get_next() { return (res_point *)next; }
  };

class active_thread : public Gcalc_dyn_list::Item
  {
  public:
    res_point *rp;
    res_point *thread_start;

const Gcalc_heap::Info *p1, *p2;
    res_point *enabled() { return rp; }
    active_thread *get_next() { return (active_thread *)next; }
  };

class poly_instance : public Gcalc_dyn_list::Item
  {
  public:
    uint32 *after_poly_position;
    poly_instance *get_next() { return (poly_instance *)next; }
  };

class line : public Gcalc_dyn_list::Item
  {
  public:
    active_thread *t;
    int incoming;
    const Gcalc_scan_iterator::point *p;
    line *get_next() { return (line *)next; }
  };

class poly_border : public Gcalc_dyn_list::Item
  {
  public:
    active_thread *t;
    int incoming;
    int prev_state;
    const Gcalc_scan_iterator::point *p;
    poly_border *get_next() { return (poly_border *)next; }
  };

line *m_lines;
  Gcalc_dyn_list::Item **m_lines_hook;
  poly_border *m_poly_borders;
  Gcalc_dyn_list::Item **m_poly_borders_hook;
  line *new_line() { return (line *) new_item(); }
  poly_border *new_poly_border() { return (poly_border *) new_item(); }
  int add_line(int incoming, active_thread *t,
               const Gcalc_scan_iterator::point *p);
  int add_poly_border(int incoming, active_thread *t, int prev_state,
                      const Gcalc_scan_iterator::point *p);

protected:
  Gcalc_function *m_fn;
  Gcalc_dyn_list::Item **m_res_hook;
  res_point *m_result;
  int m_mode;

res_point *result_heap;
  active_thread *m_first_active_thread;

res_point *add_res_point(Gcalc_function::shape_type type);
  active_thread *new_active_thread() { return (active_thread *)new_item(); }

poly_instance *new_poly() { return (poly_instance *) new_item(); }

private:
  int start_line(active_thread *t, const Gcalc_scan_iterator::point *p,
                 const Gcalc_scan_iterator *si);
  int end_line(active_thread *t, const Gcalc_scan_iterator *si);
  int connect_threads(int incoming_a, int incoming_b,
                      active_thread *ta, active_thread *tb,
                      const Gcalc_scan_iterator::point *pa,
                      const Gcalc_scan_iterator::point *pb,
                      active_thread *prev_range,
                      const Gcalc_scan_iterator *si,
                      Gcalc_function::shape_type s_t);
  int add_single_point(const Gcalc_scan_iterator *si);
  poly_border *get_pair_border(poly_border *b1);
  int continue_range(active_thread *t, const Gcalc_heap::Info *p,
                     const Gcalc_heap::Info *p_next);
  int continue_i_range(active_thread *t,
                       const Gcalc_heap::Info *ii);
  int end_couple(active_thread *t0, active_thread *t1, const Gcalc_heap::Info *p);
  int get_single_result(res_point *res, Gcalc_result_receiver *storage);
  int get_result_thread(res_point *cur, Gcalc_result_receiver *storage,
			int move_upward, res_point *first_poly_node);
  int get_polygon_result(res_point *cur, Gcalc_result_receiver *storage,
                         res_point *first_poly_node);
  int get_line_result(res_point *cur, Gcalc_result_receiver *storage);

void free_result(res_point *res);
};

#endif /*GCALC_TOOLS_INCLUDED*/

X7ROOT File Manager

Editing: gcalc_tools.h

Upload File

Create Folder