/dports/games/gnuchess/gnuchess-6.2.9/src/adapter/ |
H A D | pgn.cpp | 261 pgn->move_line = pgn->token_line; in pgn_next_move() 262 pgn->move_column = pgn->token_column; in pgn_next_move() 311 …f (DispToken) printf("< L%d C%d \"%s\" (%03X)\n",pgn->token_line,pgn->token_column,pgn->token_stri… in pgn_token_read() 341 pgn->token_line = pgn->char_line; in pgn_read_token() 342 pgn->token_column = pgn->char_column; in pgn_read_token() 356 pgn->token_type = pgn->char_hack; in pgn_read_token() 435 pgn->token_string[pgn->token_length++] = pgn->char_hack; in pgn_read_token() 493 pgn->token_string[pgn->token_length++] = pgn->char_hack; in pgn_read_token() 516 pgn->token_string[pgn->token_length++] = pgn->char_hack; in pgn_read_token() 653 pgn->char_hack = fgetc(pgn->file); in pgn_char_read() [all …]
|
/dports/games/polyglot/polyglot-1.4.70b/ |
H A D | pgn.c | 226 pgn->move_line = pgn->token_line; in pgn_next_move() 227 pgn->move_column = pgn->token_column; in pgn_next_move() 276 …f (DispToken) printf("< L%d C%d \"%s\" (%03X)\n",pgn->token_line,pgn->token_column,pgn->token_stri… in pgn_token_read() 306 pgn->token_line = pgn->char_line; in pgn_read_token() 307 pgn->token_column = pgn->char_column; in pgn_read_token() 321 pgn->token_type = pgn->char_hack; in pgn_read_token() 400 pgn->token_string[pgn->token_length++] = pgn->char_hack; in pgn_read_token() 458 pgn->token_string[pgn->token_length++] = pgn->char_hack; in pgn_read_token() 481 pgn->token_string[pgn->token_length++] = pgn->char_hack; in pgn_read_token() 618 pgn->char_hack = fgetc(pgn->file); in pgn_char_read() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Set_movable_separability_2/Single_mold_translational_casting/ |
H A D | is_pullout_direction.h | 51 (const CGAL::Polygon_2<CastingTraits_2>& pgn, in is_pullout_direction() argument 57 CGAL_precondition(pgn.is_simple()); in is_pullout_direction() 60 auto e_it = pgn.edges_begin(); in is_pullout_direction() 63 for (; e_it != pgn.edges_end(); ++e_it) { in is_pullout_direction() 78 (const CGAL::Polygon_2<CastingTraits_2>& pgn, in is_pullout_direction() argument 90 (const CGAL::Polygon_2<CastingTraits_2>& pgn, in is_pullout_direction() argument 139 CGAL_precondition(pgn.is_simple()); in is_pullout_direction() 142 Edge_iter e_it = pgn.edges_begin(); in is_pullout_direction() 146 Edge_iter top_edge= pgn.edges_end(); in is_pullout_direction() 147 for (; e_it != pgn.edges_end(); ++e_it) { in is_pullout_direction() [all …]
|
H A D | pullout_directions.h | 70 (const CGAL::Polygon_2<CastingTraits_2>& pgn, in pullout_directions() argument 75 CGAL_precondition(pgn.is_simple()); in pullout_directions() 77 CGAL_precondition(pgn.edges_end()!=i); in pullout_directions() 95 for (auto e_it = pgn.edges_begin(); e_it != pgn.edges_end(); ++e_it) { in pullout_directions() 182 (const CGAL::Polygon_2<CastingTraits_2>& pgn, in pullout_directions() argument 187 return pullout_directions(pgn, it, orientation, traits); in pullout_directions() 196 (const CGAL::Polygon_2<CastingTraits_2>& pgn, in pullout_directions() argument 200 CGAL::Orientation orientation = pgn.orientation(); in pullout_directions() 201 return pullout_directions(pgn, it, orientation, traits); in pullout_directions() 210 (const CGAL::Polygon_2<CastingTraits_2>& pgn, in pullout_directions() argument [all …]
|
/dports/misc/rump/buildrump.sh-b914579/src/usr.bin/make/ |
H A D | make.c | 175 if (pgn->cmgn == NULL || cgn->mtime > pgn->cmgn->mtime) { in Make_TimeStamp() 176 pgn->cmgn = cgn; in Make_TimeStamp() 411 pgn->unmade--; in MakeFindChild() 497 pgn->unmade += 1; in Make_HandleUse() 552 pgn->unmade--; in MakeHandleUse() 733 pgn->name, pgn->cohort_num, pgn->flags, in Make_Update() 734 pgn->type, pgn->made, pgn->unmade-1); in Make_Update() 782 pgn->name, pgn->cohort_num); in Make_Update() 785 Error("Graph cycles through %s%s", pgn->name, pgn->cohort_num); in Make_Update() 814 pgn->name, pgn->cohort_num, pgn->made); in Make_Update() [all …]
|
/dports/games/py-pychess/pychess-1.0.2/lib/pychess/external/ |
H A D | chess_db.py | 20 self.pgn = '' 31 pgn = os.path.normcase(pgn) 32 self.pgn = pgn 43 self.pgn = '' 48 if not self.pgn: 50 cmd = 'book ' + self.pgn 74 if not self.pgn: 76 pgn = [] 90 return pgn 92 def get_header(self, pgn): argument [all …]
|
H A D | scoutfish.py | 21 self.pgn = '' 28 def open(self, pgn): argument 30 if not os.path.isfile(pgn): 32 pgn = os.path.normcase(pgn) 33 self.pgn = pgn 44 self.pgn = '' 49 if not self.pgn: 51 cmd = 'make ' + self.pgn 93 if not self.pgn: 110 def get_header(self, pgn): argument [all …]
|
/dports/textproc/p5-Chess-PGN-Parse/Chess-PGN-Parse-0.20/examples/ |
H A D | test_6_PGN.pl | 31 my $pgn = new Chess::PGN::Parse undef, $text 33 $pgn->read_game(); 35 print $pgn->standard_PGN({ 40 $pgn->set_site("The Bat Caverne"); 41 $pgn->set_event("Batman IV - The match"); 42 $pgn->set_white("Batman"); 43 $pgn->set_black("TheJoker"); 44 $pgn->set_eco("C41"); 45 $pgn->set_result("1-0"); 49 $pgn->parse_game({save_comments => 'yes'}); [all …]
|
H A D | test_3_PGN.pl | 31 my $pgn = new Chess::PGN::Parse undef, $text 34 while ($pgn->read_game()) { 35 print $pgn->event, " / ", $pgn->white, " - ", $pgn->black, 36 " : ", $pgn->result, "\n"; 37 if ($pgn->parse_game()) { 38 print join(" ", @{$pgn->moves}), "\n";
|
H A D | test_1_PGN.pl | 7 my $pgn = new Chess::PGN::Parse $filename 10 while ($pgn->read_game()) { 11 print $pgn->event, " / ", $pgn->white, " - ", $pgn->black, 12 " : ", $pgn->result, "\n"; 13 if ($pgn->parse_game() ) { #&& $pgn->moves) { 14 print join(" ", @{$pgn->moves}), "\n";
|
H A D | test_4_PGN.pl | 31 my $pgn = new Chess::PGN::Parse undef, $text 33 $pgn->read_game(); 36 print $pgn->standard_PGN(); 37 $pgn->parse_game(); 41 print $pgn->standard_PGN(); 45 print $pgn->standard_PGN({
|
H A D | test_5_PGN.pl | 31 my $pgn = new Chess::PGN::Parse undef, $text 33 $pgn->read_game(); 35 print $pgn->standard_PGN({ 42 $pgn->parse_game({save_comments => 'yes'}); 44 print $pgn->standard_PGN({ 51 print $pgn->standard_PGN({
|
/dports/astro/gpsd/gpsd-3.20/ |
H A D | driver_nmea2000.c | 85 l2 = sprintf(&bu[ptr], "got data:%6u:%3d: ", pgn->pgn, len); in print_data() 103 (void)pgn; in print_data() 201 "pgn %6d(%3d):\n", pgn->pgn, session->driver.nmea2000.unit); in hnd_059392() 213 "pgn %6d(%3d):\n", pgn->pgn, session->driver.nmea2000.unit); in hnd_060928() 225 "pgn %6d(%3d):\n", pgn->pgn, session->driver.nmea2000.unit); in hnd_126208() 237 "pgn %6d(%3d):\n", pgn->pgn, session->driver.nmea2000.unit); in hnd_126464() 249 "pgn %6d(%3d):\n", pgn->pgn, session->driver.nmea2000.unit); in hnd_126996() 269 "pgn %6d(%3d):\n", pgn->pgn, session->driver.nmea2000.unit); in hnd_127258() 281 "pgn %6d(%3d):\n", pgn->pgn, session->driver.nmea2000.unit); in hnd_129025() 370 pgn->pgn, in hnd_129539() [all …]
|
/dports/games/jchessboard/JChessBoard-1.5/jchessboard/ |
H A D | GameNode.java | 170 pgn.append("{"); in getPGN() 171 pgn.append(comment); in getPGN() 172 pgn.append("} "); in getPGN() 180 pgn.append(". "); in getPGN() 193 pgn.append(" "); in getPGN() 196 pgn.append("$"); in getPGN() 198 pgn.append(" "); in getPGN() 201 pgn.append("{"); in getPGN() 203 pgn.append("} "); in getPGN() 208 pgn.append("("); in getPGN() [all …]
|
/dports/devel/bmake/bmake/ |
H A D | make.c | 357 pgn->unmade--; in PretendAllChildrenAreMade() 425 pgn->unmade++; in Make_HandleUse() 428 pgn->type |= in Make_HandleUse() 466 pgn->unmade--; in MakeHandleUse() 682 pgn->cohort_num); in Make_Update() 693 pgn->flags |= FORCE; in Make_Update() 727 pgn->unmade--; in Make_Update() 731 pgn->name, pgn->cohort_num); in Make_Update() 763 pgn->name, pgn->cohort_num, pgn->made); in Make_Update() 1304 pgn->flags = REMAKE; in Make_ProcessWait() [all …]
|
H A D | compat.c | 482 Compat_Make(cohort, pgn); in MakeNodes() 487 MakeUnmade(GNode *gn, GNode *pgn) in MakeUnmade() argument 510 pgn->flags &= ~(unsigned)REMAKE; in MakeUnmade() 588 pgn->flags |= FORCE; in MakeUnmade() 590 pgn->flags |= CHILDMADE; in MakeUnmade() 603 MakeOther(GNode *gn, GNode *pgn) in MakeOther() argument 619 pgn->flags |= CHILDMADE; in MakeOther() 656 if (gn->made == UNMADE && (gn == pgn || !(pgn->type & OP_MADE))) { in Compat_Make() 657 if (!MakeUnmade(gn, pgn)) in Compat_Make() 668 MakeOther(gn, pgn); in Compat_Make() [all …]
|
/dports/devel/fmake/fmake-r250982/ |
H A D | make.c | 117 pgn->cmtime = cgn->mtime; in Make_TimeStamp() 118 pgn->cmtime_gn = cgn; in Make_TimeStamp() 311 pgn->unmade += 1; in Make_HandleUse() 325 pgn->unmade--; in Make_HandleUse() 434 pgn = Lst_Datum(ln); in Make_Update() 435 if (pgn->make) { in Make_Update() 436 pgn->unmade -= 1; in Make_Update() 443 if (pgn->unmade == 0) { in Make_Update() 476 pgn = Lst_Datum(ln); in Make_Update() 477 if (pgn->make) { in Make_Update() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Polygon_set_2.h | 67 Base (pgn) in Polygon_set_2() 78 Base::intersection(pgn); in intersection() 83 Base::intersection(pgn); in intersection() 111 Base::join(pgn); in join() 116 Base::join(pgn); in join() 144 Base::difference(pgn); in difference() 149 Base::difference(pgn); in difference() 177 Base::symmetric_difference(pgn); in symmetric_difference() 182 Base::symmetric_difference(pgn); in symmetric_difference() 210 return (Base::do_intersect(pgn)); in do_intersect() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Minkowski_sum_2/ |
H A D | Polygon_convex_decomposition.h | 62 OutputIterator decompose (const Polygon_2& pgn, in decompose() argument 67 Polygon_2 my_pgn = pgn; in decompose() 73 return (_decompose (pgn, Strategy_tag(), oi)); in decompose() 83 OutputIterator _decompose (const Polygon_2& pgn, in _decompose() argument 87 return (optimal_convex_partition_2 (pgn.vertices_begin(), in _decompose() 88 pgn.vertices_end(), in _decompose() 98 OutputIterator _decompose (const Polygon_2& pgn, in _decompose() argument 102 return (approx_convex_partition_2 (pgn.vertices_begin(), in _decompose() 103 pgn.vertices_end(), in _decompose() 113 OutputIterator _decompose (const Polygon_2& pgn, in _decompose() argument [all …]
|
H A D | Decomposition_strategy_adapter.h | 106 if (pgn.orientation() == CLOCKWISE) { in operator() 109 Polygon_2 my_pgn = pgn; in operator() 118 _decompose (pgn, Strategy_tag(), std::back_inserter(pgns)); in operator() 134 OutputIterator _decompose(const Polygon_2& pgn, in _decompose() argument 138 return (optimal_convex_partition_2(pgn.vertices_begin(), in _decompose() 139 pgn.vertices_end(), in _decompose() 148 OutputIterator _decompose(const Polygon_2& pgn, in _decompose() argument 152 return (approx_convex_partition_2(pgn.vertices_begin(), in _decompose() 153 pgn.vertices_end(), in _decompose() 162 OutputIterator _decompose(const Polygon_2& pgn, in _decompose() argument [all …]
|
/dports/cad/calculix/CalculiX/cgx_2.18/src/ |
H A D | dataGeo.c | 59 j=surf[i].pgn[n++]; in descalSurfs() 63 surf[i].pgn[n]=(surf[i].pgn[n]*scale->w)+scale->x; in descalSurfs() 64 surf[i].pgn[n+1]=(surf[i].pgn[n+1]*scale->w)+scale->y; in descalSurfs() 65 surf[i].pgn[n+2]=(surf[i].pgn[n+2]*scale->w)+scale->z; in descalSurfs() 82 j=surf[i].pgn[n++]; in scalSurfs() 87 surf[i].pgn[n]=(surf[i].pgn[n]-scale->x)/scale->w; in scalSurfs() 88 surf[i].pgn[n+1]=(surf[i].pgn[n+1]-scale->y)/scale->w; in scalSurfs() 89 surf[i].pgn[n+2]=(surf[i].pgn[n+2]-scale->z)/scale->w; in scalSurfs()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Boolean_set_operations_2/ |
H A D | Gps_polygon_validation.h | 180 Cci_pair itr_pair = traits.construct_curves_2_object()(pgn); in is_closed_polygon() 295 bool closed = is_closed_polygon(pgn,traits); in is_valid_polygon() 300 bool simple = is_simple_polygon(pgn,traits); in is_valid_polygon() 323 for (itr = pgn.holes_begin(); itr != pgn.holes_end(); ++itr) { in is_closed_polygon_with_holes() 474 return is_crossover_outer_boundary(pgn, traits, pl); in is_crossover_outer_boundary() 526 for (hoit = pgn.holes_begin(); hoit != pgn.holes_end(); ++hoit) { in is_relatively_simple_polygon_with_holes() 565 for (hoit = pgn.holes_begin(); hoit != pgn.holes_end(); ++hoit) { in has_valid_orientation_polygon_with_holes() 755 bool closed = is_closed_polygon_with_holes(pgn, traits); in is_valid_polygon_with_holes() 764 bool no_cross = is_crossover_outer_boundary(pgn, traits); in is_valid_polygon_with_holes() 785 { return is_valid_polygon_with_holes(pgn, traits); } in is_valid_unknown_polygon() [all …]
|
H A D | Gps_on_surface_base_2.h | 196 _insert(pgn, *m_arr); in Gps_on_surface_base_2() 207 _insert(pgn, *m_arr); in Gps_on_surface_base_2() 257 simp.simplify(pgn); in simplify() 328 _intersection(pgn); in intersection() 335 _intersection(pgn); in intersection() 355 _join(pgn); in join() 362 _join(pgn); in join() 381 _difference(pgn); in difference() 388 _difference(pgn); in difference() 501 Self other(pgn); in oriented_side() [all …]
|
/dports/textproc/p5-Chess-PGN-Parse/Chess-PGN-Parse-0.20/ |
H A D | README | 4 (http://www.schachprobleme.de/chessml/faq/pgn/). It is among the 28 my $pgn = new Chess::PGN::Parse $pgnfile 36 while ($pgn->read_game()) { 37 print $pgn->white, ", " , $pgn->black, ", ", 38 $pgn->result, ", ", 39 $pgn->game, "\n"; 48 while ($pgn->read_game()) { 49 if ($pgn->parse_game({save_comments => 'yes', 63 my $pgnfile = "kk_2001.pgn"; 64 my $pgn = Chess::PGN::Parse->new $pgnfile [all …]
|
/dports/games/py-pychess/pychess-1.0.2/lib/pychess/Savers/ |
H A D | remotegame.py | 239 pgn = pgn.strip() 246 pgn = pgn.replace("\n\n\n", "\n\n") 253 pgn = pgn[:pos] 527 if pgn in [None, ''] or 'NO SUCH GAME' in pgn: 596 if pgn is None or len(pgn) <= 128: 831 pgn = parser.pgn 833 pgn = pgn.strip() 1457 pgn = parser.pgn 1590 if pgn is None or len(pgn) == 0: 1689 if pgn in [None, ''] or 'does not exist.' in pgn or 'Invalid event' in pgn: [all …]
|