2019-12-14 10:29:53 +00:00
// Hyperbolic Rogue -- Arbitrary Tilings
// Copyright (C) 2011-2019 Zeno Rogue, see 'hyper.cpp' for details
/** \file arbitrile.cpp
* \ brief Arbitrary tilings
*
* Arbitrary tilings , defined in . tes files .
*/
# include "hyper.h"
namespace hr {
EX namespace arb {
2020-05-15 21:46:30 +00:00
EX int affine_limit = 200 ;
2019-12-14 10:29:53 +00:00
# if HDR
2021-07-23 11:59:41 +00:00
/** a type used to specify the connections between shapes */
struct connection_t {
/** the index of the connected shape in the 'shapes' table */
int sid ;
/** the index of the edge in the 'shapes' table */
int eid ;
/** 1 if this connection mirrored, 0 otherwise. do_unmirror() removes all mirrors by doubling shapes */
int mirror ;
2022-03-27 07:02:28 +00:00
bool operator = = ( const arb : : connection_t & b ) const { return tie ( sid , eid , mirror ) = = tie ( b . sid , b . eid , b . mirror ) ; }
bool operator < ( const arb : : connection_t & b ) const { return tie ( sid , eid , mirror ) < tie ( b . sid , b . eid , b . mirror ) ; }
2021-07-23 11:59:41 +00:00
} ;
inline void print ( hstream & hs , const connection_t & conn ) { print ( hs , tie ( conn . sid , conn . eid , conn . mirror ) ) ; }
2021-07-23 12:18:39 +00:00
/** \brief each shape of the arb tessellation
* note : the usual HyperRogue convention is : vertex 0 , edge 0 , vertex 1 , edge 1 , . . .
* note : the tesfile convention is : edge 0 , vertex 0 , edge 1 , vertex 1 , . . .
*/
2022-04-10 11:15:05 +00:00
/** edge with infinite end on the left */
constexpr ld INFINITE_LEFT = - 1 ;
/** edge with infinite end on the right */
constexpr ld INFINITE_RIGHT = - 2 ;
/** edge with two infinite ends */
constexpr ld INFINITE_BOTH = - 3 ;
2019-12-14 10:29:53 +00:00
struct shape {
2021-07-23 12:18:39 +00:00
/** index in the arbi_tiling::shapes */
2019-12-14 10:29:53 +00:00
int id ;
2021-07-23 12:18:39 +00:00
/** flags such as sfLINE and sfPH */
2019-12-27 21:59:50 +00:00
int flags ;
2021-07-23 12:18:39 +00:00
/** list of vertices in the usual convention */
2019-12-14 10:29:53 +00:00
vector < hyperpoint > vertices ;
2022-04-27 21:56:48 +00:00
/** list of angles in the tesfile convention */
2019-12-14 10:29:53 +00:00
vector < ld > angles ;
2021-07-23 12:18:39 +00:00
/** list of edge lengths */
2019-12-14 10:29:53 +00:00
vector < ld > edges ;
2022-04-10 11:15:05 +00:00
/** list of input edges */
vector < ld > in_edges ;
/** list of input angles */
vector < ld > in_angles ;
/** (ultra)ideal markers */
vector < bool > ideal_markers ;
2021-07-23 12:18:39 +00:00
/** list of edge connections */
2021-07-23 11:59:41 +00:00
vector < connection_t > connections ;
2019-12-23 20:49:54 +00:00
int size ( ) const { return isize ( vertices ) ; }
2022-02-01 16:06:56 +00:00
void build_from_angles_edges ( bool is_comb ) ;
2019-12-27 22:34:41 +00:00
vector < pair < int , int > > sublines ;
2020-05-15 21:46:30 +00:00
vector < pair < ld , ld > > stretch_shear ;
2022-04-22 22:57:04 +00:00
/** '*inf' was applied to represent an apeirogon/pseudogon */
bool apeirogonal ;
/** connections repeat `repeat_value` times */
2020-05-31 01:24:41 +00:00
int repeat_value ;
2021-07-23 12:18:39 +00:00
/** if a tile/edge combination may be connected to edges j1 and j2 of this, j1-j2 must be divisible by cycle_length */
2021-07-23 12:08:43 +00:00
int cycle_length ;
2021-07-23 12:18:39 +00:00
/** list of valences of vertices in the tesfile convention */
2021-07-23 12:08:43 +00:00
vector < int > vertex_valence ;
2021-12-24 22:10:47 +00:00
/** list of periods of vertices in the tesfile convention */
vector < int > vertex_period ;
/** list of angles at vertices in the tesfile convention */
vector < vector < ld > > vertex_angles ;
2019-12-14 10:29:53 +00:00
} ;
2020-06-02 00:29:31 +00:00
struct slider {
string name ;
ld zero ;
ld current ;
ld min ;
ld max ;
} ;
2022-04-24 20:09:54 +00:00
struct intslider {
string name ;
int zero ;
int current ;
int min ;
int max ;
} ;
2019-12-14 10:29:53 +00:00
struct arbi_tiling {
2019-12-27 21:59:02 +00:00
int order ;
2022-02-01 16:06:56 +00:00
/* have_line and have_ph: line and ph flags have been marked for tiles */
bool have_line , have_ph ;
/* is the tree structure given in the tes file */
bool have_tree ;
/* use "star." if the tessellation includs star polygons */
bool is_star ;
/* use "combinatorial." for combinatorial tessellations; vertex valences computed based on their angles. Currently only rulegen works for combinatorial tessellations */
bool is_combinatorial ;
/* reserved for future flags */
bool res0 , res1 , res2 , res3 ;
2021-07-31 11:36:57 +00:00
int yendor_backsteps ;
2019-12-27 21:59:02 +00:00
2019-12-14 10:29:53 +00:00
vector < shape > shapes ;
2019-12-27 00:43:58 +00:00
string name ;
2019-12-27 01:07:44 +00:00
string comment ;
2020-05-30 18:00:09 +00:00
2020-06-02 00:29:31 +00:00
vector < slider > sliders ;
2022-04-24 20:09:54 +00:00
vector < intslider > intsliders ;
2020-06-02 00:29:31 +00:00
2020-05-30 18:00:09 +00:00
ld cscale ;
2021-07-30 09:49:13 +00:00
int range ;
2021-07-30 10:12:25 +00:00
ld floor_scale ;
ld boundary_ratio ;
2020-05-30 18:00:44 +00:00
string filename ;
2021-12-24 22:10:47 +00:00
int mirror_rules ;
2021-07-30 13:29:59 +00:00
2021-10-15 20:15:47 +00:00
vector < string > options ;
2021-07-30 13:29:59 +00:00
int min_valence , max_valence ;
2019-12-14 10:29:53 +00:00
geometryinfo1 & get_geometry ( ) ;
eGeometryClass get_class ( ) { return get_geometry ( ) . kind ; }
ld scale ( ) ;
} ;
# endif
2022-04-24 19:37:59 +00:00
/** currently loaded tiling */
2019-12-14 10:29:53 +00:00
EX arbi_tiling current ;
2022-04-24 19:37:59 +00:00
/** is the currently displayed map current or slided */
2020-06-02 00:29:31 +00:00
EX bool using_slided ;
2022-04-24 19:37:59 +00:00
/** for real-valued sliders, current is the tiling used by the map, while slided is the tiling used for the display */
2020-06-02 00:29:31 +00:00
EX arbi_tiling slided ;
2020-06-03 09:43:35 +00:00
EX bool in_slided ( ) { return in ( ) & & using_slided ; }
2020-06-02 00:29:31 +00:00
EX arbi_tiling & current_or_slided ( ) {
return using_slided ? slided : current ;
}
2019-12-14 10:29:53 +00:00
/** id of vertex in the arbitrary tiling */
EX short & id_of ( heptagon * h ) { return h - > zebraval ; }
2020-06-06 16:40:08 +00:00
# if HDR
2020-04-26 09:02:03 +00:00
struct hr_polygon_error : hr_exception {
vector < transmatrix > v ;
eGeometryClass c ;
int id ;
2020-05-30 18:06:28 +00:00
transmatrix end ;
2020-05-01 15:12:13 +00:00
map < string , cld > params ;
2020-05-30 18:06:28 +00:00
hr_polygon_error ( const vector < transmatrix > & _v , int _id , transmatrix _e ) : v ( _v ) , c ( cgclass ) , id ( _id ) , end ( _e ) { }
2020-04-26 09:02:03 +00:00
~ hr_polygon_error ( ) noexcept ( true ) { }
2020-06-06 16:40:08 +00:00
string generate_error ( ) ;
2020-04-26 09:02:03 +00:00
} ;
2020-06-06 16:40:08 +00:00
# endif
string hr_polygon_error : : generate_error ( ) {
cld dist = ( hdist0 ( tC0 ( end ) ) / params [ " distunit " ] ) ;
bool angle = abs ( dist ) < 1e-9 ;
if ( angle ) dist = ( atan2 ( end * xpush0 ( 1 ) ) / params [ " angleunit " ] ) ;
return
XLAT ( " Polygon number %1 did not close correctly (%2 %3). Here is the picture to help you understand the issue. \n \n " , its ( id ) ,
angle ? " angle " : " distance " ,
lalign ( 0 , dist )
) ;
}
2020-04-26 09:02:03 +00:00
2020-05-01 16:11:48 +00:00
struct connection_debug_request : hr_exception {
int id ;
eGeometryClass c ;
connection_debug_request ( int i ) : id ( i ) , c ( cgclass ) { }
} ;
void ensure_geometry ( eGeometryClass c ) {
2020-04-26 09:02:03 +00:00
stop_game ( ) ;
2020-05-01 16:11:48 +00:00
if ( c ! = cgclass ) {
if ( c = = gcEuclid ) set_geometry ( gEuclid ) ;
if ( c = = gcHyperbolic ) set_geometry ( gNormal ) ;
if ( c = = gcSphere ) set_geometry ( gSphere ) ;
2020-04-26 09:02:03 +00:00
}
if ( specialland ! = laCanvas ) {
canvas_default_wall = waInvisibleFloor ;
patterns : : whichCanvas = ' g ' ;
patterns : : canvasback = 0xFFFFFF ;
2021-04-23 18:09:23 +00:00
enable_canvas ( ) ;
2020-04-26 09:02:03 +00:00
}
start_game ( ) ;
2020-05-01 16:11:48 +00:00
}
void start_poly_debugger ( hr_polygon_error & err ) {
2020-05-22 14:52:02 +00:00
# if CAP_EDIT
2020-05-01 16:11:48 +00:00
ensure_geometry ( err . c ) ;
2020-04-26 09:02:03 +00:00
drawthemap ( ) ;
mapeditor : : drawing_tool = true ;
pushScreen ( mapeditor : : showDrawEditor ) ;
mapeditor : : initdraw ( cwt . at ) ;
int n = isize ( err . v ) ;
mapeditor : : dtcolor = 0xFF0000FF ;
mapeditor : : dtwidth = 0.02 ;
for ( int i = 0 ; i < n - 1 ; i + + )
2020-07-27 16:49:04 +00:00
mapeditor : : dt_add_line ( shiftless ( tC0 ( err . v [ i ] ) ) , shiftless ( tC0 ( err . v [ i + 1 ] ) ) , 0 ) ;
2020-04-26 09:02:03 +00:00
mapeditor : : dtcolor = 0xFFFFFFFF ;
for ( int i = 0 ; i < n ; i + + )
2020-07-27 16:49:04 +00:00
mapeditor : : dt_add_text ( shiftless ( tC0 ( err . v [ i ] ) ) , 0.5 , its ( i ) ) ;
2020-05-22 14:52:02 +00:00
# endif
2020-04-26 09:02:03 +00:00
}
2022-02-01 16:06:56 +00:00
void shape : : build_from_angles_edges ( bool is_comb ) {
2019-12-26 21:28:46 +00:00
transmatrix at = Id ;
2022-04-10 11:15:05 +00:00
int n = isize ( in_angles ) ;
2019-12-14 10:29:53 +00:00
hyperpoint ctr = Hypc ;
2020-04-26 09:02:03 +00:00
vector < transmatrix > matrices ;
2019-12-14 10:29:53 +00:00
for ( int i = 0 ; i < n ; i + + ) {
2020-04-26 09:02:03 +00:00
matrices . push_back ( at ) ;
2020-06-06 16:42:05 +00:00
if ( debugflags & DF_GEOM ) println ( hlog , " at = " , at ) ;
2019-12-26 21:28:46 +00:00
ctr + = tC0 ( at ) ;
2022-04-10 11:15:05 +00:00
at = at * xpush ( in_edges [ i ] ) * spin ( in_angles [ i ] + M_PI ) ;
2019-12-14 10:29:53 +00:00
}
2020-04-26 09:02:03 +00:00
matrices . push_back ( at ) ;
2022-02-01 16:06:56 +00:00
if ( is_comb ) return ;
2022-04-22 22:57:04 +00:00
if ( ! eqmatrix ( at , Id ) & & ! apeirogonal ) {
2020-05-30 18:06:28 +00:00
throw hr_polygon_error ( matrices , id , at ) ;
}
2020-03-22 09:15:03 +00:00
if ( sqhypot_d ( 3 , ctr ) < 1e-2 ) {
// this may happen for some spherical tilings
// try to move towards the center
2020-06-06 16:42:05 +00:00
if ( debugflags & DF_GEOM ) println ( hlog , " special case encountered " ) ;
2020-03-22 09:15:03 +00:00
for ( int i = 0 ; i < n ; i + + ) {
2022-04-10 11:15:05 +00:00
ctr + = at * xpush ( in_edges [ i ] ) * spin ( ( in_angles [ i ] + M_PI ) / 2 ) * xpush0 ( .01 ) ;
at = at * xpush ( in_edges [ i ] ) * spin ( in_angles [ i ] ) ;
2020-03-22 09:15:03 +00:00
}
2020-06-06 16:42:05 +00:00
if ( debugflags & DF_GEOM ) println ( hlog , " ctr = " , ctr ) ;
2020-03-22 09:15:03 +00:00
}
2022-04-22 22:57:04 +00:00
hyperpoint inf_point ;
if ( apeirogonal ) {
transmatrix U = at ;
for ( int i = 0 ; i < 3 ; i + + ) for ( int j = 0 ; j < 3 ; j + + ) U [ i ] [ j ] - = Id [ i ] [ j ] ;
hyperpoint v ;
ld det = U [ 0 ] [ 1 ] * U [ 1 ] [ 0 ] - U [ 1 ] [ 1 ] * U [ 0 ] [ 0 ] ;
v [ 1 ] = ( U [ 1 ] [ 2 ] * U [ 0 ] [ 0 ] - U [ 0 ] [ 2 ] * U [ 1 ] [ 0 ] ) / det ;
v [ 0 ] = ( U [ 0 ] [ 2 ] * U [ 1 ] [ 1 ] - U [ 1 ] [ 2 ] * U [ 0 ] [ 1 ] ) / det ;
v [ 2 ] = 1 ;
inf_point = v ;
ctr = mid ( C0 , tC0 ( at ) ) ;
ctr = towards_inf ( ctr , inf_point ) ;
}
2019-12-14 10:29:53 +00:00
ctr = normalize ( ctr ) ;
2022-04-10 11:15:05 +00:00
vertices . clear ( ) ;
angles . clear ( ) ;
for ( int i = 0 ; i < n ; i + + ) {
edges . push_back ( in_edges [ i ] ) ;
if ( ! ideal_markers [ i ] ) {
vertices . push_back ( tC0 ( gpushxto0 ( ctr ) * matrices [ i ] ) ) ;
angles . push_back ( in_angles [ i ] ) ;
}
else {
angles . push_back ( 0 ) ;
hyperpoint a1 = tC0 ( matrices [ i ] ) ;
hyperpoint t1 = get_column ( matrices [ i ] , 0 ) ;
hyperpoint a2 = tC0 ( matrices [ i + 2 ] ) ;
hyperpoint t2 = get_column ( matrices [ i + 2 ] , 0 ) ;
a1 / = a1 [ 2 ] ;
a2 / = a2 [ 2 ] ;
t1 - = a1 * t1 [ 2 ] ;
t2 - = a2 * t2 [ 2 ] ;
ld c1 = a2 [ 0 ] - a1 [ 0 ] , c2 = a2 [ 1 ] - a1 [ 1 ] ;
ld v1 = t1 [ 0 ] , v2 = t1 [ 1 ] ;
ld u1 = t2 [ 0 ] , u2 = t2 [ 1 ] ;
ld r = ( u2 * c1 - c2 * u1 ) / ( v1 * u2 - v2 * u1 ) ;
2022-04-10 12:14:12 +00:00
// ld s = (v2 * c1 - c2 * v1) / (v1 * u2 - v2 * u1);
2022-04-10 11:15:05 +00:00
hyperpoint v = a1 + r * t1 ;
2022-04-10 12:14:12 +00:00
// also v == a2 + s * t2;
2022-04-10 11:15:05 +00:00
v [ 2 ] = 1 ;
v = gpushxto0 ( ctr ) * v ;
v / = v [ 2 ] ;
vertices . push_back ( v ) ;
i + + ;
}
}
2022-04-22 22:57:04 +00:00
if ( apeirogonal ) {
vertices . push_back ( gpushxto0 ( ctr ) * tC0 ( at ) ) ;
hyperpoint v = gpushxto0 ( ctr ) * inf_point ;
v / = v [ 2 ] ;
vertices . push_back ( v ) ;
2022-04-28 06:39:47 +00:00
auto b = angles . back ( ) / 2 ;
angles . back ( ) = b ;
2022-04-27 21:56:48 +00:00
angles . push_back ( 0 ) ;
2022-04-28 06:39:47 +00:00
angles . push_back ( b ) ;
2022-04-22 22:57:04 +00:00
edges . push_back ( 0 ) ;
edges . push_back ( 0 ) ;
}
2022-04-10 12:14:12 +00:00
n = isize ( angles ) ;
2022-04-10 11:15:05 +00:00
for ( int i = 0 ; i < n ; i + + ) {
2022-04-27 21:56:48 +00:00
bool left = angles [ i ] = = 0 ;
bool right = angles [ gmod ( i - 1 , isize ( vertices ) ) ] = = 0 ;
2022-04-10 11:15:05 +00:00
if ( left & & right ) edges [ i ] = INFINITE_BOTH ;
else if ( left ) edges [ i ] = INFINITE_LEFT ;
else if ( right ) edges [ i ] = INFINITE_RIGHT ;
}
2019-12-14 10:29:53 +00:00
}
2021-07-30 21:50:30 +00:00
EX bool correct_index ( int index , int size ) { return index > = 0 & & index < size ; }
2019-12-23 20:49:54 +00:00
template < class T > bool correct_index ( int index , const T & v ) { return correct_index ( index , isize ( v ) ) ; }
2020-04-16 18:59:34 +00:00
template < class T > void verify_index ( int index , const T & v , exp_parser & ep ) { if ( ! correct_index ( index , v ) ) throw hr_parse_exception ( " bad index: " + its ( index ) + " at " + ep . where ( ) ) ; }
2019-12-23 20:49:54 +00:00
2019-12-27 00:43:58 +00:00
string unnamed = " unnamed " ;
2020-06-02 00:29:31 +00:00
EX void load_tile ( exp_parser & ep , arbi_tiling & c , bool unit ) {
c . shapes . emplace_back ( ) ;
auto & cc = c . shapes . back ( ) ;
cc . id = isize ( c . shapes ) - 1 ;
2020-05-01 15:10:53 +00:00
cc . flags = 0 ;
2020-05-31 01:24:41 +00:00
cc . repeat_value = 1 ;
2020-05-01 15:10:53 +00:00
while ( ep . next ( ) ! = ' ) ' ) {
2020-05-01 15:14:49 +00:00
cld dist = 1 ;
2022-04-10 12:14:39 +00:00
ep . skip_white ( ) ;
if ( ep . eat ( " * " ) ) {
2022-04-22 22:57:04 +00:00
ld frep = ep . rparse ( 0 ) ;
if ( isinf ( frep ) ) {
cc . apeirogonal = true ;
set_flag ( ginf [ gArbitrary ] . flags , qIDEAL , true ) ;
ep . force_eat ( " ) " ) ;
break ;
}
int rep = int ( frep + .5 ) ;
2022-04-10 12:14:39 +00:00
int repeat_from = 0 ;
int repeat_to = cc . in_edges . size ( ) ;
2022-04-22 22:57:04 +00:00
if ( rep = = 0 ) {
cc . in_edges . resize ( repeat_from ) ;
cc . in_angles . resize ( repeat_from ) ;
cc . ideal_markers . resize ( repeat_from ) ;
}
else if ( rep < 0 ) throw hr_parse_exception ( " don't know how to use a negative repeat in tile definition " ) ;
2022-04-10 12:14:39 +00:00
for ( int i = 1 ; i < rep ; i + + )
for ( int j = repeat_from ; j < repeat_to ; j + + ) {
cc . in_edges . push_back ( cc . in_edges [ j ] ) ;
cc . in_angles . push_back ( cc . in_angles [ j ] ) ;
cc . ideal_markers . push_back ( cc . ideal_markers [ j ] ) ;
}
ep . skip_white ( ) ;
if ( ep . eat ( " ) " ) ) {
if ( repeat_from = = 0 ) cc . repeat_value = rep ;
break ;
}
else throw hr_parse_exception ( " expecting ) after repeat " ) ;
}
2020-05-01 15:10:53 +00:00
if ( ! unit ) {
2020-05-01 15:14:49 +00:00
dist = ep . parse ( 0 ) ;
2020-05-01 15:10:53 +00:00
ep . force_eat ( " , " ) ;
}
2022-04-10 11:15:05 +00:00
cld angle ;
ep . skip_white ( ) ;
if ( ep . eat ( " [ " ) ) {
cc . in_edges . push_back ( ep . validate_real ( dist * ep . extra_params [ " distunit " ] ) ) ;
angle = ep . parse ( 0 ) ; ep . force_eat ( " , " ) ;
cc . in_angles . push_back ( ep . validate_real ( angle * ep . extra_params [ " angleunit " ] ) ) ;
cc . ideal_markers . push_back ( true ) ;
dist = ep . parse ( 0 ) ; ep . force_eat ( " , " ) ;
angle = ep . parse ( 0 ) ; ep . force_eat ( " ] " ) ;
set_flag ( ginf [ gArbitrary ] . flags , qIDEAL , true ) ;
}
else
angle = ep . parse ( 0 ) ;
cc . in_edges . push_back ( ep . validate_real ( dist * ep . extra_params [ " distunit " ] ) ) ;
cc . in_angles . push_back ( ep . validate_real ( angle * ep . extra_params [ " angleunit " ] ) ) ;
cc . ideal_markers . push_back ( false ) ;
2020-05-01 15:10:53 +00:00
if ( ep . eat ( " , " ) ) continue ;
else if ( ep . eat ( " ) " )) break ;
else throw hr_parse_exception ( " expecting , or ) " ) ;
}
try {
2022-02-01 16:06:56 +00:00
cc . build_from_angles_edges ( c . is_combinatorial ) ;
2020-05-01 15:10:53 +00:00
}
catch ( hr_parse_exception & ex ) {
throw hr_parse_exception ( ex . s + ep . where ( ) ) ;
}
2020-05-01 15:12:13 +00:00
catch ( hr_polygon_error & poly ) {
poly . params = ep . extra_params ;
throw ;
}
2022-04-22 22:57:04 +00:00
int n = cc . size ( ) ;
cc . connections . resize ( n ) ;
2020-05-01 15:10:53 +00:00
for ( int i = 0 ; i < isize ( cc . connections ) ; i + + )
2021-07-23 11:59:41 +00:00
cc . connections [ i ] = connection_t { cc . id , i , false } ;
2022-04-22 22:57:04 +00:00
if ( cc . apeirogonal ) {
cc . connections [ n - 2 ] . eid = n - 1 ;
cc . connections [ n - 1 ] . eid = n - 2 ;
}
cc . stretch_shear . resize ( n , make_pair ( 1 , 0 ) ) ;
2020-05-01 15:10:53 +00:00
}
2021-07-04 07:32:04 +00:00
EX bool do_unmirror = true ;
2022-04-27 21:56:48 +00:00
template < class T > void cycle ( vector < T > & t ) {
std : : rotate ( t . begin ( ) , t . begin ( ) + 2 , t . end ( ) ) ;
}
2021-07-04 07:32:04 +00:00
/** \brief for tessellations which contain mirror rules, remove them by taking the orientable double cover */
2022-04-24 19:40:29 +00:00
EX void unmirror ( arbi_tiling & c ) {
auto & mirror_rules = c . mirror_rules ;
2021-12-24 22:10:47 +00:00
mirror_rules = 0 ;
2022-04-24 19:40:29 +00:00
for ( auto & s : c . shapes )
2021-07-23 11:59:41 +00:00
for ( auto & t : s . connections )
if ( t . mirror )
2021-07-04 07:32:04 +00:00
mirror_rules + + ;
if ( ! mirror_rules ) return ;
2022-04-24 19:40:29 +00:00
auto & sh = c . shapes ;
2021-07-04 07:32:04 +00:00
int s = isize ( sh ) ;
for ( int i = 0 ; i < s ; i + + )
sh . push_back ( sh [ i ] ) ;
2021-07-30 13:28:53 +00:00
for ( int i = 0 ; i < 2 * s ; i + + )
sh [ i ] . id = i ;
2021-07-04 07:32:04 +00:00
for ( int i = s ; i < s + s ; i + + ) {
for ( auto & v : sh [ i ] . vertices )
v [ 1 ] = - v [ 1 ] ;
reverse ( sh [ i ] . edges . begin ( ) , sh [ i ] . edges . end ( ) ) ;
2022-04-27 21:56:48 +00:00
for ( auto & e : sh [ i ] . edges ) {
if ( e = = INFINITE_LEFT ) e = INFINITE_RIGHT ;
else if ( e = = INFINITE_RIGHT ) e = INFINITE_LEFT ;
}
2021-07-04 07:32:04 +00:00
reverse ( sh [ i ] . vertices . begin ( ) + 1 , sh [ i ] . vertices . end ( ) ) ;
reverse ( sh [ i ] . angles . begin ( ) , sh [ i ] . angles . end ( ) - 1 ) ;
reverse ( sh [ i ] . connections . begin ( ) , sh [ i ] . connections . end ( ) ) ;
2022-04-27 21:56:48 +00:00
if ( sh [ i ] . apeirogonal ) {
cycle ( sh [ i ] . edges ) ;
cycle ( sh [ i ] . vertices ) ;
println ( hlog , " angles before = " , sh [ i ] . angles ) ;
cycle ( sh [ i ] . angles ) ;
println ( hlog , " angles now = " , sh [ i ] . angles ) ;
cycle ( sh [ i ] . connections ) ;
}
2021-07-04 07:32:04 +00:00
}
if ( true ) for ( int i = 0 ; i < s + s ; i + + ) {
for ( auto & co : sh [ i ] . connections ) {
2021-07-23 11:59:41 +00:00
bool mirr = co . mirror ^ ( i > = s ) ;
co . mirror = false ;
2021-07-04 07:32:04 +00:00
if ( mirr ) {
2021-07-23 11:59:41 +00:00
co . sid + = s ;
co . eid = isize ( sh [ co . sid ] . angles ) - 1 - co . eid ;
2022-04-27 21:56:48 +00:00
if ( sh [ co . sid ] . apeirogonal )
co . eid = gmod ( co . eid - 2 , isize ( sh [ co . sid ] . angles ) ) ;
2021-07-04 07:32:04 +00:00
}
}
}
}
2022-04-28 06:39:47 +00:00
static void reduce_gcd ( int & a , int b ) {
int nv = abs ( gcd ( a , b ) ) ;
a = abs ( gcd ( a , b ) ) ;
}
2022-04-24 19:40:29 +00:00
EX void compute_vertex_valence ( arb : : arbi_tiling & ac ) {
2021-07-29 10:02:44 +00:00
int tcl = - 1 ;
2021-07-30 13:29:19 +00:00
for ( auto & sh : ac . shapes )
2022-04-27 21:56:48 +00:00
sh . cycle_length = isize ( sh . vertices ) / sh . repeat_value ;
2021-08-04 16:00:34 +00:00
recompute :
2021-07-29 10:02:44 +00:00
while ( true ) {
2021-07-30 13:29:19 +00:00
for ( auto & sh : ac . shapes ) {
int i = sh . id ;
2021-07-29 10:02:44 +00:00
int n = isize ( sh . vertices ) ;
for ( int k = sh . cycle_length ; k < n ; k + + ) {
auto co = sh . connections [ k ] ;
auto co1 = sh . connections [ k - sh . cycle_length ] ;
if ( co . sid ! = co1 . sid ) {
println ( hlog , " ik = " , tie ( i , k ) , " co= " , co , " co1= " , co1 , " cl= " , sh . cycle_length ) ;
throw hr_parse_exception ( " connection error #2 in compute_vertex_valence " ) ;
}
2022-04-28 06:39:47 +00:00
reduce_gcd ( ac . shapes [ co . sid ] . cycle_length , co . eid - co1 . eid ) ;
2021-07-29 10:02:44 +00:00
}
for ( int k = 0 ; k < n ; k + + ) {
auto co = sh . connections [ k ] ;
2021-07-30 13:29:19 +00:00
co = ac . shapes [ co . sid ] . connections [ co . eid ] ;
2021-07-29 10:02:44 +00:00
if ( co . sid ! = i ) throw hr_parse_exception ( " connection error in compute_vertex_valence " ) ;
2022-04-28 06:39:47 +00:00
reduce_gcd ( sh . cycle_length , k - co . eid ) ;
2021-07-29 10:02:44 +00:00
}
if ( debugflags & DF_GEOM )
println ( hlog , " tile " , i , " cycle_length = " , sh . cycle_length , " / " , n ) ;
2021-07-23 12:08:43 +00:00
}
2021-07-29 10:02:44 +00:00
int new_tcl = 0 ;
2021-07-30 13:29:19 +00:00
for ( auto & sh : ac . shapes ) {
auto & len = sh . cycle_length ;
2021-07-29 10:02:44 +00:00
if ( len < 0 ) len = - len ;
new_tcl + = len ;
}
if ( new_tcl = = tcl ) break ;
tcl = new_tcl ;
2021-07-23 12:08:43 +00:00
}
if ( cgflags & qAFFINE ) return ;
2021-10-15 20:15:15 +00:00
if ( ac . is_star ) return ;
2021-07-30 13:29:19 +00:00
for ( auto & sh : ac . shapes ) {
int n = sh . size ( ) ;
int i = sh . id ;
sh . vertex_valence . resize ( n ) ;
2021-12-24 22:10:47 +00:00
sh . vertex_period . resize ( n ) ;
sh . vertex_angles . resize ( n ) ;
2021-07-23 12:08:43 +00:00
for ( int k = 0 ; k < n ; k + + ) {
ld total = 0 ;
2021-12-24 22:10:47 +00:00
int qty = 0 , pqty = 0 ;
2021-07-23 12:08:43 +00:00
connection_t at = { i , k , false } ;
2021-12-24 22:10:47 +00:00
connection_t at1 = at ;
vector < ld > anglelist ;
2021-07-23 12:08:43 +00:00
do {
2021-12-24 22:10:47 +00:00
if ( at . sid = = at1 . sid & & ( at . eid - at1 . eid ) % ac . shapes [ at . sid ] . cycle_length = = 0 ) pqty = 0 ;
2022-04-10 11:15:05 +00:00
if ( qty & & pqty = = 0 & & ! total ) break ;
2021-07-30 13:29:19 +00:00
ld a = ac . shapes [ at . sid ] . angles [ at . eid ] ;
2021-07-29 10:03:20 +00:00
while ( a < 0 ) a + = 360 * degree ;
while ( a > 360 * degree ) a - = 360 * degree ;
total + = a ;
2021-12-24 22:10:47 +00:00
anglelist . push_back ( a ) ;
2021-07-23 12:08:43 +00:00
qty + + ;
2021-12-24 22:10:47 +00:00
pqty + + ;
2021-07-23 12:08:43 +00:00
at . eid + + ;
2021-07-30 13:29:19 +00:00
if ( at . eid = = isize ( ac . shapes [ at . sid ] . angles ) ) at . eid = 0 ;
2021-07-23 12:08:43 +00:00
2021-07-30 13:29:19 +00:00
at = ac . shapes [ at . sid ] . connections [ at . eid ] ;
2021-07-23 12:08:43 +00:00
}
while ( total < 360 * degree - 1e-6 ) ;
2022-04-10 11:15:05 +00:00
if ( total = = 0 ) qty = OINF ;
2021-07-23 12:08:43 +00:00
if ( total > 360 * degree + 1e-6 ) throw hr_parse_exception ( " improper total in compute_stats " ) ;
if ( at . sid ! = i ) throw hr_parse_exception ( " ended at wrong type determining vertex_valence " ) ;
2021-08-04 16:00:34 +00:00
if ( ( at . eid - k ) % ac . shapes [ i ] . cycle_length ) {
2022-04-28 06:39:47 +00:00
reduce_gcd ( ac . shapes [ i ] . cycle_length , at . eid - k ) ;
2021-08-04 16:00:34 +00:00
goto recompute ;
}
2021-07-30 13:29:19 +00:00
sh . vertex_valence [ k ] = qty ;
2021-12-24 22:10:47 +00:00
sh . vertex_period [ k ] = pqty ;
sh . vertex_angles [ k ] = std : : move ( anglelist ) ;
2021-07-23 12:08:43 +00:00
}
if ( debugflags & DF_GEOM )
2021-07-30 13:29:19 +00:00
println ( hlog , " computed vertex_valence of " , i , " as " , ac . shapes [ i ] . vertex_valence ) ;
2021-07-23 12:08:43 +00:00
}
2021-07-30 13:29:59 +00:00
ac . min_valence = UNKNOWN ; ac . max_valence = 0 ;
for ( auto & sh : ac . shapes )
for ( auto & val : sh . vertex_valence ) {
if ( val < ac . min_valence ) ac . min_valence = val ;
if ( val > ac . max_valence ) ac . max_valence = val ;
}
2021-07-23 12:08:43 +00:00
}
2022-04-10 11:12:02 +00:00
EX void add_connection ( arbi_tiling & c , int ai , int as , int bi , int bs , int m ) {
int as0 = as , bs0 = bs ;
auto & ash = c . shapes [ ai ] ;
auto & bsh = c . shapes [ bi ] ;
do {
ash . connections [ as ] = connection_t { bi , bs , m } ;
as = gmod ( as + ash . size ( ) / ash . repeat_value , ash . size ( ) ) ;
}
while ( as ! = as0 ) ;
do {
c . shapes [ bi ] . connections [ bs ] = connection_t { ai , as , m } ;
bs = gmod ( bs + bsh . size ( ) / bsh . repeat_value , bsh . size ( ) ) ;
}
while ( bs ! = bs0 ) ;
}
2022-04-24 20:09:54 +00:00
EX void load ( const string & fname , bool load_as_slided IS ( false ) , bool keep_sliders IS ( false ) ) {
2019-12-14 10:29:53 +00:00
fhstream f ( fname , " rt " ) ;
2020-06-03 09:43:48 +00:00
if ( ! f . f ) throw hr_parse_exception ( " file " + fname + " does not exist " ) ;
2019-12-23 20:49:54 +00:00
string s ;
while ( true ) {
int c = fgetc ( f . f ) ;
if ( c < 0 ) break ;
s + = c ;
}
2022-04-24 20:09:54 +00:00
auto & c = load_as_slided ? slided : current ;
2019-12-27 21:59:02 +00:00
c . order + + ;
2019-12-14 10:29:53 +00:00
c . shapes . clear ( ) ;
2022-04-24 20:09:54 +00:00
if ( ! keep_sliders ) {
c . sliders . clear ( ) ;
c . intsliders . clear ( ) ;
}
int qsliders = 0 , qintsliders = 0 ;
2019-12-27 00:43:58 +00:00
c . name = unnamed ;
2019-12-27 01:07:44 +00:00
c . comment = " " ;
2020-05-30 18:00:44 +00:00
c . filename = fname ;
2020-05-30 18:00:09 +00:00
c . cscale = 1 ;
2021-07-30 09:49:13 +00:00
c . range = 0 ;
2021-07-30 10:12:25 +00:00
c . boundary_ratio = 1 ;
c . floor_scale = .5 ;
2021-07-30 21:50:30 +00:00
c . have_ph = c . have_line = false ;
c . have_tree = false ;
2021-07-31 11:36:57 +00:00
c . yendor_backsteps = 0 ;
2021-10-15 20:15:15 +00:00
c . is_star = false ;
2022-02-01 16:06:56 +00:00
c . is_combinatorial = false ;
2019-12-23 20:49:54 +00:00
exp_parser ep ;
ep . s = s ;
2022-04-09 10:25:02 +00:00
ld angleunit = 1 , distunit = 1 ;
2019-12-27 21:59:50 +00:00
auto addflag = [ & ] ( int f ) {
int ai ;
if ( ep . next ( ) = = ' ) ' ) ai = isize ( c . shapes ) - 1 ;
else ai = ep . iparse ( ) ;
2020-04-16 18:59:34 +00:00
verify_index ( ai , c . shapes , ep ) ;
2019-12-27 21:59:50 +00:00
c . shapes [ ai ] . flags | = f ;
ep . force_eat ( " ) " ) ;
} ;
2019-12-14 10:29:53 +00:00
while ( true ) {
2020-03-22 10:27:06 +00:00
ep . extra_params [ " distunit " ] = distunit ;
ep . extra_params [ " angleunit " ] = angleunit ;
2019-12-23 20:49:54 +00:00
ep . skip_white ( ) ;
if ( ep . next ( ) = = 0 ) break ;
2019-12-27 00:43:58 +00:00
if ( ep . eat ( " # " ) ) {
2019-12-27 01:07:44 +00:00
bool doubled = ep . eat ( " # " ) ;
2019-12-27 00:43:58 +00:00
while ( ep . eat ( " " ) ) ;
string s = " " ;
while ( ep . next ( ) > = 32 ) s + = ep . next ( ) , ep . at + + ;
2019-12-27 01:07:44 +00:00
if ( doubled ) {
if ( c . name = = unnamed ) c . name = s ;
else {
c . comment + = s ;
c . comment + = " \n " ;
}
}
2019-12-27 00:43:58 +00:00
}
2022-04-24 19:37:34 +00:00
else if ( ep . eat ( " c2( " ) ) {
ld curv = ep . rparse ( 0 ) ;
ep . force_eat ( " ) " ) ;
ginf [ gArbitrary ] . g = curv > 0 ? giSphere2 : curv < 0 ? giHyperb2 : giEuclid2 ;
ginf [ gArbitrary ] . sides = 7 ;
set_flag ( ginf [ gArbitrary ] . flags , qBOUNDED , curv > 0 ) ;
set_flag ( ginf [ gArbitrary ] . flags , qAFFINE , false ) ;
geom3 : : apply_always3 ( ) ;
}
2019-12-27 00:43:58 +00:00
else if ( ep . eat ( " e2. " ) ) {
2020-05-15 21:46:30 +00:00
ginf [ gArbitrary ] . g = giEuclid2 ;
ginf [ gArbitrary ] . sides = 7 ;
set_flag ( ginf [ gArbitrary ] . flags , qBOUNDED , false ) ;
set_flag ( ginf [ gArbitrary ] . flags , qAFFINE , false ) ;
2020-06-03 14:42:13 +00:00
geom3 : : apply_always3 ( ) ;
2020-05-15 21:46:30 +00:00
}
else if ( ep . eat ( " a2. " ) ) {
2019-12-26 21:28:46 +00:00
ginf [ gArbitrary ] . g = giEuclid2 ;
2020-01-06 23:03:57 +00:00
ginf [ gArbitrary ] . sides = 7 ;
2019-12-26 21:28:46 +00:00
set_flag ( ginf [ gArbitrary ] . flags , qBOUNDED , false ) ;
2020-05-15 09:38:20 +00:00
set_flag ( ginf [ gArbitrary ] . flags , qAFFINE , true ) ;
2020-05-15 21:46:30 +00:00
affine_limit = 200 ;
2020-06-03 14:42:13 +00:00
geom3 : : apply_always3 ( ) ;
2019-12-26 21:28:46 +00:00
}
else if ( ep . eat ( " h2. " ) ) {
ginf [ gArbitrary ] . g = giHyperb2 ;
2020-01-06 23:03:57 +00:00
ginf [ gArbitrary ] . sides = 7 ;
2019-12-26 21:28:46 +00:00
set_flag ( ginf [ gArbitrary ] . flags , qBOUNDED , false ) ;
2020-05-15 09:38:20 +00:00
set_flag ( ginf [ gArbitrary ] . flags , qAFFINE , false ) ;
2020-06-03 14:42:13 +00:00
geom3 : : apply_always3 ( ) ;
2019-12-26 21:28:46 +00:00
}
else if ( ep . eat ( " s2. " ) ) {
ginf [ gArbitrary ] . g = giSphere2 ;
2020-01-06 23:03:57 +00:00
ginf [ gArbitrary ] . sides = 5 ;
2020-05-15 21:46:44 +00:00
set_flag ( ginf [ gArbitrary ] . flags , qBOUNDED , true ) ;
2020-05-15 09:38:20 +00:00
set_flag ( ginf [ gArbitrary ] . flags , qAFFINE , false ) ;
2020-06-03 14:42:13 +00:00
geom3 : : apply_always3 ( ) ;
2019-12-26 21:28:46 +00:00
}
2021-10-15 20:15:15 +00:00
else if ( ep . eat ( " star. " ) ) {
c . is_star = true ;
}
2022-02-01 16:06:56 +00:00
else if ( ep . eat ( " combinatorial. " ) ) {
c . is_combinatorial = true ;
}
2021-10-15 20:15:47 +00:00
else if ( ep . eat ( " option( \" " ) ) {
next :
string s = " " ;
while ( ep . next ( ) ! = ' " ' ) s + = ep . eatchar ( ) ;
ep . force_eat ( " \" " ) ;
c . options . push_back ( s ) ;
ep . skip_white ( ) ;
if ( ep . eat ( " , " ) ) { ep . skip_white ( ) ; ep . force_eat ( " \" " ) ; goto next ; }
ep . force_eat ( " ) " ) ;
}
2019-12-26 21:28:46 +00:00
else if ( ep . eat ( " angleunit( " ) ) angleunit = real ( ep . parsepar ( ) ) ;
else if ( ep . eat ( " distunit( " ) ) distunit = real ( ep . parsepar ( ) ) ;
2019-12-27 21:59:50 +00:00
else if ( ep . eat ( " line( " ) ) {
addflag ( arcm : : sfLINE ) ;
c . have_line = true ;
}
else if ( ep . eat ( " grave( " ) ) {
addflag ( arcm : : sfPH ) ;
c . have_ph = true ;
}
2020-06-02 00:29:31 +00:00
else if ( ep . eat ( " slider( " ) ) {
slider sl ;
sl . name = ep . next_token ( ) ;
ep . force_eat ( " , " ) ;
sl . current = sl . zero = ep . rparse ( ) ;
ep . force_eat ( " , " ) ;
sl . min = ep . rparse ( ) ;
ep . force_eat ( " , " ) ;
sl . max = ep . rparse ( ) ;
ep . force_eat ( " ) " ) ;
2022-04-24 20:09:54 +00:00
if ( load_as_slided | | ! keep_sliders )
c . sliders . push_back ( sl ) ;
if ( load_as_slided | | keep_sliders )
ep . extra_params [ sl . name ] = current . sliders [ qsliders + + ] . current ;
else
ep . extra_params [ sl . name ] = sl . zero ;
}
else if ( ep . eat ( " intslider( " ) ) {
intslider sl ;
sl . name = ep . next_token ( ) ;
ep . force_eat ( " , " ) ;
sl . current = sl . zero = ep . iparse ( ) ;
ep . force_eat ( " , " ) ;
sl . min = ep . iparse ( ) ;
ep . force_eat ( " , " ) ;
sl . max = ep . iparse ( ) ;
ep . force_eat ( " ) " ) ;
if ( load_as_slided | | ! keep_sliders )
c . intsliders . push_back ( sl ) ;
if ( load_as_slided | | keep_sliders )
ep . extra_params [ sl . name ] = current . intsliders [ qintsliders + + ] . current ;
2020-06-02 00:29:31 +00:00
else
ep . extra_params [ sl . name ] = sl . zero ;
}
2019-12-26 21:28:46 +00:00
else if ( ep . eat ( " let( " ) ) {
2019-12-23 20:49:54 +00:00
string tok = ep . next_token ( ) ;
ep . force_eat ( " = " ) ;
ep . extra_params [ tok ] = ep . parsepar ( ) ;
2020-04-29 13:10:07 +00:00
if ( debugflags & DF_GEOM )
2020-06-02 00:29:31 +00:00
println ( hlog , " let " , tok , " = " , ep . extra_params [ tok ] ) ;
2019-12-23 20:49:54 +00:00
}
2020-06-02 00:29:31 +00:00
else if ( ep . eat ( " unittile( " ) ) load_tile ( ep , c , true ) ;
else if ( ep . eat ( " tile( " ) ) load_tile ( ep , c , false ) ;
2020-05-15 21:46:30 +00:00
else if ( ep . eat ( " affine_limit( " ) ) {
affine_limit = ep . iparse ( ) ;
ep . force_eat ( " ) " ) ;
}
2020-05-30 18:00:09 +00:00
else if ( ep . eat ( " cscale( " ) ) {
c . cscale = ep . rparse ( ) ;
ep . force_eat ( " ) " ) ;
}
2021-07-30 21:50:30 +00:00
else if ( ep . eat ( " treestate( " ) ) {
rulegen : : parse_treestate ( c , ep ) ;
}
2021-07-31 14:09:46 +00:00
else if ( ep . eat ( " first_treestate( " ) ) {
rulegen : : rule_root = ep . iparse ( ) ;
ep . force_eat ( " ) " ) ;
}
2021-07-31 11:36:57 +00:00
else if ( ep . eat ( " yendor_backsteps( " ) ) {
c . yendor_backsteps = ep . iparse ( ) ;
ep . force_eat ( " ) " ) ;
}
2021-07-30 09:49:13 +00:00
else if ( ep . eat ( " range( " ) ) {
c . range = ep . iparse ( ) ;
ep . force_eat ( " ) " ) ;
}
2021-07-30 10:12:25 +00:00
else if ( ep . eat ( " floor_scale( " ) ) {
c . floor_scale = ep . rparse ( ) ;
ep . force_eat ( " ) " ) ;
}
else if ( ep . eat ( " boundary_ratio( " ) ) {
c . boundary_ratio = ep . rparse ( ) ;
ep . force_eat ( " ) " ) ;
}
2019-12-27 22:00:07 +00:00
else if ( ep . eat ( " conway( \" " ) ) {
string s = " " ;
while ( true ) {
int m = 0 ;
if ( ep . eat ( " ( " ) ) m = 0 ;
else if ( ep . eat ( " [ " ) ) m = 1 ;
else if ( ep . eat ( " \" " ) ) break ;
2020-04-16 18:59:34 +00:00
else throw hr_parse_exception ( " cannot parse Conway notation, " + ep . where ( ) ) ;
2019-12-27 22:00:07 +00:00
int ai = 0 ;
int as = ep . iparse ( ) ;
while ( ep . eat ( " ' " ) ) ai + + ;
if ( ep . eat ( " @ " ) ) ai = ep . iparse ( ) ;
int bi = 0 , bs = 0 ;
if ( ep . eat ( " ) " ) | | ep . eat ( " ] " ) ) bs = as , bi = ai ;
else {
bs = ep . iparse ( ) ;
while ( ep . eat ( " ' " ) ) bi + + ;
if ( ep . eat ( " @ " ) ) bi = ep . iparse ( ) ;
}
if ( ep . eat ( " ) " ) | | ep . eat ( " ] " ) ) { }
2020-06-06 16:42:34 +00:00
verify_index ( ai , c . shapes , ep ) ;
verify_index ( as , c . shapes [ ai ] , ep ) ;
verify_index ( bi , c . shapes , ep ) ;
verify_index ( bs , c . shapes [ bi ] , ep ) ;
2022-04-10 11:12:02 +00:00
add_connection ( c , ai , as , bi , bs , m ) ;
2019-12-27 22:00:07 +00:00
}
ep . force_eat ( " ) " ) ;
}
2019-12-26 21:28:46 +00:00
else if ( ep . eat ( " c( " ) ) {
2020-04-16 18:59:34 +00:00
int ai = ep . iparse ( ) ; verify_index ( ai , c . shapes , ep ) ; ep . force_eat ( " , " ) ;
int as = ep . iparse ( ) ; verify_index ( as , c . shapes [ ai ] , ep ) ; ep . force_eat ( " , " ) ;
int bi = ep . iparse ( ) ; verify_index ( bi , c . shapes , ep ) ; ep . force_eat ( " , " ) ;
int bs = ep . iparse ( ) ; verify_index ( bs , c . shapes [ bi ] , ep ) ; ep . force_eat ( " , " ) ;
2019-12-23 20:49:54 +00:00
int m = ep . iparse ( ) ; ep . force_eat ( " ) " ) ;
2022-04-10 11:12:02 +00:00
add_connection ( c , ai , as , bi , bs , m ) ;
2019-12-23 20:49:54 +00:00
}
2019-12-27 22:34:41 +00:00
else if ( ep . eat ( " subline( " ) ) {
2020-04-16 18:59:34 +00:00
int ai = ep . iparse ( ) ; verify_index ( ai , c . shapes , ep ) ; ep . force_eat ( " , " ) ;
int as = ep . iparse ( ) ; verify_index ( as , c . shapes [ ai ] , ep ) ; ep . force_eat ( " , " ) ;
int bs = ep . iparse ( ) ; verify_index ( bs , c . shapes [ ai ] , ep ) ; ep . force_eat ( " ) " ) ;
2019-12-27 22:34:41 +00:00
c . shapes [ ai ] . sublines . emplace_back ( as , bs ) ;
}
else if ( ep . eat ( " sublines( " ) ) {
2020-01-02 15:40:30 +00:00
ld d = ep . rparse ( ) * distunit ;
ld eps = 1e-4 ;
if ( ep . eat ( " , " ) ) eps = ep . rparse ( ) * distunit ;
ep . force_eat ( " ) " ) ;
2019-12-27 22:34:41 +00:00
for ( auto & sh : c . shapes ) {
for ( int i = 0 ; i < isize ( sh . vertices ) ; i + + )
2020-06-06 16:42:43 +00:00
for ( int j = 0 ; j < i ; j + + )
2020-01-02 15:40:30 +00:00
if ( j ! = i + 1 & & i ! = j + 1 & & ! ( i = = 0 & & j = = isize ( sh . vertices ) - 1 ) & & ! ( j = = 0 & & i = = isize ( sh . vertices ) - 1 ) & & i ! = j ) {
ld dist = hdist ( sh . vertices [ i ] , sh . vertices [ j ] ) ;
if ( abs ( dist - d ) < eps ) {
2019-12-27 22:34:41 +00:00
sh . sublines . emplace_back ( i , j ) ;
2020-06-06 16:42:05 +00:00
if ( debugflags & DF_GEOM ) println ( hlog , " add subline " , i , " - " , j ) ;
2019-12-27 22:34:41 +00:00
}
2020-01-02 15:40:30 +00:00
}
2019-12-27 22:34:41 +00:00
}
}
2020-05-31 01:24:41 +00:00
else if ( ep . eat ( " repeat( " ) ) {
int i = ep . iparse ( 0 ) ;
verify_index ( i , c . shapes , ep ) ;
ep . force_eat ( " , " ) ;
int rep = ep . iparse ( 0 ) ;
ep . force_eat ( " ) " ) ;
auto & sh = c . shapes [ i ] ;
int N = isize ( sh . angles ) ;
if ( N % rep )
throw hr_parse_exception ( " repeat value should be a factor of the number of vertices, " + ep . where ( ) ) ;
sh . repeat_value = rep ;
int d = N / rep ;
for ( int i = d ; i < N ; i + + )
sh . connections [ i ] = sh . connections [ i - d ] ;
}
2020-05-01 16:11:48 +00:00
else if ( ep . eat ( " debug( " ) ) {
int i = ep . iparse ( 0 ) ;
2020-05-01 16:31:04 +00:00
verify_index ( i , c . shapes , ep ) ;
2020-05-01 16:11:48 +00:00
ep . force_eat ( " ) " ) ;
throw connection_debug_request ( i ) ;
}
2020-05-15 21:46:30 +00:00
else if ( ep . eat ( " stretch_shear( " ) ) {
ld stretch = ep . rparse ( 0 ) ;
ep . force_eat ( " , " ) ;
ld shear = ep . rparse ( 0 ) ;
ep . force_eat ( " , " ) ;
int i = ep . iparse ( 0 ) ;
verify_index ( i , c . shapes , ep ) ;
ep . force_eat ( " , " ) ;
int j = ep . iparse ( 0 ) ;
verify_index ( j , c . shapes [ i ] , ep ) ;
ep . force_eat ( " ) " ) ;
auto & sh = c . shapes [ i ] ;
sh . stretch_shear [ j ] = { stretch , shear } ;
auto & co = sh . connections [ j ] ;
2021-07-23 11:59:41 +00:00
auto & xsh = c . shapes [ co . sid ] ;
ld scale = sh . edges [ j ] / xsh . edges [ co . eid ] ;
2020-05-15 21:46:30 +00:00
println ( hlog , " scale = " , scale ) ;
2021-07-23 11:59:41 +00:00
xsh . stretch_shear [ co . eid ] = { 1 / stretch , shear * ( co . mirror ? 1 : - 1 ) * stretch } ;
2020-05-15 21:46:30 +00:00
}
2020-04-16 18:59:34 +00:00
else throw hr_parse_exception ( " expecting command, " + ep . where ( ) ) ;
2019-12-14 10:29:53 +00:00
}
2020-05-15 21:46:30 +00:00
if ( ! ( cgflags & qAFFINE ) ) {
for ( int i = 0 ; i < isize ( c . shapes ) ; i + + ) {
auto & sh = c . shapes [ i ] ;
for ( int j = 0 ; j < isize ( sh . edges ) ; j + + ) {
2020-05-16 13:34:56 +00:00
ld d1 = sh . edges [ j ] ;
2020-05-15 21:46:30 +00:00
auto con = sh . connections [ j ] ;
2021-07-23 11:59:41 +00:00
auto & xsh = c . shapes [ con . sid ] ;
ld d2 = xsh . edges [ con . eid ] ;
2022-04-10 11:15:05 +00:00
if ( d1 = = INFINITE_LEFT ) d1 = INFINITE_RIGHT ;
else if ( d1 = = INFINITE_RIGHT ) d1 = INFINITE_LEFT ;
2020-05-15 21:46:30 +00:00
if ( abs ( d1 - d2 ) > 1e-6 )
2021-07-23 11:59:41 +00:00
throw hr_parse_exception ( lalign ( 0 , " connecting " , make_pair ( i , j ) , " to " , con , " of different lengths only possible in a2 " ) ) ;
2020-05-15 21:46:30 +00:00
}
}
}
2021-07-23 12:08:43 +00:00
if ( do_unmirror ) {
2022-04-24 19:40:29 +00:00
unmirror ( c ) ;
2021-07-23 12:08:43 +00:00
}
2022-04-24 19:40:29 +00:00
if ( ! c . have_tree ) compute_vertex_valence ( c ) ;
2021-07-30 21:50:30 +00:00
2022-04-24 19:40:29 +00:00
if ( c . have_tree ) rulegen : : verify_parsed_treestates ( c ) ;
2021-07-23 12:08:43 +00:00
2022-04-24 20:09:54 +00:00
if ( ! load_as_slided ) slided = current ;
2019-12-14 10:29:53 +00:00
}
2020-05-01 16:11:48 +00:00
arbi_tiling debugged ;
vector < pair < transmatrix , int > > debug_polys ;
string primes ( int i ) {
string res ;
while ( i - - ) res + = " ' " ;
return res ;
}
void connection_debugger ( ) {
cmode = sm : : SIDE | sm : : DIALOG_STRICT_X ;
gamescreen ( 0 ) ;
auto & last = debug_polys . back ( ) ;
initquickqueue ( ) ;
for ( auto & p : debug_polys ) {
int id = p . second ;
2020-07-27 16:49:04 +00:00
shiftmatrix V = gmatrix [ cwt . at ] * p . first ;
2020-05-01 16:11:48 +00:00
auto & sh = debugged . shapes [ id ] . vertices ;
for ( auto & v : sh )
2020-07-27 16:49:04 +00:00
curvepoint ( v ) ;
2020-05-01 16:11:48 +00:00
2020-07-27 16:49:04 +00:00
curvepoint ( sh [ 0 ] ) ;
2020-05-01 16:11:48 +00:00
color_t col = colortables [ ' A ' ] [ id ] ;
col = darkena ( col , 0 , 0xFF ) ;
if ( & p = = & last ) {
vid . linewidth * = 2 ;
2020-07-27 16:49:04 +00:00
queuecurve ( V , 0xFFFF00FF , col , PPR : : LINE ) ;
2020-05-01 16:11:48 +00:00
vid . linewidth / = 2 ;
for ( int i = 0 ; i < isize ( sh ) ; i + + )
queuestr ( V * sh [ i ] , vid . fsize , its ( i ) , 0xFFFFFFFF ) ;
}
else
2020-07-27 16:49:04 +00:00
queuecurve ( V , 0xFFFFFFFF , col , PPR : : LINE ) ;
2020-05-01 16:11:48 +00:00
}
quickqueue ( ) ;
dialog : : init ( XLAT ( " connection debugger " ) ) ;
dialog : : addInfo ( debugged . name ) ;
dialog : : addHelp ( debugged . comment ) ;
dialog : : addBreak ( 50 ) ;
dialog : : addInfo ( " face index " + its ( last . second ) ) ;
dialog : : addBreak ( 50 ) ;
auto & sh = debugged . shapes [ last . second ] ;
int N = isize ( sh . edges ) ;
for ( int k = 0 ; k < N ; k + + ) {
auto con = sh . connections [ k ] ;
2021-07-23 11:59:41 +00:00
string cap = its ( k ) + primes ( last . second ) + " -> " + its ( con . eid ) + primes ( con . sid ) + ( con . mirror ? " (m) " : " " ) ;
2020-05-01 16:11:48 +00:00
dialog : : addSelItem ( cap , " go " , ' 0 ' + k ) ;
2020-05-03 19:11:49 +00:00
dialog : : add_action ( [ k , last , con ] {
2020-05-15 21:46:30 +00:00
if ( euclid ) cgflags | = qAFFINE ;
2021-07-30 21:50:30 +00:00
debug_polys . emplace_back ( last . first * get_adj ( debugged , last . second , k , - 1 , - 1 ) , con . sid ) ;
2020-05-15 21:46:30 +00:00
if ( euclid ) cgflags & = ~ qAFFINE ;
2020-05-01 16:11:48 +00:00
} ) ;
}
2020-07-08 10:42:10 +00:00
dialog : : addItem ( " undo " , ' u ' ) ;
dialog : : add_action ( [ ] {
if ( isize ( debug_polys ) > 1 )
debug_polys . pop_back ( ) ;
} ) ;
2020-05-01 16:11:48 +00:00
dialog : : addBack ( ) ;
dialog : : display ( ) ;
keyhandler = [ ] ( int sym , int uni ) {
handlePanning ( sym , uni ) ;
dialog : : handleNavigation ( sym , uni ) ;
if ( doexiton ( sym , uni ) ) popScreen ( ) ;
} ;
}
2019-12-14 10:29:53 +00:00
geometryinfo1 & arbi_tiling : : get_geometry ( ) {
return ginf [ gEuclid ] . g ;
}
map < heptagon * , vector < pair < heptagon * , transmatrix > > > altmap ;
EX map < heptagon * , pair < heptagon * , transmatrix > > arbi_matrix ;
EX hrmap * current_altmap ;
heptagon * build_child ( heptspin p , pair < int , int > adj ) ;
2022-04-10 11:15:05 +00:00
/** get the midedge of lr; it takes infinite vertices into account */
EX hyperpoint get_midedge ( ld len , const hyperpoint & l , const hyperpoint & r ) {
if ( len = = INFINITE_BOTH ) {
2022-04-25 18:13:22 +00:00
return normalize ( closest_to_zero ( l , r ) ) ;
2022-04-10 11:15:05 +00:00
}
else if ( len = = INFINITE_RIGHT ) {
2022-04-22 22:52:58 +00:00
return towards_inf ( r , l ) ;
2022-04-22 22:42:53 +00:00
}
else if ( len = = INFINITE_LEFT ) {
2022-04-22 22:52:58 +00:00
return towards_inf ( l , r ) ;
2022-04-10 11:15:05 +00:00
}
else return mid ( l , r ) ;
}
2022-04-22 22:57:04 +00:00
EX bool is_apeirogonal ( cell * c ) {
if ( ! in ( ) ) return false ;
return current_or_slided ( ) . shapes [ id_of ( c - > master ) ] . apeirogonal ;
}
2022-04-26 14:17:01 +00:00
EX bool apeirogon_consistent_coloring = true ;
EX bool apeirogon_hide_grid_edges = true ;
2021-07-30 21:50:30 +00:00
EX transmatrix get_adj ( arbi_tiling & c , int t , int dl , int t1 , int xdl ) {
2022-04-22 22:57:04 +00:00
2020-05-01 16:11:48 +00:00
auto & sh = c . shapes [ t ] ;
int dr = gmod ( dl + 1 , sh . size ( ) ) ;
auto & co = sh . connections [ dl ] ;
2021-07-23 11:59:41 +00:00
if ( xdl = = - 1 ) xdl = co . eid ;
2020-05-01 16:11:48 +00:00
2021-07-30 21:50:30 +00:00
if ( t1 = = - 1 ) t1 = co . sid ;
auto & xsh = c . shapes [ t1 ] ;
2020-05-01 16:11:48 +00:00
int xdr = gmod ( xdl + 1 , xsh . size ( ) ) ;
hyperpoint vl = sh . vertices [ dl ] ;
hyperpoint vr = sh . vertices [ dr ] ;
2022-04-22 22:42:53 +00:00
hyperpoint vm = get_midedge ( sh . edges [ dl ] , vl , vr ) ;
2020-05-01 16:11:48 +00:00
transmatrix rm = gpushxto0 ( vm ) ;
hyperpoint xvl = xsh . vertices [ xdl ] ;
hyperpoint xvr = xsh . vertices [ xdr ] ;
2022-04-27 21:56:48 +00:00
hyperpoint xvm = get_midedge ( xsh . edges [ xdl ] , xvl , xvr ) ;
2020-05-01 16:11:48 +00:00
transmatrix xrm = gpushxto0 ( xvm ) ;
transmatrix Res = rgpushxto0 ( vm ) * rspintox ( rm * vr ) ;
2020-05-15 09:38:20 +00:00
if ( cgflags & qAFFINE ) {
ld sca = hdist ( vl , vr ) / hdist ( xvl , xvr ) ;
transmatrix Tsca = Id ;
Tsca [ 0 ] [ 0 ] = Tsca [ 1 ] [ 1 ] = sca ;
2020-05-15 21:46:30 +00:00
auto & ss = sh . stretch_shear [ dl ] ;
Tsca [ 0 ] [ 1 ] = ss . first * ss . second * sca ;
Tsca [ 1 ] [ 1 ] * = ss . first ;
2020-05-15 09:38:20 +00:00
Res = Res * Tsca ;
}
2021-07-23 11:59:41 +00:00
if ( co . mirror ) Res = Res * MirrorX ;
2020-05-01 16:11:48 +00:00
Res = Res * spintox ( xrm * xvl ) * xrm ;
2021-07-23 11:59:41 +00:00
if ( co . mirror ) swap ( vl , vr ) ;
2020-05-01 16:11:48 +00:00
2022-02-01 16:06:56 +00:00
if ( hdist ( vl , Res * xvr ) + hdist ( vr , Res * xvl ) > .1 & & ! c . is_combinatorial ) {
2020-05-01 16:11:48 +00:00
println ( hlog , " s1 = " , kz ( spintox ( rm * vr ) ) , " s2 = " , kz ( rspintox ( xrm * xvr ) ) ) ;
println ( hlog , tie ( t , dl ) , " = " , kz ( Res ) ) ;
println ( hlog , hdist ( vl , Res * xvr ) , " # " , hdist ( vr , Res * xvl ) ) ;
exit ( 3 ) ;
}
return Res ;
}
2019-12-14 10:29:53 +00:00
struct hrmap_arbi : hrmap {
heptagon * origin ;
heptagon * getOrigin ( ) override { return origin ; }
hrmap_arbi ( ) {
dynamicval < hrmap * > curmap ( currentmap , this ) ;
2021-07-04 08:39:55 +00:00
origin = init_heptagon ( current . shapes [ 0 ] . size ( ) ) ;
2019-12-14 10:29:53 +00:00
origin - > s = hsOrigin ;
origin - > c7 = newCell ( origin - > type , origin ) ;
heptagon * alt = NULL ;
if ( hyperbolic ) {
dynamicval < eGeometry > g ( geometry , gNormal ) ;
2021-07-04 08:39:55 +00:00
alt = init_heptagon ( S7 ) ;
2019-12-14 10:29:53 +00:00
alt - > s = hsOrigin ;
alt - > alt = alt ;
current_altmap = newAltMap ( alt ) ;
}
transmatrix T = xpush ( .01241 ) * spin ( 1.4117 ) * xpush ( 0.1241 ) * Id ;
arbi_matrix [ origin ] = make_pair ( alt , T ) ;
altmap [ alt ] . emplace_back ( origin , T ) ;
2021-07-30 09:49:13 +00:00
if ( ! current . range )
current . range = auto_compute_range ( origin - > c7 ) ;
2019-12-14 10:29:53 +00:00
}
~ hrmap_arbi ( ) {
clearfrom ( origin ) ;
altmap . clear ( ) ;
arbi_matrix . clear ( ) ;
if ( current_altmap ) {
dynamicval < eGeometry > g ( geometry , gNormal ) ;
delete current_altmap ;
current_altmap = NULL ;
}
}
void verify ( ) override { }
transmatrix adj ( heptagon * h , int dl ) override {
2021-07-30 21:50:30 +00:00
return get_adj ( current_or_slided ( ) , id_of ( h ) , dl , - 1 , h - > c . move ( dl ) ? h - > c . spin ( dl ) : - 1 ) ;
2019-12-14 10:29:53 +00:00
}
heptagon * create_step ( heptagon * h , int d ) override {
2020-06-02 00:29:31 +00:00
dynamicval < bool > sl ( using_slided , false ) ;
2019-12-14 10:29:53 +00:00
int t = id_of ( h ) ;
auto & sh = current . shapes [ t ] ;
auto & co = sh . connections [ d ] ;
2021-07-23 11:59:41 +00:00
auto & xsh = current . shapes [ co . sid ] ;
2019-12-14 10:29:53 +00:00
2020-05-15 09:38:20 +00:00
if ( cgflags & qAFFINE ) {
set < heptagon * > visited ;
vector < pair < heptagon * , transmatrix > > v ;
visited . insert ( h ) ;
v . emplace_back ( h , Id ) ;
transmatrix goal = adj ( h , d ) ;
2020-05-15 21:46:30 +00:00
for ( int i = 0 ; i < affine_limit & & i < isize ( v ) ; i + + ) {
2020-05-15 09:38:20 +00:00
transmatrix T = v [ i ] . second ;
heptagon * h2 = v [ i ] . first ;
if ( eqmatrix ( T , goal ) ) {
2021-07-23 11:59:41 +00:00
h - > c . connect ( d , h2 , co . eid , co . mirror ) ;
2020-05-15 09:38:20 +00:00
return h2 ;
}
for ( int i = 0 ; i < h2 - > type ; i + + ) {
heptagon * h3 = h2 - > move ( i ) ;
if ( ! h3 ) continue ;
if ( visited . count ( h3 ) ) continue ;
visited . insert ( h3 ) ;
v . emplace_back ( h3 , T * adj ( h2 , i ) ) ;
}
}
2021-07-23 11:59:41 +00:00
auto h1 = init_heptagon ( current . shapes [ co . sid ] . size ( ) ) ;
2020-05-15 09:38:20 +00:00
h1 - > distance = h - > distance + 1 ;
2021-07-23 11:59:41 +00:00
h1 - > zebraval = co . sid ;
2020-05-15 09:38:20 +00:00
h1 - > c7 = newCell ( h1 - > type , h1 ) ;
2021-07-23 11:59:41 +00:00
h1 - > emeraldval = h - > emeraldval ^ co . mirror ;
h - > c . connect ( d , h1 , co . eid , co . mirror ) ;
2020-05-15 09:38:20 +00:00
return h1 ;
}
const auto & p = arbi_matrix [ h ] ;
heptagon * alt = p . first ;
2019-12-14 10:29:53 +00:00
transmatrix T = p . second * adj ( h , d ) ;
if ( hyperbolic ) {
dynamicval < eGeometry > g ( geometry , gNormal ) ;
dynamicval < hrmap * > cm ( currentmap , current_altmap ) ;
// transmatrix U = T;
current_altmap - > virtualRebase ( alt , T ) ;
// U = U * inverse(T);
}
2020-01-15 16:54:54 +00:00
fixmatrix ( T ) ;
2019-12-14 10:29:53 +00:00
if ( euclid ) {
/* hash the rough coordinates as heptagon* alt */
size_t s = size_t ( T [ 0 ] [ LDIM ] + .261 ) * 124101 + size_t ( T [ 1 ] [ LDIM ] + .261 ) * 82143 ;
alt = ( heptagon * ) s ;
}
2021-08-22 21:41:38 +00:00
for ( auto & p2 : altmap [ alt ] ) if ( id_of ( p2 . first ) = = co . sid & & same_point_may_warn ( tC0 ( p2 . second ) , tC0 ( T ) ) ) {
2020-03-22 09:15:57 +00:00
for ( int oth = 0 ; oth < p2 . first - > type ; oth + + ) {
2021-08-22 21:41:38 +00:00
if ( same_point_may_warn ( p2 . second * xsh . vertices [ oth ] , T * xsh . vertices [ co . eid ] ) ) {
2021-07-23 11:59:41 +00:00
h - > c . connect ( d , p2 . first , oth % p2 . first - > type , co . mirror ) ;
2020-01-02 17:53:57 +00:00
return p2 . first ;
}
2020-03-22 09:15:57 +00:00
}
2019-12-14 10:29:53 +00:00
}
2021-07-23 11:59:41 +00:00
auto h1 = init_heptagon ( current . shapes [ co . sid ] . size ( ) ) ;
2019-12-14 10:29:53 +00:00
h1 - > distance = h - > distance + 1 ;
2021-07-23 11:59:41 +00:00
h1 - > zebraval = co . sid ;
2019-12-14 10:29:53 +00:00
h1 - > c7 = newCell ( h1 - > type , h1 ) ;
2021-07-23 11:59:41 +00:00
h1 - > emeraldval = h - > emeraldval ^ co . mirror ;
h - > c . connect ( d , h1 , co . eid , co . mirror ) ;
2019-12-14 10:29:53 +00:00
arbi_matrix [ h1 ] = make_pair ( alt , T ) ;
altmap [ alt ] . emplace_back ( h1 , T ) ;
return h1 ;
}
2021-07-12 13:20:04 +00:00
transmatrix relative_matrixh ( heptagon * h2 , heptagon * h1 , const hyperpoint & hint ) override {
2020-01-28 10:22:49 +00:00
return relative_matrix_recursive ( h2 , h1 ) ;
2020-01-15 16:58:41 +00:00
}
2019-12-14 10:29:53 +00:00
transmatrix adj ( cell * c , int dir ) override { return adj ( c - > master , dir ) ; }
ld spin_angle ( cell * c , int d ) override { return SPIN_NOT_AVAILABLE ; }
2021-06-12 21:34:50 +00:00
int shvid ( cell * c ) override {
return id_of ( c - > master ) ;
}
2021-06-14 07:38:05 +00:00
hyperpoint get_corner ( cell * c , int cid , ld cf ) override {
auto & sh = arb : : current_or_slided ( ) . shapes [ arb : : id_of ( c - > master ) ] ;
2022-04-10 11:15:05 +00:00
int id = gmod ( cid , c - > type ) ;
2022-04-28 06:23:07 +00:00
if ( sh . angles [ gmod ( id - 1 , c - > type ) ] < = 0 )
2022-04-25 17:53:36 +00:00
return sh . vertices [ id ] ;
2022-04-10 11:15:05 +00:00
return normalize ( C0 + ( sh . vertices [ id ] - C0 ) * 3 / cf ) ;
2021-06-14 07:38:05 +00:00
}
2019-12-14 10:29:53 +00:00
} ;
EX hrmap * new_map ( ) { return new hrmap_arbi ; }
2020-05-30 18:00:44 +00:00
EX void run ( string fname ) {
2020-04-26 09:02:03 +00:00
stop_game ( ) ;
eGeometry g = geometry ;
arbi_tiling t = current ;
auto v = variation ;
set_geometry ( gArbitrary ) ;
try {
load ( fname ) ;
ginf [ gArbitrary ] . tiling_name = current . name ;
}
catch ( hr_polygon_error & poly ) {
set_geometry ( g ) ;
set_variation ( v ) ;
current = t ;
2020-06-02 00:26:28 +00:00
start_poly_debugger ( poly ) ;
string help = poly . generate_error ( ) ;
2020-05-01 15:12:13 +00:00
showstartmenu = false ;
for ( auto & p : poly . params )
help + = lalign ( - 1 , p . first , " = " , p . second , " \n " ) ;
gotoHelp ( help ) ;
2020-04-26 09:02:03 +00:00
}
catch ( hr_parse_exception & ex ) {
println ( hlog , " failed: " , ex . s ) ;
set_geometry ( g ) ;
current = t ;
start_game ( ) ;
addMessage ( " failed: " + ex . s ) ;
}
2020-05-01 16:11:48 +00:00
catch ( connection_debug_request & cr ) {
set_geometry ( g ) ;
debugged = current ;
current = t ;
ensure_geometry ( cr . c ) ;
debug_polys . clear ( ) ;
debug_polys . emplace_back ( Id , cr . id ) ;
pushScreen ( connection_debugger ) ;
}
2020-04-26 09:02:03 +00:00
start_game ( ) ;
}
2020-06-02 00:29:31 +00:00
string slider_error ;
2022-04-24 20:27:55 +00:00
EX void sliders_changed ( bool need_restart , bool need_start ) {
2022-04-24 20:09:54 +00:00
if ( need_restart ) stop_game ( ) ;
auto & c = current_or_slided ( ) ;
arbi_tiling backup = c ;
2020-06-02 00:29:31 +00:00
try {
2022-04-24 20:09:54 +00:00
load ( current . filename , ! need_restart , need_restart ) ;
using_slided = ! need_restart ;
2020-06-02 00:29:31 +00:00
slider_error = " OK " ;
2020-06-06 16:42:58 +00:00
# if CAP_TEXTURE
2020-06-02 00:29:31 +00:00
texture : : config . remap ( ) ;
2020-06-06 16:42:58 +00:00
# endif
2020-06-02 00:29:31 +00:00
}
catch ( hr_parse_exception & ex ) {
2022-04-24 20:09:54 +00:00
c = backup ;
2020-06-02 00:29:31 +00:00
slider_error = ex . s ;
}
catch ( hr_polygon_error & poly ) {
2022-04-24 20:09:54 +00:00
c = backup ;
2020-06-02 00:29:31 +00:00
slider_error = poly . generate_error ( ) ;
}
2022-04-24 20:27:55 +00:00
if ( need_restart & & need_start ) start_game ( ) ;
2020-06-02 00:29:31 +00:00
}
EX void set_sliders ( ) {
cmode = sm : : SIDE | sm : : MAYDARK ;
gamescreen ( 1 ) ;
dialog : : init ( XLAT ( " tessellation sliders " ) ) ;
2022-04-24 20:09:54 +00:00
dialog : : addHelp ( current . comment ) ;
2020-06-02 00:29:31 +00:00
char ch = ' A ' ;
for ( auto & sl : current . sliders ) {
dialog : : addSelItem ( sl . name , fts ( sl . current ) , ch + + ) ;
dialog : : add_action ( [ & ] {
dialog : : editNumber ( sl . current , sl . min , sl . max , 1 , sl . zero , sl . name , sl . name ) ;
2022-04-24 20:27:55 +00:00
dialog : : reaction = [ ] { sliders_changed ( false , false ) ; } ;
2022-04-24 20:09:54 +00:00
} ) ;
}
if ( isize ( current . intsliders ) )
dialog : : addInfo ( XLAT ( " the following sliders will restart the game " ) ) ;
for ( auto & sl : current . intsliders ) {
dialog : : addSelItem ( sl . name , its ( sl . current ) , ch + + ) ;
dialog : : add_action ( [ & ] {
dialog : : editNumber ( sl . current , sl . min , sl . max , 1 , sl . zero , sl . name , sl . name ) ;
2022-04-24 20:27:55 +00:00
dialog : : reaction = [ ] { sliders_changed ( true , true ) ; } ;
2020-06-02 00:29:31 +00:00
} ) ;
}
dialog : : addInfo ( slider_error ) ;
dialog : : addBack ( ) ;
dialog : : display ( ) ;
}
2021-07-29 14:12:48 +00:00
/** convert a tessellation (e.g. Archimedean, regular, etc.) to the arb::current internal representation */
EX namespace convert {
2021-07-30 10:25:17 +00:00
EX eGeometry base_geometry ;
EX eVariation base_variation ;
2021-07-29 14:12:48 +00:00
struct id_record {
int target ; /* master of this id type */
int shift ; /* sample direction 0 == our direction shift */
int modval ; /* this master type is the same as itself rotated by modval */
cell * sample ; /* sample of the master type */
} ;
inline void print ( hstream & hs , const id_record & i ) { print ( hs , " [ " , i . target , " shift= " , i . shift , " mod= " , i . modval , " ] " ) ; }
map < int , id_record > identification ;
id_record & get_identification ( int s , cell * c ) {
if ( ! identification . count ( s ) ) {
auto & id = identification [ s ] ;
id . target = s ;
id . shift = 0 ;
id . modval = c - > type ;
id . sample = c ;
}
return identification [ s ] ;
}
id_record & get_identification ( cell * c ) {
auto id = currentmap - > full_shvid ( c ) ;
return get_identification ( id , c ) ;
}
int changes ;
void be_identified ( cellwalker cw1 , cellwalker cw2 ) {
auto & id1 = get_identification ( cw1 . at ) ;
auto & id2 = get_identification ( cw2 . at ) ;
indenter ind ( 2 ) ;
int t = cw2 . at - > type ;
if ( cw1 . at - > type ! = t ) {
println ( hlog , cw1 . at - > type , " vs " , t ) ;
throw hr_exception ( " numbers disagree " ) ;
}
int d2 = gmod ( - cw2 . to_spin ( id2 . shift ) , id2 . modval ) ;
int d1 = gmod ( - cw1 . to_spin ( id1 . shift ) , id1 . modval ) ;
indenter ind1 ( 2 ) ;
if ( id2 . target ! = id1 . target ) {
auto oid2 = id2 ;
id1 . modval = gcd ( id1 . modval , id2 . modval ) ;
for ( auto & p : identification ) {
auto & idr = p . second ;
if ( idr . target = = oid2 . target ) {
idr . target = id1 . target ;
idr . modval = id1 . modval ;
idr . shift = gmod ( idr . shift + ( d2 - d1 ) , idr . modval ) ;
idr . sample = id1 . sample ;
}
}
changes + + ;
println ( hlog , identification ) ;
return ;
}
if ( d2 ! = d1 ) {
auto oid2 = id2 ;
id2 . modval = gcd ( id2 . modval , abs ( d2 - d1 ) ) ;
for ( auto & p : identification )
if ( p . second . target = = oid2 . target ) p . second . modval = id2 . modval ;
changes + + ;
println ( hlog , identification ) ;
return ;
}
}
EX void convert ( ) {
start_game ( ) ;
2021-07-31 13:47:58 +00:00
identification . clear ( ) ; changes = 0 ;
2021-07-29 14:12:48 +00:00
manual_celllister cl ;
cl . add ( currentmap - > gamestart ( ) ) ;
2021-09-30 11:18:34 +00:00
int more_tests = 1000 ;
pointer_indices . clear ( ) ;
2021-07-29 14:12:48 +00:00
int chg = - 1 ;
while ( changes > chg ) {
changes = chg ;
set < int > masters_analyzed ;
for ( int i = 0 ; i < isize ( cl . lst ) ; i + + ) {
auto c = cl . lst [ i ] ;
auto & id = get_identification ( c ) ;
2021-09-30 11:18:34 +00:00
if ( masters_analyzed . count ( id . target ) ) {
more_tests - - ;
if ( more_tests < 0 ) continue ;
}
2021-07-29 14:12:48 +00:00
masters_analyzed . insert ( id . target ) ;
cellwalker cw0 ( c , id . shift ) ;
cellwalker cws ( id . sample , 0 ) ;
for ( int i = 0 ; i < c - > type ; i + + ) {
if ( 1 ) {
indenter ind ( 2 ) ;
be_identified ( cw0 + i + wstep , cws + i + wstep ) ;
be_identified ( cw0 + i + wstep , cw0 + i + id . modval + wstep ) ;
}
if ( 1 ) {
indenter ind ( 2 ) ;
auto cwx = cw0 + i + wstep ;
auto idx = get_identification ( cwx . at ) ;
cellwalker xsample ( idx . sample , cwx . spin ) ;
xsample - = idx . shift ;
be_identified ( cwx + wstep , xsample + wstep ) ;
cl . add ( ( cw0 + i ) . cpeek ( ) ) ;
}
}
}
}
vector < int > old_shvids ;
map < int , int > old_to_new ;
for ( auto id : identification )
if ( id . first = = id . second . target ) {
old_to_new [ id . first ] = isize ( old_shvids ) ;
old_shvids . push_back ( id . first ) ;
}
auto & ac = arb : : current ;
ac . order + + ;
ac . comment = ac . filename = " converted from: " + full_geometry_name ( ) ;
ac . cscale = cgi . scalefactor ;
2021-07-30 10:12:25 +00:00
ac . boundary_ratio = 1 ;
ac . floor_scale = cgi . hexvdist / cgi . scalefactor ;
2021-07-30 09:49:13 +00:00
ac . range = cgi . base_distlimit ;
2021-07-29 14:12:48 +00:00
int N = isize ( old_shvids ) ;
2021-07-31 13:47:58 +00:00
ac . shapes . clear ( ) ;
2021-07-29 14:12:48 +00:00
ac . shapes . resize ( N ) ;
ginf [ gArbitrary ] . g = cginf . g ;
ginf [ gArbitrary ] . flags = cgflags & qBOUNDED ;
for ( int i = 0 ; i < N ; i + + ) {
auto id = identification [ old_shvids [ i ] ] ;
cell * s = id . sample ;
auto & sh = ac . shapes [ i ] ;
sh . id = i ;
int t = s - > type ;
sh . vertices . clear ( ) ;
sh . connections . clear ( ) ;
sh . repeat_value = id . modval ;
for ( int j = 0 ; j < t ; j + + ) {
auto co = currentmap - > get_corner ( s , j ) ;
sh . vertices . push_back ( co ) ;
cellwalker cw ( s , j ) ;
cw + = wstep ;
auto idx = get_identification ( cw . at ) ;
cellwalker xsample ( idx . sample , cw . spin ) ;
xsample - = idx . shift ;
sh . connections . emplace_back ( arb : : connection_t { old_to_new . at ( idx . target ) , xsample . spin , false } ) ;
}
sh . stretch_shear . resize ( t , make_pair ( 1 , 0 ) ) ;
sh . edges . clear ( ) ;
for ( int j = 0 ; j < t - 1 ; j + + )
sh . edges . push_back ( hdist ( sh . vertices [ j ] , sh . vertices [ j + 1 ] ) ) ;
sh . edges . push_back ( hdist ( sh . vertices [ t - 1 ] , sh . vertices [ 0 ] ) ) ;
sh . angles . clear ( ) ;
for ( int j = 0 ; j < t ; j + + ) {
hyperpoint v0 = sh . vertices [ j ] ;
hyperpoint v1 = sh . vertices [ ( j + 1 ) % t ] ;
hyperpoint v2 = sh . vertices [ ( j + 2 ) % t ] ;
transmatrix T = gpushxto0 ( v1 ) ;
v0 = T * v0 ;
v2 = T * v2 ;
ld alpha = atan2 ( v0 ) - atan2 ( v2 ) ;
while ( alpha > M_PI ) alpha - = 360 * degree ;
while ( alpha < - M_PI ) alpha + = 360 * degree ;
sh . angles . push_back ( alpha ) ;
}
if ( debugflags & DF_GEOM ) {
println ( hlog , " shape " , i , " : " ) ;
indenter indp ( 2 ) ;
println ( hlog , " vertices= " , sh . vertices ) ;
println ( hlog , " connections= " , sh . connections ) ;
println ( hlog , " edges= " , sh . edges ) ;
println ( hlog , " angles= " , sh . angles ) ;
}
}
2022-04-24 19:40:29 +00:00
arb : : compute_vertex_valence ( ac ) ;
2021-07-29 14:12:48 +00:00
}
2021-07-30 10:25:17 +00:00
EX bool in ( ) {
return arb : : in ( ) & & base_geometry ! = gArbitrary ;
}
/** activate the converted tessellation */
EX void activate ( ) {
if ( geometry ! = gArbitrary ) {
base_geometry = geometry ;
base_variation = variation ;
stop_game ( ) ;
geometry = gArbitrary ;
variation = eVariation : : pure ;
}
}
2021-07-29 14:12:48 +00:00
EX }
2019-12-14 10:29:53 +00:00
# if CAP_COMMANDLINE
int readArgs ( ) {
using namespace arg ;
if ( 0 ) ;
2020-06-06 16:43:09 +00:00
else if ( argis ( " -tes " ) | | argis ( " -arbi " ) ) {
2019-12-14 10:29:53 +00:00
PHASEFROM ( 2 ) ;
shift ( ) ;
2020-04-26 09:02:03 +00:00
run ( args ( ) ) ;
2019-12-14 10:29:53 +00:00
}
2021-10-17 07:40:28 +00:00
else if ( argis ( " -tes-opt " ) ) {
arg : : run_arguments ( current . options ) ;
}
2021-07-29 14:12:48 +00:00
else if ( argis ( " -arb-convert " ) ) {
try {
convert : : convert ( ) ;
set_geometry ( gArbitrary ) ;
}
catch ( hr_exception & e ) {
println ( hlog , " failed to convert: " , e . what ( ) ) ;
}
}
2020-06-03 09:44:00 +00:00
else if ( argis ( " -arb-slider " ) ) {
PHASEFROM ( 2 ) ;
shift ( ) ;
string slider = args ( ) ;
bool found = true ;
for ( auto & sl : current . sliders )
if ( sl . name = = slider ) {
2022-04-24 20:27:55 +00:00
shift_arg_formula ( sl . current , [ ] { sliders_changed ( false , false ) ; } ) ;
2022-04-24 20:09:54 +00:00
found = true ;
}
for ( auto & sl : current . intsliders )
if ( sl . name = = slider ) {
shift ( ) ; sl . current = argi ( ) ;
stop_game ( ) ;
2022-04-24 20:27:55 +00:00
sliders_changed ( true , false ) ;
2020-06-03 09:44:00 +00:00
found = true ;
}
if ( ! found ) {
println ( hlog , " warning: no slider named " , slider , " found " ) ;
shift ( ) ;
}
}
2019-12-14 10:29:53 +00:00
else return 1 ;
return 0 ;
}
auto hook = addHook ( hooks_args , 100 , readArgs ) ;
# endif
EX bool in ( ) { return geometry = = gArbitrary ; }
2020-04-26 09:02:03 +00:00
EX string tes = " tessellations/sample/marjorie-rice.tes " ;
2019-12-27 01:08:04 +00:00
2019-12-27 21:59:50 +00:00
EX bool linespattern ( cell * c ) {
return current . shapes [ id_of ( c - > master ) ] . flags & arcm : : sfLINE ;
}
EX bool pseudohept ( cell * c ) {
2021-07-29 14:13:01 +00:00
if ( ! current . have_ph ) return true ;
2019-12-27 21:59:50 +00:00
return current . shapes [ id_of ( c - > master ) ] . flags & arcm : : sfPH ;
}
2019-12-27 01:08:04 +00:00
EX void choose ( ) {
dialog : : openFileDialog ( tes , XLAT ( " open a tiling " ) , " .tes " ,
[ ] ( ) {
2020-04-26 09:02:03 +00:00
run ( tes ) ;
2021-10-17 07:40:28 +00:00
if ( ! current . options . empty ( ) )
dialog : : push_confirm_dialog ( [ ] { arg : : run_arguments ( current . options ) ; start_game ( ) ; } , " load the settings defined in this file? " ) ;
2019-12-27 01:08:04 +00:00
return true ;
} ) ;
}
2022-04-25 17:53:36 +00:00
EX pair < ld , ld > rep_ideal ( ld e , ld u IS ( 1 ) ) {
2022-04-10 11:15:05 +00:00
ld alpha = 2 * M_PI / e ;
2022-04-25 17:53:36 +00:00
hyperpoint h1 = point3 ( cos ( alpha ) * u , - sin ( alpha ) * u , 1 ) ;
hyperpoint h2 = point3 ( u , 0 , 1 ) ;
hyperpoint h3 = point3 ( cos ( alpha ) * u , sin ( alpha ) * u , 1 ) ;
2022-04-10 11:15:05 +00:00
hyperpoint h12 = mid ( h1 , h2 ) ;
hyperpoint h23 = mid ( h2 , h3 ) ;
ld len = hdist ( h12 , h23 ) ;
transmatrix T = gpushxto0 ( h12 ) ;
auto T0 = T * C0 ;
auto Th23 = T * h23 ;
ld beta = atan2 ( T0 ) ;
ld gamma = atan2 ( Th23 ) ;
return { len , 90 * degree - ( gamma - beta ) } ;
}
2020-06-03 14:42:26 +00:00
# if MAXMDIM >= 4
auto hooksw = addHook ( hooks_swapdim , 100 , [ ] {
for ( auto & p : { & current , & slided } )
for ( auto & s : p - > shapes )
for ( auto & v : s . vertices )
swapmatrix ( v ) ;
for ( auto & p : altmap ) for ( auto & pp : p . second ) swapmatrix ( pp . second ) ;
for ( auto & p : arbi_matrix ) swapmatrix ( p . second . second ) ;
} ) ;
# endif
2019-12-14 10:29:53 +00:00
EX }
2020-05-03 19:11:49 +00:00
}