pax_global_header00006660000000000000000000000064113563464570014530gustar00rootroot0000000000000052 comment=8b3fe2b517bebbd757cf238bf47d7e92f2611b79 sudoku-0.3.5/000077500000000000000000000000001135634645700130475ustar00rootroot00000000000000sudoku-0.3.5/.gitignore000066400000000000000000000001351135634645700150360ustar00rootroot00000000000000.dependencies *.o *.so* *.mo *.gmo *.pot *.tgz *~ debian sudoku_generator testrunner* srcdoc sudoku-0.3.5/CONTRIBUTORS000066400000000000000000000010601135634645700147240ustar00rootroot00000000000000Special thanks go to the following persons (if you think your name is missing here, please send an email to tom@toms-cafe.de). Klaus Schmidinger for his fantastic Video Disk Recorder Ville Skyttä for Finnish language texts Bittor Corl for Spanish language texts Diego Pierotto for Italian language texts Patrice Staudt for French language texts NIVAL Michaël for French language texts sudoku-0.3.5/COPYING000066400000000000000000000431031135634645700141030ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 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; either version 2 of the License, or (at your option) any later version. 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-1301 USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. sudoku-0.3.5/Doxyfile000066400000000000000000001777521135634645700146000ustar00rootroot00000000000000# Doxyfile 1.6.3 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file # that follow. The default is UTF-8 which is also the encoding used for all # text before the first occurrence of this tag. Doxygen uses libiconv (or the # iconv built into libc) for the transcoding. See # http://www.gnu.org/software/libiconv for the list of possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = "VDR plugin 'Sudoku'" # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = $(VERSION) # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, # Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English # messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, # Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrilic, Slovak, # Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. OUTPUT_LANGUAGE = English # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is # used as the annotated text. Otherwise, the brief description is used as-is. # If left blank, the following values are used ("$name" is automatically # replaced with the name of the entity): "The $name class" "The $name widget" # "The $name file" "is" "provides" "specifies" "contains" # "represents" "a" "an" "the" ABBREVIATE_BRIEF = # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all # inherited members of a class in the documentation of that class as if those # members were ordinary class members. Constructors, destructors and assignment # operators of the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = YES # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = YES # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_AUTOBRIEF = NO # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = NO # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 8 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C # sources only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = NO # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java # sources only. Doxygen will then generate output that is more tailored for # Java. For instance, namespaces will be presented as packages, qualified # scopes will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran # sources only. Doxygen will then generate output that is more tailored for # Fortran. OPTIMIZE_FOR_FORTRAN = NO # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL # sources. Doxygen will then generate output that is tailored for # VHDL. OPTIMIZE_OUTPUT_VHDL = NO # Doxygen selects the parser to use depending on the extension of the files it parses. # With this tag you can assign which parser to use for a given extension. # Doxygen has a built-in mapping, but you can override or extend it using this tag. # The format is ext=language, where ext is a file extension, and language is one of # the parsers supported by doxygen: IDL, Java, Javascript, C#, C, C++, D, PHP, # Objective-C, Python, Fortran, VHDL, C, C++. For instance to make doxygen treat # .inc files as Fortran files (default is PHP), and .f files as C (default is Fortran), # use: inc=Fortran f=C. Note that for custom extensions you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. EXTENSION_MAPPING = # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want # to include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also make the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = NO # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. # Doxygen will parse them like normal C++ but will assume all classes use public # instead of private inheritance when no explicit protection keyword is present. SIP_SUPPORT = NO # For Microsoft's IDL there are propget and propput attributes to indicate getter # and setter methods for a property. Setting this option to YES (the default) # will make doxygen to replace the get and set methods by a property in the # documentation. This will only work if the methods are indeed getting or # setting a simple type. If this is not the case, or you want to show the # methods anyway, you should set this option to NO. IDL_PROPERTY_SUPPORT = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum # is documented as struct, union, or enum with the name of the typedef. So # typedef struct TypeS {} TypeT, will appear in the documentation as a struct # with name TypeT. When disabled the typedef will appear as a member of a file, # namespace, or class. And the struct will be named TypeS. This can typically # be useful for C code in case the coding convention dictates that all compound # types are typedef'ed and only the typedef is referenced, never the tag name. TYPEDEF_HIDES_STRUCT = NO # The SYMBOL_CACHE_SIZE determines the size of the internal cache use to # determine which symbols to keep in memory and which to flush to disk. # When the cache is full, less often used symbols will be written to disk. # For small to medium size projects (<1000 input files) the default value is # probably good enough. For larger projects a too small cache size can cause # doxygen to be busy swapping symbols to and from disk most of the time # causing a significant performance penality. # If the system has enough physical memory increasing the cache will improve the # performance by keeping more symbols in memory. Note that the value works on # a logarithmic scale so increasing the size by one will rougly double the # memory usage. The cache size is given by this formula: # 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, # corresponding to a cache size of 2^16 = 65536 symbols SYMBOL_CACHE_SIZE = 0 #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = YES # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = YES # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = YES # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = YES # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be # extracted and appear in the documentation as a namespace called # 'anonymous_namespace{file}', where file will be replaced with the base # name of the file that contains the anonymous namespace. By default # anonymous namespace are hidden. EXTRACT_ANON_NSPACES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = NO # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = NO # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # and Mac users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen # will list include files with double quotes in the documentation # rather than with sharp brackets. FORCE_LOCAL_INCLUDES = NO # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = YES # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = NO # If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the (brief and detailed) documentation of class members so that constructors and destructors are listed first. If set to NO (the default) the constructors will appear in the respective orders defined by SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. SORT_MEMBERS_CTORS_1ST = NO # If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the # hierarchy of group names into alphabetical order. If set to NO (the default) # the group names will appear in their defined order. SORT_GROUP_NAMES = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= YES # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = YES # If the sources in your project are distributed over multiple directories # then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy # in the documentation. The default is NO. SHOW_DIRECTORIES = YES # Set the SHOW_FILES tag to NO to disable the generation of the Files page. # This will remove the Files entry from the Quick Index and from the # Folder Tree View (if specified). The default is YES. SHOW_FILES = YES # Set the SHOW_NAMESPACES tag to NO to disable the generation of the # Namespaces page. # This will remove the Namespaces entry from the Quick Index # and from the Folder Tree View (if specified). The default is YES. SHOW_NAMESPACES = YES # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from # the version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed by # doxygen. The layout file controls the global structure of the generated output files # in an output format independent way. The create the layout file that represents # doxygen's defaults, run doxygen with the -l option. You can optionally specify a # file name after the option, if omitted DoxygenLayout.xml will be used as the name # of the layout file. LAYOUT_FILE = #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # This WARN_NO_PARAMDOC option can be abled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is # also the default input encoding. Doxygen uses libiconv (or the iconv built # into libc) for the transcoding. See http://www.gnu.org/software/libiconv for # the list of possible encodings. INPUT_ENCODING = UTF-8 # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx # *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90 FILE_PATTERNS = # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = YES # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or # directories that are symbolic links (a Unix filesystem feature) are excluded # from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = */po/* \ */debian/* \ */.git/* # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the # output. The symbol name can be a fully qualified name, a word, or if the # wildcard * is used, a substring. Examples: ANamespace, AClass, # AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. # If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. # Doxygen will compare the file name with each pattern and apply the # filter if there is a match. # The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER # is applied to all files. FILTER_PATTERNS = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = YES # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = NO # If the REFERENCED_BY_RELATION tag is set to YES # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = YES # If the REFERENCES_RELATION tag is set to YES # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = YES # If the REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. # Otherwise they will link to the documentation. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = srcdoc # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # stylesheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML # page will contain the date and time when the page was generated. Setting # this to NO can help when comparing the output of multiple runs. HTML_TIMESTAMP = YES # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. For this to work a browser that supports # JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox # Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari). HTML_DYNAMIC_SECTIONS = NO # If the GENERATE_DOCSET tag is set to YES, additional index files # will be generated that can be used as input for Apple's Xcode 3 # integrated development environment, introduced with OSX 10.5 (Leopard). # To create a documentation set, doxygen will generate a Makefile in the # HTML output directory. Running make will produce the docset in that # directory and running "make install" will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find # it at startup. # See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html for more information. GENERATE_DOCSET = NO # When GENERATE_DOCSET tag is set to YES, this tag determines the name of the # feed. A documentation feed provides an umbrella under which multiple # documentation sets from a single provider (such as a company or product suite) # can be grouped. DOCSET_FEEDNAME = "Doxygen generated docs" # When GENERATE_DOCSET tag is set to YES, this tag specifies a string that # should uniquely identify the documentation set bundle. This should be a # reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen # will append .docset to the name. DOCSET_BUNDLE_ID = org.doxygen.Project # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compiled HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING # is used to encode HtmlHelp index (hhk), content (hhc) and project file # content. CHM_INDEX_ENCODING = # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and QHP_VIRTUAL_FOLDER # are set, an additional index file will be generated that can be used as input for # Qt's qhelpgenerator to generate a Qt Compressed Help (.qch) of the generated # HTML documentation. GENERATE_QHP = NO # If the QHG_LOCATION tag is specified, the QCH_FILE tag can # be used to specify the file name of the resulting .qch file. # The path specified is relative to the HTML output folder. QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#namespace QHP_NAMESPACE = org.doxygen.Project # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#virtual-folders QHP_VIRTUAL_FOLDER = doc # If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to add. # For more information please see # http://doc.trolltech.com/qthelpproject.html#custom-filters QHP_CUST_FILTER_NAME = # The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the custom filter to add.For more information please see # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this project's # filter section matches. # Qt Help Project / Filter Attributes. QHP_SECT_FILTER_ATTRS = # If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can # be used to specify the location of Qt's qhelpgenerator. # If non-empty doxygen will try to run qhelpgenerator on the generated # .qhp file. QHG_LOCATION = # If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files # will be generated, which together with the HTML files, form an Eclipse help # plugin. To install this plugin and make it available under the help contents # menu in Eclipse, the contents of the directory containing the HTML and XML # files needs to be copied into the plugins directory of eclipse. The name of # the directory within the plugins directory should be the same as # the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before the help appears. GENERATE_ECLIPSEHELP = NO # A unique identifier for the eclipse help plugin. When installing the plugin # the directory name containing the HTML and XML files should also have # this name. ECLIPSE_DOC_ID = org.doxygen.Project # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index # structure should be generated to display hierarchical information. # If the tag value is set to YES, a side panel will be generated # containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, # and Class Hierarchy pages using a tree view instead of an ordered list. USE_INLINE_TREES = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 # Use this tag to change the font size of Latex formulas included # as images in the HTML documentation. The default is 10. Note that # when you change the font size after a successful doxygen run you need # to manually remove any form_*.png images from the HTML output directory # to force them to be regenerated. FORMULA_FONTSIZE = 10 # When the SEARCHENGINE tag is enabled doxygen will generate a search box for the HTML output. The underlying search engine uses javascript # and DHTML and should work on any modern browser. Note that when using HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) there is already a search function so this one should # typically be disabled. For large projects the javascript based search engine # can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. SEARCHENGINE = NO # When the SERVER_BASED_SEARCH tag is enabled the search engine will be implemented using a PHP enabled web server instead of at the web client using Javascript. Doxygen will generate the search PHP script and index # file to put on the web server. The advantage of the server based approach is that it scales better to large projects and allows full text search. The disadvances is that it is more difficult to setup # and does not have live searching capabilities. SERVER_BASED_SEARCH = NO #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. # Note that when enabling USE_PDFLATEX this option is only used for # generating bitmaps for formulas in the HTML output, but not in the # Makefile that is written to the output directory. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = NO # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = NO # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO # If LATEX_SOURCE_CODE is set to YES then doxygen will include source code with syntax highlighting in the LaTeX output. Note that which sources are shown also depends on other settings such as SOURCE_BROWSER. LATEX_SOURCE_CODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # The XML_SCHEMA tag can be used to specify an XML schema, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_SCHEMA = # The XML_DTD tag can be used to specify an XML DTD, # which can be used by a validating XML parser to check the # syntax of the XML files. XML_DTD = # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. # This is useful # if you want to understand what is going on. # On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_DEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line, have an all uppercase name, and do not end with a semicolon. Such # function macros are typically used for boiler-plate code, and will confuse # the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::additions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. # Optionally an initial location of the external documentation # can be added for each tagfile. The format of a tag file without # this location is as follows: # # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths or # URLs. If a location is present for each tag, the installdox tool # does not have to be run to correct the links. # Note that each tag file must have a unique name # (where the name does NOT include the path) # If a tag file is not located in the directory in which doxygen # is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base # or super classes. Setting the tag to NO turns the diagrams off. Note that # this option is superseded by the HAVE_DOT option below. This is only a # fallback. It is recommended to install and use dot, since it yields more # powerful graphs. CLASS_DIAGRAMS = YES # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see # http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the # documentation. The MSCGEN_PATH tag allows you to specify the directory where # the mscgen tool resides. If left empty the tool is assumed to be found in the # default search path. MSCGEN_PATH = # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = YES # By default doxygen will write a font called FreeSans.ttf to the output # directory and reference it in all dot files that doxygen generates. This # font does not include all possible unicode characters however, so when you need # these (or just want a differently looking font) you can specify the font name # using DOT_FONTNAME. You need need to make sure dot is able to find the font, # which can be done by putting it in a standard location or by setting the # DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory # containing the font. DOT_FONTNAME = FreeSans # The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. # The default size is 10pt. DOT_FONTSIZE = 10 # By default doxygen will tell dot to use the output directory to look for the # FreeSans.ttf font (which doxygen will put there itself). If you specify a # different font using DOT_FONTNAME you can set the path where dot # can find it using this tag. DOT_FONTPATH = # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = YES # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = YES # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the CALL_GRAPH and HAVE_DOT options are set to YES then # doxygen will generate a call dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable call graphs # for selected functions only using the \callgraph command. CALL_GRAPH = NO # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then # doxygen will generate a caller dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable caller # graphs for selected functions only using the \callergraph command. CALLER_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found in the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = YES # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES sudoku-0.3.5/HISTORY000066400000000000000000000072301135634645700141350ustar00rootroot00000000000000VDR plug-in 'Sudoku' Revision History ------------------------------------- 2005-10-28: Version 0.1.0 - Initial revision. 2005-11-04: Version 0.1.1 - Fixed compiler warnings with gcc-4.0 (thanks to Ville Skyttä for reporting this). - Added Finnish language texts (thanks to Ville Skyttä). - Added setup option whether or not all cells are unmarked when the puzzle is reset. 2006-04-25: Version 0.1.2 - Removed compatibility to VDR < 1.3.47. - Added support for APIVERSION define in Makefile. - Added placeholders for Czech language texts - hoping for real language texts. 2007-02-23: Version 0.1.3 - Added Spanish language texts (thanks to Bittor Corl). 2008-03-22: Version 0.2.0 - Added gettext support (VDR >= 1.5.7). - Fixed compiler warnings with gcc-4.1.2. - Updated FSF address in the license information. - Improved copyright and license information in the header of all source files. - Fixed (un)marking the cell on the bottom right. - Show possible numbers as pattern. - Show possible numbers as digits (VDR >= 1.5.4). - Paint numbers with a larger font (VDR >= 1.5.4). - Changed the background color of marked cells to darkgreen. - Added commands menu. - Added commands to load and save puzzles from/to the sudoku-list file. - Added setup to commands menu. - Fixed height of info window for spanish text. - Updated German language texts. - Added Italian language texts (thanks to Diego Pierotto). - Margined output of text into the info window. 2008-04-06: Version 0.2.1 - Fixed crash after exit command (thanks to Ville Skyttä for reporting this). - Updated Finnish language texts (thanks to Ville Skyttä). - Updated Italian language texts (thanks to Diego Pierotto). - Set default values for "Show possible numbers as pattern/digits" to No, because of problems with DXR3 (thanks to Ville Skyttä for reporting this). 2008-07-27: Version 0.3.0 - Added history function. - Added setup options to configure red, green and yellow key. - Changed default commands for red, green and yellow key: mark, undo and redo. - Added setup options to configure fonts (VDR >= 1.5.4). - Updated German language texts. - Added French language texts (thanks to Patrice Staudt). 2008-08-30: Version 0.3.1 - Corrected English language texts: Great font/digits -> Large font/digits (thanks to Ville Skyttä for reporting this). - Updated Finnish language texts (thanks to Ville Skyttä). - Updated Italian language texts (thanks to Diego Pierotto). 2008-09-28: Version 0.3.2 - Updated French language texts (thanks to NIVAL Michaël). 2008-11-23: Version 0.3.3 - Delete puzzles from the sudoku-list file with confirmation. - Added version option to sudoku_generator. - Added manual page for sudoku_generator. - Updated German language texts. 2008-11-29: Version 0.3.4 - Fixed solve and print mode of sudoku_generator (don't work if the dump begins with a digit - thanks to Ville Skyttä for reporting this). - Updated Finnish language texts (thanks to Ville Skyttä). - Updated French language texts (thanks to NIVAL Michaël). - Updated Italian language texts (thanks to Diego Pierotto). - Updated Spanish language texts (thanks to Bittor Corl). 2010-04-05: Version 0.3.5 - Moved to http://projects.vdr-developer.org/projects/show/plg-sudoku. - Changed repository from subversion to git. - Removed subversion keywords ($Id). - Added support for VDR >= 1.7.13 (Make.global). - Added method Pos::interacts_with. - Removed compatibility to VDR < 1.6.0. - Converted documentation and source files to UTF-8. - Added unit tests. - Fixed segfault in History::current. - Fixed null pointer handling in History::add. - Updated url and email of the VDR project to tvdr.de. - Updated Doxyfile to doxygen version 1.6.3. sudoku-0.3.5/Makefile000066400000000000000000000071361135634645700145160ustar00rootroot00000000000000# # Sudoku: A plug-in for the Video Disk Recorder # # Copyright (C) 2005-2010, Thomas Günther # # 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; either version 2 of the License, or # (at your option) any later version. # # 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-1301 USA. # The official name of this plugin. # This name will be used in the '-P...' option of VDR to load the plugin. # By default the main source file also carries this name. # IMPORTANT: the presence of this macro is important for the Make.config # file. So it must be defined, even if it is not used here! # PLUGIN = sudoku ### The version number of this plugin (taken from the main source file): VERSION = $(shell sed -ne '/static .* VERSION *=/s/^.*"\(.*\)".*$$/\1/p' \ $(PLUGIN).cpp) ### The C++ compiler and options: CXX ?= g++ CXXFLAGS ?= -fPIC -g -O2 -Wall -Woverloaded-virtual ### The directory environment: VDRDIR = ../../.. LIBDIR = ../../lib TMPDIR = /tmp ### Make sure that necessary options are included: -include $(VDRDIR)/Make.global ### Allow user defined options to overwrite defaults: -include $(VDRDIR)/Make.config ### The version number of VDR's plugin API (taken from VDR's "config.h"): APIVERSION = $(shell sed -ne '/define APIVERSION/s/^.*"\(.*\)".*$$/\1/p' \ $(VDRDIR)/config.h) ### The name of the distribution archive: ARCHIVE = $(PLUGIN)-$(VERSION) PACKAGE = vdr-$(ARCHIVE) ### Includes and Defines (add further entries here): INCLUDES += -I$(VDRDIR)/include DEFINES += -D_GNU_SOURCE -DPLUGIN_NAME_I18N='"$(PLUGIN)"' CXXFLAGS += $(INCLUDES) $(DEFINES) ### The source and object files SRCS = $(wildcard *.cpp) OBJS = $(SRCS:%.cpp=%.o) ### The main target: all: libvdr-$(PLUGIN).so i18n @cd tools && $(MAKE) ### Dependencies: DEPFILE = .dependencies $(DEPFILE): Makefile @$(CXX) -MM -MG $(SRCS) > $@ -include $(DEPFILE) ### Internationalization (I18N): PODIR = po LOCALEDIR = $(VDRDIR)/locale I18Npo = $(notdir $(wildcard $(PODIR)/*.po)) I18Npot = $(PODIR)/$(PLUGIN).pot $(I18Npot): $(SRCS) xgettext -C -cTRANSLATORS --no-wrap --no-location -k -ktr -ktrNOOP \ --msgid-bugs-address='' -o $@ $^ %.po: $(I18Npot) msgmerge -U --no-wrap --no-location --backup=none -q $@ $< @touch $@ $(LOCALEDIR)/%/LC_MESSAGES/vdr-$(PLUGIN).mo: $(PODIR)/%.po @mkdir -p $(dir $@) msgfmt -c -o $@ $< .PHONY: i18n i18n: $(I18Npo:%.po=$(LOCALEDIR)/%/LC_MESSAGES/vdr-$(PLUGIN).mo) ### Targets: libvdr-$(PLUGIN).so: $(OBJS) $(CXX) $(CXXFLAGS) -shared $^ -o $@ @cp --remove-destination $@ $(LIBDIR)/$@.$(APIVERSION) .PHONY: tests tests: @cd $@ && $(MAKE) dist: clean @-rm -rf $(TMPDIR)/$(ARCHIVE) @mkdir $(TMPDIR)/$(ARCHIVE) @cp -a * $(TMPDIR)/$(ARCHIVE) @tar czf $(PACKAGE).tgz -C $(TMPDIR) --exclude debian $(ARCHIVE) @-rm -rf $(TMPDIR)/$(ARCHIVE) @echo Distribution package created as $(PACKAGE).tgz srcdoc: Doxyfile $(OBJS:%.o=%.cpp) $(OBJS:%.o=%.h) VERSION=$(VERSION) /usr/bin/doxygen clean: @-rm -f $(DEPFILE) *.o *.so $(I18Npot) *.tgz core* *~ @-rm -rf srcdoc @cd tools && $(MAKE) clean @cd tests && $(MAKE) clean sudoku-0.3.5/README000066400000000000000000000200421135634645700137250ustar00rootroot00000000000000Sudoku: A plug-in for the Video Disk Recorder --------------------------------------------- Copyright (C) 2005-2010, Thomas Günther Project's homepage: http://toms-cafe.de/vdr/sudoku 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; either version 2 of the License, or (at your option) any later version. 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-1301 USA. See the file COPYING for the full license information. Requirements: ------------- - VDR >= 1.6.0 http://tvdr.de/ - (optionally) CxxTest for unit tests (tested with version 3.10.1) http://cxxtest.tigris.org/ On Debian systems you could download the RPM file and install it with alien. - (optionally) Doxygen for source documentation (tested with version 1.6.3) http://doxygen.org/ - (optionally) Graphviz for doxygen graphs (tested with version 2.26.3) http://www.graphviz.org/ Description: ------------ 'Sudoku' is a VDR plug-in to generate and solve Number Place puzzles, so called Sudokus. A Sudoku puzzle consists of 9 x 9 cells subdivided into 9 regions with 3 x 3 cells. The rules are simple. There have to be the numbers from 1 to 9 in every row, column and region. In the beginning some numbers are given. These cells are painted with cyan background color. The aim of the puzzle is to find the missing numbers. There is only one solution of a Sudoku puzzle. The Sudoku puzzles are generated on-the-fly. The number of givens can be set in the plug-in's setup page down to a minimum of 26 givens. The generation of puzzles with less than 26 givens takes too long. By default the cells with givens are symmetrically ordered. But this can be disabled in the setup. To solve difficult Sudoku puzzles some hints can be used. Incorrect cells are red and cells with ambiguous numbers are magenta. These hints can be disabled in the setup. For further hints see the commands menu, which is opened with the blue key. Each time the plug-in is started from the main menu the same puzzle is shown. A new puzzle is only generated on VDR startup or if it has been requested by selecting this command in the commands menu. In the commands menu you can load and save puzzles from/to the sudoku-list file. This file is located at the plugins folder inside the configuration folder of VDR. If you don't specify a configuration folder, your videodir is used (e.g. /video0/plugins/sudoku/sudoku-list). The sudoku-list file contains lines with a sudoku dump and an optional description. The sudoku dump has to begin at the first position of the line. The delimiter between sudoku dump and description is a space. All behind the first space is considered as description. A sudoku dump consists of up to three parts. The first part contains only the givens, the second part all numbers set so far (including the givens), and the third part the marked cells. They are delimited from each other by a colon. All except of the first part is optional. The parts are strings with 81 digits or underlines. An underline is considered as a zero. All other characters, except of colons and spaces, which terminate the string, are ignored. They could be used to structure the dump, e.g. plus signs after each 9 digits/underlines. Setup: ------ - Givens count Givens count of the generated puzzles. Values: 26-81. Default: 36. - Symmetric givens Cells with givens are symmetrically ordered. Values: yes/no. Default: yes. - Mark errors Incorrect cells are marked with red color. Values: yes/no. Default: yes. - Mark ambiguous numbers Cells with ambiguous numbers are marked with magenta color. Values: yes/no. Default: yes. - Show possible numbers as pattern Show a pattern in all empty cells representing the possible numbers. The pattern is structured by a small 3 x 3 grid featuring the numbers from 1 to 9 from top left to bottom right. If a number is possible in this cell the background of the corresponding grid section is colored. Values: yes/no. Default: no. - Show possible numbers as digits Show digits in all empty cells representing the possible numbers. Values: yes/no. Default: no. - Clear marks on reset Unmark all cells when the puzzle is reset. Values: yes/no. Default: no. - Key Red Choose command for the red key. Values: see commands menu. Default: Mark/unmark. - Key Green Choose command for the green key. Values: see commands menu. Default: Undo last action. - Key Yellow Choose command for the yellow key. Values: see commands menu. Default: Redo last action. - Large font Choose font for the large digits. Values: all installed fonts. Default: Sans Serif:Bold. - Large font height (pixel) Font height for the large digits. Values: 10-64. Default: 31. - Large font width (pixel) Font width for the large digits. Values: 10-64. Default: 42. - Small font Choose font for the small digits. Values: all installed fonts. Default: Sans Serif:Bold. - Small font height (pixel) Font height for the small digits. Values: 10-64. Default: 10. - Small font width (pixel) Font width for the small digits. Values: 10-64. Default: 14. - Transparency (%) Set the transparency of the menu. Values: 0-100. Default: 50. Keys: ----- - Left/Right/Up/Down Move the cursor in the puzzle. - 1-9 Set the number in the current cell. - 0 Remove the number from the current cell. - Red Execute red key command. - Green Execute green key command. - Yellow Execute yellow key command. - Blue Open the commands menu. - Back Quit the plug-in. Commands menu: -------------- - Generate a new puzzle Generate a random puzzle. - Load a puzzle Load a puzzle from the sudoku list. In the list menu you can also delete sudokus from the list or edit the descriptions. - Save the puzzle Add the puzzle to the sudoku list, together with an optional description. - Undo last action Go one step backward in the history. - Redo last action Go one step forward in the history. - Mark/unmark Mark/unmark the current cell. - Next cell Move the cursor to the next free cell with minimal possible numbers. - Next number Set the next possible number for the current cell - reset the number if greater numbers are not possible. - Reset the puzzle Reset the numbers in all cells, excluding the givens. - Open setup menu Open the setup menu of the plug-in. - Exit Quit the plug-in. Cell colors: ------------ - Cyan Givens - Green Marked cells - Red Incorrect cells - Magenta Ambiguous numbers sudoku-0.3.5/backtrack.cpp000066400000000000000000000076761135634645700155200ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2007, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "backtrack.h" using namespace BackTrack; //--- class BackTrack::Algorithm ----------------------------------------------- /** Constructor * * Constructs an backtracking algorithm to solve a problem. The problem is * implemented in 'solution' which represents a path through the decision * tree from the root to one leaf. */ Algorithm::Algorithm (Solution& solution, unsigned int max_iter) : solution(solution), max_iter(max_iter) { first = true; valid = false; level = -1; iter = 0; } /** Find the next valid solution to the problem. * * Repeated calls will find all solutions to a problem if multiple solutions * exist. */ void Algorithm::find_next_solution() { valid = find_solution(); } /** Is the current solution a valid solution? */ bool Algorithm::solution_is_valid() { return valid; } /** Reset the decision tree, i.e. the next call to 'find_solution' finds * the first valid solution. */ void Algorithm::reset() { while (level >= 0) { solution.reset_at(level); --level; } first = true; } /** Create the next leaf on the end of the solution. */ void Algorithm::create_left_leaf() { ++level; solution.set_first_at(level); } /** Backtrack through the decision tree until a node was found that hasn't * been visited, return true if an unvisited node was found. */ bool Algorithm::visit_new_node() { // If the current node is the rightmost child we must backtrack // one level because there are no more children at this level. // So we back up until we find a non-rightmost child, then // generate the child to the right. If we back up to the top // without finding an unvisted child, then all nodes have been // generated. while (level >= 0 && solution.is_last_at(level)) { solution.reset_at(level); --level; } if (level < 0) return false; solution.set_next_at(level); return true; } /** Find the next valid sibling of the last leaf, return true if a valid * sibling was found. */ bool Algorithm::find_valid_sibling() { // If the current node is not valid pass through all siblings until either // a valid sibling is found or the last sibling is reached. for (;;) { ++iter; if (max_iter != 0 && iter > max_iter) return false; if (solution.is_valid_at(level)) return true; if (solution.is_last_at(level)) return false; solution.set_next_at(level); } } /** Find the next valid solution to the problem, return true if a solution * was found. */ bool Algorithm::find_solution() { // If first time, need to create a root. if (first) { first = false; level = -1; if (solution.is_last_level(level)) return solution.is_valid_at(level); create_left_leaf(); } // Otherwise visit new node since solution contains the last solution. else if (!visit_new_node()) return false; for (;;) { if (find_valid_sibling()) { if (solution.is_last_level(level)) return true; create_left_leaf(); } else if (max_iter != 0 && iter > max_iter) return false; else if (!visit_new_node()) return false; // The tree has been exhausted, so no solution exists. } } sudoku-0.3.5/backtrack.h000066400000000000000000000131041135634645700151440ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2007, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_BACKTRACK_H #define VDR_SUDOKU_BACKTRACK_H #include "sudoku.h" /** Generic backtracking algorithm * * Inspired by an article by Roger Labbe "Solving Combinatorial Problems with * STL and Backtracking" in C/C++-Users Journal, February 2000, pp. 56-64. * * The solution to a combinatorial problem can be described as a sequence of * decisions. The backtracking algorithm traverses the decision tree * depth-first. Each solution of the problem is a path through the tree from the * root to one leaf. The algorithm traverses the tree by changing the elements * of the solution. An element passes through all siblings on a certain level, * i.e. through all possible decisions. Each step is checked if it makes the * solution invalid, in which case the traversal of the whole branch is * cancelled. Otherwise the algorithm either goes one level deeper or if this is * the last level it has found one valid solution. After the last sibling on a * level has been processed the algorithm goes back one level. Finally all valid * solutions have been found if it comes back to the root node. * * This implementation of the backtracking algorithm consists of two classes. * The Algorithm class contains the generic backtracking algorithm itself. The * Solution class is the virtual base class for all specific solution classes. * To solve a certain problem the specific solution class has to inherit from * Solution implementing all virtual methods. * * Example: * * \code * class ColorStatesList : public Solution * { * int clist[NUMBER_STATES]; * void set_first_at(unsigned int level) { clist[level] = 0; } * void set_next_at(unsigned int level) { ++clist[level]; } * void reset_at(unsigned int level) {} * bool is_last_at(unsigned int level) { return clist[level] >= LAST_COLOR; } * bool is_valid_at(int level) { return check_all_neighbors_until(level); } * bool is_last_level(int level) [ return level >= NUMBER_STATES-1; } * ... * }; * * void find_all_solutions() * { * ColorStatesList color_states_list(...); * Algorithm algorithm(color_states_list); * algorithm.find_next_solution(); * while (algorithm.solution_is_valid()) * { * // Do something with the solution. * ... * algorithm.find_next_solution(); * } * } * \endcode */ namespace BackTrack { //--- virtual base class BackTrack::Solution --------------------------------- /** Virtual base class of solutions for the backtracking algorithm */ class Solution { public: /** Destructor */ virtual ~Solution() {}; /** Set the element to the first sibling. */ virtual void set_first_at(unsigned int level) = 0; /** Set the element to the next sibling. */ virtual void set_next_at(unsigned int level) = 0; /** Reset the element. */ virtual void reset_at(unsigned int level) = 0; /** Check if the element is set to the last sibling. */ virtual bool is_last_at(unsigned int level) const = 0; /** Check if the element is valid (following elements ignored). */ virtual bool is_valid_at(int level) const = 0; /** Check if the level is the last possible level. */ virtual bool is_last_level(int level) const = 0; }; //--- class BackTrack::Algorithm --------------------------------------------- /** Implementation of a generic backtracking algorithm */ class Algorithm { Solution& solution; bool first; bool valid; int level; unsigned int max_iter, iter; public: /** Constructor * * Constructs an backtracking algorithm to solve a problem. The problem is * implemented in 'solution' which represents a path through the decision * tree from the root to one leaf. */ Algorithm(Solution& solution, unsigned int max_iter = 0); /** Find the next valid solution to the problem. * * Repeated calls will find all solutions to a problem if multiple solutions * exist. */ void find_next_solution(); /** Is the current solution a valid solution? */ bool solution_is_valid(); /** Reset the decision tree, i.e. the next call to 'find_solution' finds * the first valid solution. */ void reset(); private: /** Create the next leaf on the end of the solution. */ void create_left_leaf(); /** Backtrack through the decision tree until a node was found that hasn't * been visited, return true if an unvisited node was found. */ bool visit_new_node(); /** Find the next valid sibling of the last leaf, return true if a valid * sibling was found. */ bool find_valid_sibling(); /** Find the next valid solution to the problem, return true if a solution * was found. */ bool find_solution(); }; } // namespace BackTrack #endif // VDR_SUDOKU_BACKTRACK_H sudoku-0.3.5/bitmap.cpp000066400000000000000000000046001135634645700150270ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2008, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "bitmap.h" #include #include #include #include using namespace SudokuPlugin; //--- class SudokuPlugin::Bitmap ----------------------------------------------- /** Constructor */ Bitmap::Bitmap(int width, int height) : cBitmap(width, height, 4) { } /** Constructor for a bitmap with frame */ Bitmap::Bitmap(int width, int height, tColor frameColor, tColor backgroundColor) : cBitmap(width, height, 4) { DrawRectangle(0, 0, width - 1, height - 1, backgroundColor); frame(0, 0, width - 1, height - 1, frameColor); } /** Write a text into the bitmap. */ void Bitmap::text(const char* text, bool centered) { DrawRectangle(0, 0, Width() - 1, Height() - 1, clrWhite); frame(0, 0, Width() - 1, Height() - 1, clrRed); const cFont* font = cFont::GetFont(fontOsd); cTextWrapper wrapper(text, font, Width() - 10); int y = max((Height() - wrapper.Lines() * font->Height()) / 2, 0); for (int l = 0; l < wrapper.Lines(); ++l, y += font->Height()) { int x = 0; if (centered) x = max((Width() - font->Width(wrapper.GetLine(l))) / 2, 0); DrawText(x, y, wrapper.GetLine(l), clrBlack, clrWhite, font); } } /** Draw a frame into the bitmap. */ void Bitmap::frame(int x1, int y1, int x2, int y2, tColor frameColor) { DrawRectangle(x1, y1, x2, y1 + 1, frameColor); DrawRectangle(x1, y1, x1 + 1, y2, frameColor); DrawRectangle(x1, y2 - 1, x2, y2, frameColor); DrawRectangle(x2 - 1, y1, x2, y2, frameColor); } sudoku-0.3.5/bitmap.h000066400000000000000000000031671135634645700145030ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2007, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_BITMAP_H #define VDR_SUDOKU_BITMAP_H #include "sudoku.h" #include #include #include namespace SudokuPlugin { //--- class SudokuPlugin::Bitmap --------------------------------------------- /** Plugin-specific version of the bitmap class */ class Bitmap : public cBitmap { public: /** Constructor */ Bitmap(int width, int height); /** Constructor for a bitmap with frame */ Bitmap(int width, int height, tColor frameColor, tColor backgroundColor); /** Write a text into the bitmap. */ void text(const char* text, bool centered = true); /** Draw a frame into the bitmap. */ void frame(int x1, int y1, int x2, int y2, tColor frameColor); }; } // namespace SudokuPlugin #endif // VDR_SUDOKU_BITMAP_H sudoku-0.3.5/commands.cpp000066400000000000000000000121361135634645700153570ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2008-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "commands.h" #include "menu.h" #include #include #include #include #include namespace SudokuPlugin { /** Command ids */ enum { Cmd_LowerEdge = 100, CmdGenerate, CmdReset, CmdExit, CmdMark, CmdNextCell, CmdNextNumber, CmdLoad, CmdSave, CmdSetup, CmdUndo, CmdRedo, // Add new command ids only here, don't remove commands. Cmd_UpperEdge, Cmd_Count = Cmd_UpperEdge-Cmd_LowerEdge-1, // Default commands Cmd_KeyRedDefault = CmdMark, Cmd_KeyGreenDefault = CmdUndo, Cmd_KeyYellowDefault = CmdRedo }; } // namespace SudokuPlugin using namespace SudokuPlugin; //--- class SudokuPlugin::CommandList ------------------------------------------ /** List of commands - sorted for the commands menu */ const struct CommandList::List CommandList::list[] = { { CmdGenerate, trNOOP("Generate a new puzzle"), &Menu::generate }, { CmdLoad, trNOOP("Load a puzzle"), &Menu::load }, { CmdSave, trNOOP("Save the puzzle"), &Menu::save }, { CmdUndo, trNOOP("Undo last action"), &Menu::undo }, { CmdRedo, trNOOP("Redo last action"), &Menu::redo }, { CmdMark, trNOOP("Mark/unmark"), &Menu::toggle_mark }, { CmdNextCell, trNOOP("Next cell"), &Menu::next_cell }, { CmdNextNumber, trNOOP("Next number"), &Menu::next_number }, { CmdReset, trNOOP("Reset the puzzle"), &Menu::reset }, { CmdSetup, trNOOP("Open setup menu"), &Menu::open_setup }, { CmdExit, trNOOP("Exit"), &Menu::exit } }; /** Command id of a command */ int CommandList::id(int index) { assert(index >= 0 && index < count()); return list[index].id; } /** Translated text of a command */ const char* CommandList::text(int index) { assert(index >= 0 && index < count()); return tr(list[index].text); } /** Command type of a command */ CommandType CommandList::command(int index) { assert(index >= 0 && index < count()); return list[index].cmd; } /** Count of commands */ int CommandList::count() { assert(Cmd_Count == sizeof(list)/sizeof(*list)); return Cmd_Count; } /** List with translated texts of all commands */ const char* const* CommandList::texts() { static const char* text_list[Cmd_Count]; for (int idx = 0; idx < count(); ++idx) text_list[idx] = tr(list[idx].text); return text_list; } /** Search a command id. Return default index if not found. */ int CommandList::id_to_index(int id, int default_index) { int idx = 0; for (; idx < count(); ++idx) if (list[idx].id == id) break; if (idx >= count()) idx = default_index; assert(idx >= 0 && idx < count()); return idx; } /** Default index for the red key */ int CommandList::key_red_default_index() { return id_to_index(Cmd_KeyRedDefault); } /** Default index for the green key */ int CommandList::key_green_default_index() { return id_to_index(Cmd_KeyGreenDefault); } /** Default index for the yellow key */ int CommandList::key_yellow_default_index() { return id_to_index(Cmd_KeyYellowDefault); } //--- class SudokuPlugin::CommandMenu ------------------------------------------ /** Constructor */ CommandMenu::CommandMenu() : cOsdMenu(trVDR("Commands")) { SetHasHotkeys(); for (int idx = 0; idx < CommandList::count(); ++idx) Add(new Command(hk(CommandList::text(idx)), CommandList::command(idx))); command = NULL; } /** Get the selected menu command. */ CommandType CommandMenu::get_selected_command() const { return command; } /** Process user events. */ eOSState CommandMenu::ProcessKey(eKeys key) { eOSState state = cOsdMenu::ProcessKey(key); if (state == osUnknown) { state = osContinue; if (key == kOk) { Command* item = (Command*)Get(Current()); if (item) command = item->get_command(); state = osBack; } } return state; } //--- class SudokuPlugin::Command ---------------------------------------------- /** Constructor */ Command::Command(const char* text, CommandType command) : cOsdItem(text), command(command) { assert(text != NULL); assert(command != NULL); } /** Get the menu command. */ CommandType Command::get_command() const { return command; } sudoku-0.3.5/commands.h000066400000000000000000000056221135634645700150260ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2008, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_COMMANDS_H #define VDR_SUDOKU_COMMANDS_H #include "sudoku.h" #include namespace SudokuPlugin { class Menu; /** Type of menu commands: pointer to member function of class Menu */ typedef eOSState (Menu::*CommandType)(); //--- class SudokuPlugin::CommandList ---------------------------------------- class CommandList { /** List of commands - sorted for the commands menu */ struct List { int id; const char* text; CommandType cmd; }; static const struct List list[]; public: /** Command id of a command */ static int id(int index); /** Translated text of a command */ static const char* text(int index); /** Command type of a command */ static CommandType command(int index); /** Count of commands */ static int count(); /** List with translated texts of all commands */ static const char* const* texts(); /** Search a command id. Return default index if not found. */ static int id_to_index(int id, int default_index = -1); /** Default index for the red key */ static int key_red_default_index(); /** Default index for the green key */ static int key_green_default_index(); /** Default index for the yellow key */ static int key_yellow_default_index(); }; //--- class SudokuPlugin::CommandMenu ---------------------------------------- /** Commands menu of the plugin */ class CommandMenu : public cOsdMenu { CommandType command; public: /** Constructor */ CommandMenu(); /** Get the selected menu command. */ CommandType get_selected_command() const; /** Process user events. */ virtual eOSState ProcessKey(eKeys key); }; //--- class SudokuPlugin::Command -------------------------------------------- /** Item in commands menu */ class Command : public cOsdItem { CommandType command; public: /** Constructor */ Command(const char* text, CommandType command); /** Get the menu command. */ CommandType get_command() const; }; } // namespace SudokuPlugin #endif // VDR_SUDOKU_COMMANDS_H sudoku-0.3.5/generator.cpp000066400000000000000000000075201135634645700155450ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2007, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #define USE_RAND #include "generator.h" #include "solver.h" #include "backtrack.h" #include "puzzle.h" #include using namespace Sudoku; using namespace BackTrack; //--- class Sudoku::Generator -------------------------------------------------- /** Constructor */ Generator::Generator(Puzzle& puzzle, unsigned int givens_count, bool symmetric, unsigned int max_iter) : Algorithm(*this, max_iter), puzzle(puzzle), symmetric(symmetric) { assert(givens_count <= SDIM); // Search a random Sudoku solution. for (bool found = false; !found;) { sudoku.reset(); Solver solver(sudoku, true); solver.find_next_solution(); found = solver.solution_is_valid(); } // If symmetric pos_list contains only the first halve of all positions. pos_count = SDIM; free_count = SDIM - givens_count; free_center = symmetric && pos_count % 2 != 0 && free_count % 2 != 0; if (symmetric) pos_count /= 2, free_count /= 2; // Fill pos_list with positions in random order. bool list[pos_count]; unsigned int p, i, c; for (p = 0; p < pos_count; ++p) list[p] = true; for (i = 0; i < pos_count; ++i) { c = rand(pos_count - i) + 1; for (p = 0; p < pos_count; ++p) if (list[p]) if (--c == 0) break; assert(p < pos_count); list[p] = false; pos_list[i] = p; } } /** Set the element to the first sibling. */ void Generator::set_first_at(unsigned int level) { assert(level < free_count); free_list[level] = 0; } /** Set the element to the next sibling. */ void Generator::set_next_at(unsigned int level) { assert(level < free_count); ++free_list[level]; } /** Reset the element. */ void Generator::reset_at(unsigned int level) { } /** Check if the element is set to the last sibling. */ bool Generator::is_last_at(unsigned int level) const { assert(level < free_count); return free_list[level] >= pos_count - 1; } /** Check if the element is valid (following elements ignored). */ bool Generator::is_valid_at(int level) const { assert(level < int(free_count)); // free_list contains ordered indices to pos_list. if (level > 0 && free_list[level] <= free_list[level - 1]) return false; if (level >= 0 && free_list[level] > pos_count - (free_count - level)) return false; // Fill list with marks for givens. bool given_marks[SDIM]; int i; for (i = 0; i < SDIM; ++i) given_marks[i] = true; for (i = 0; i <= level; ++i) { Pos p = pos_list[free_list[i]]; given_marks[p] = false; if (symmetric) given_marks[p.symmetric()] = false; } if (free_center) given_marks[Pos::center()] = false; // Set givens in puzzle and check if it has only one solution. puzzle.set_givens(sudoku, given_marks); Solver solver(puzzle); solver.find_next_solution(); assert(solver.solution_is_valid()); solver.find_next_solution(); return !solver.solution_is_valid(); } /** Check if the level is the last possible level. */ bool Generator::is_last_level(int level) const { return level >= int(free_count) - 1; } sudoku-0.3.5/generator.h000066400000000000000000000053561135634645700152170ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2007, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_GENERATOR_H #define VDR_SUDOKU_GENERATOR_H #include "sudoku.h" #include "backtrack.h" #include "puzzle.h" namespace Sudoku { //--- class Sudoku::Generator ------------------------------------------------ /** Implementation of a backtracking algorithm to generate Sudoku puzzles * * To generate Sudoku puzzles two nested backtracking algorithms are used. * First a random Sudoku solution is searched. Then the algorithm tries to * remove some numbers so that only the requested number of givens remains. * Each puzzle is checked with the nested solver algorithm if there is only * one solution. * * Example: * * \code * Puzzle puzzle; * Generator generator(puzzle, 36); * generator.find_next_solution(); * bool found = generator.solution_is_valid(); * \endcode */ class Generator : public BackTrack::Algorithm, public BackTrack::Solution { Puzzle& puzzle; Puzzle sudoku; unsigned int free_list[SDIM]; unsigned int free_count; Pos pos_list[SDIM]; unsigned int pos_count; bool symmetric; bool free_center; public: /** Constructor */ Generator(Puzzle& puzzle, unsigned int givens_count, bool symmetric = true, unsigned int max_iter = 0); /** Set the element to the first sibling. */ virtual void set_first_at(unsigned int level); /** Set the element to the next sibling. */ virtual void set_next_at(unsigned int level); /** Reset the element. */ virtual void reset_at(unsigned int level); /** Check if the element is set to the last sibling. */ virtual bool is_last_at(unsigned int level) const; /** Check if the element is valid (following elements ignored). */ virtual bool is_valid_at(int level) const; /** Check if the level is the last possible level. */ virtual bool is_last_level(int level) const; }; } // namespace Sudoku #endif // VDR_SUDOKU_GENERATOR_H sudoku-0.3.5/history.cpp000066400000000000000000000052161135634645700152600ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2008-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "history.h" #include "puzzle.h" using namespace Sudoku; //--- class Sudoku::History ---------------------------------------------------- /** Constructor */ History::History() { executed = 0; } /** Destructor */ History::~History() { reset(); } /** Reset the history. */ void History::reset() { for (unsigned int pos = history.size(); pos > 0; --pos) { // Remove object created outside of History delete history.back(); history.pop_back(); } executed = 0; } /** Current move in the history */ Move* History::current() { if (movesExecuted()) return history[executed - 1]; return 0; } /** Add a new move. */ void History::add(Move* move) { if (move) { for (unsigned int pos = history.size(); pos > executed; --pos) { // Remove object created outside of History delete history.back(); history.pop_back(); } history.push_back(move); ++executed; } } /** Set previous move as current. */ void History::backward() { if (movesExecuted()) --executed; } /** Set next move as current. */ void History::forward() { if (movesToExecute()) ++executed; } /** Are there executed moves in the history? */ bool History::movesExecuted() const { return executed > 0; } /** Are there moves to execute in the history? */ bool History::movesToExecute() const { return executed < history.size(); } //--- class Sudoku::SetMove ---------------------------------------------------- /** Constructor */ SetMove::SetMove(PuzzleGame& puzzle, unsigned int number) : puzzle(puzzle) { pos = puzzle.get_pos(); old_number = puzzle.get(pos); new_number = number; } /** Do the move. */ void SetMove::execute() { puzzle.set(pos, new_number); puzzle.set_pos(pos); } /** Undo the move. */ void SetMove::takeBack() { puzzle.set(pos, old_number); puzzle.set_pos(pos); } sudoku-0.3.5/history.h000066400000000000000000000046711135634645700147310ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2008-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_HISTORY_H #define VDR_SUDOKU_HISTORY_H #include "sudoku.h" namespace Sudoku { class PuzzleGame; class Pos; class Move; typedef Vector Moves; //--- class Sudoku::History -------------------------------------------------- class History { private: Moves history; unsigned int executed; public: /** Constructor */ History(); /** Destructor */ ~History(); /** Reset the history. */ void reset(); /** Current move in the history */ Move* current(); /** Add a new move. */ void add(Move* move); /** Set previous move as current. */ void backward(); /** Set next move as current. */ void forward(); /** Are there executed moves in the history? */ bool movesExecuted() const; /** Are there moves to execute in the history? */ bool movesToExecute() const; }; //--- class Sudoku::Move ----------------------------------------------------- class Move { public: /** Destructor */ virtual ~Move() {}; /** Do the move. */ virtual void execute() = 0; /** Undo the move. */ virtual void takeBack() = 0; }; //--- class Sudoku::SetMove -------------------------------------------------- class SetMove : public Move { private: PuzzleGame& puzzle; unsigned int pos; unsigned int old_number; unsigned int new_number; public: /** Constructor */ SetMove(PuzzleGame& puzzle, unsigned int number); /** Do the move. */ void execute(); /** Undo the move. */ void takeBack(); }; } // namespace Sudoku #endif // VDR_SUDOKU_HISTORY_H sudoku-0.3.5/list.cpp000066400000000000000000000117611135634645700145340ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2008-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "list.h" #include #include #include #include #include #include #include using namespace SudokuPlugin; //--- class SudokuPlugin::ListLine --------------------------------------------- /** Default constructor for cConfig */ ListLine::ListLine() { } /** Constructor */ ListLine::ListLine(const char* sudoku, const char* description) : sudoku(sudoku), description(description) { assert(sudoku != NULL); assert(description != NULL); } /** Get the sudoku dump. */ const char* ListLine::get_sudoku() const { assert((const char*)sudoku != NULL); return sudoku; } /** Get the description. */ const char* ListLine::get_description() const { assert((const char*)description != NULL); return description; } /** Set the description. */ void ListLine::set_description(const char* new_description) { assert(new_description != NULL); description = skipspace(new_description); } /** Parse a line of the sudoku list. */ bool ListLine::Parse(const char* line) { const char *delim = strchr(line, ' '); if (delim) { sudoku = cString(strndup(line, delim - line), true); description = skipspace(delim); } else { sudoku = line; description = ""; } assert((const char*)sudoku != NULL); assert((const char*)description != NULL); return !isempty(sudoku); } /** Save a line of the sudoku list. */ bool ListLine::Save(FILE* file) const { return fprintf(file, "%s %s\n", *sudoku, *description) > 0; } //--- class SudokuPlugin::ListMenu --------------------------------------------- /** Constructor */ ListMenu::ListMenu(const char* filename, const char* new_sudoku) : cOsdMenu(tr("Sudoku list")), selected(-1), save_mode(new_sudoku) { list.Load(filename); if (save_mode) list.Add(new ListLine(new_sudoku)); refresh(); if (save_mode) { SetCurrent(Last()); AddSubMenu(new ListEdit(*list.Get(Current()))); ProcessKey(kRight); // enter edit mode } } /** Get the selected sudoku. */ const char* ListMenu::get_selected_sudoku() const { ListLine* line = list.Get(selected); if (line) return line->get_sudoku(); return NULL; } /** Process user events. */ eOSState ListMenu::ProcessKey(eKeys key) { bool had_submenu = HasSubMenu(); if (key == kBlue && !HasSubMenu()) key = kBack; if (key == kGreen && !HasSubMenu() && !save_mode) key = kOk; eOSState state = cOsdMenu::ProcessKey(key); if (state == osUnknown) { state = osContinue; switch (key) { case kRed: if (Current() >= 0 && Current() < list.Count()) return AddSubMenu(new ListEdit(*list.Get(Current()))); break; case kYellow: if (Current() >= 0 && Current() < list.Count() && Interface->Confirm(tr("Delete the puzzle?"))) list.Del(list.Get(Current())); refresh(); list.Save(); break; case kOk: if (Current() >= 0 && Current() < list.Count() && !save_mode) selected = Current(); state = osBack; break; default: break; } } if (had_submenu && !HasSubMenu()) { refresh(); list.Save(); } return state; } /** Refresh the list menu. */ void ListMenu::refresh() { int current = Current(); Clear(); SetHasHotkeys(); for (ListLine* line = list.First(); line; line = list.Next(line)) Add(new cOsdItem(hk(line->get_description()))); SetCurrent(Get(current)); SetHelp(trVDR("Button$Edit"), save_mode ? NULL : tr("Button$Load"), trVDR("Button$Delete"), tr("Button$Back")); Display(); } //--- class SudokuPlugin::ListEdit --------------------------------------------- /** Constructor */ ListEdit::ListEdit(ListLine& line) : cOsdMenu(tr("Edit sudoku list"), 15), line(line) { strn0cpy(description, line.get_description(), sizeof(description)); Add(new cMenuEditStrItem(tr("Description"), description, sizeof(description))); } /** Process user events. */ eOSState ListEdit::ProcessKey(eKeys key) { eOSState state = cOsdMenu::ProcessKey(key); if (state == osUnknown) { if (key == kOk) { line.set_description(description); state = osBack; } } return state; } sudoku-0.3.5/list.h000066400000000000000000000052601135634645700141760ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2008, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_LIST_H #define VDR_SUDOKU_LIST_H #include "sudoku.h" #include #include namespace SudokuPlugin { //--- class SudokuPlugin::ListLine ------------------------------------------- /** Line in sudoku list */ class ListLine : public cListObject { cString sudoku; cString description; /** Default constructor for cConfig */ ListLine(); friend class cConfig; public: /** Constructor */ ListLine(const char* sudoku, const char* description = ""); /** Get the sudoku dump. */ const char* get_sudoku() const; /** Get the description. */ const char* get_description() const; /** Set the description. */ void set_description(const char* new_description); /** Parse a line of the sudoku list. */ bool Parse(const char* line); /** Save a line of the sudoku list. */ bool Save(FILE* file) const; }; //--- class SudokuPlugin::ListMenu ------------------------------------------- /** Sudoku list menu */ class ListMenu : public cOsdMenu { cConfig list; int selected; bool save_mode; public: /** Constructor */ ListMenu(const char* filename, const char* new_sudoku = NULL); /** Get the selected sudoku. */ const char* get_selected_sudoku() const; /** Process user events. */ virtual eOSState ProcessKey(eKeys key); private: /** Refresh the list menu. */ void refresh(); }; //--- class SudokuPlugin::ListEdit ------------------------------------------- /** Sudoku list edit menu */ class ListEdit : public cOsdMenu { ListLine& line; char description[100]; public: /** Constructor */ ListEdit(ListLine& line); /** Process user events. */ virtual eOSState ProcessKey(eKeys key); }; } // namespace SudokuPlugin #endif // VDR_SUDOKU_LIST_H sudoku-0.3.5/menu.cpp000066400000000000000000000257031135634645700145260ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "menu.h" #include "puzzle.h" #include "setup.h" #include "bitmap.h" #include "commands.h" #include "list.h" #include #include #include #include #include using namespace SudokuPlugin; using namespace Sudoku; // Definition of the file name of the sudoku list #define SUDOKU_LIST "sudoku-list" // Definitions for grid structure #define CELL_SIZE 42 #define CELL_POS(i) ((i) * (CELL_SIZE + 2) + (i)/RDIM * 3 + 5) #define GRID_SIZE (DIM * (CELL_SIZE + 2) + DIM/RDIM * 3 + 5) // Definitions for grid colors #define TRANS(c,t) tColor(((c) & 0x00FFFFFF) | (0xFF * (100-(t))/100)<<24) #define GRID_COLOR clrWhite #define CURSUR_COLOR clrBlue #define NUMBER_FG clrWhite #define NUMBER_BG clrBlack #define ERROR_FG clrWhite #define ERROR_BG clrRed #define AMBIG_FG clrWhite #define AMBIG_BG clrMagenta #define MARKED_FG clrWhite #define MARKED_BG 0x006400 /* darkgreen */ #define GIVEN_FG clrBlack #define GIVEN_BG clrCyan #define POSSIBLE_FG clrBlack #define POSSIBLE_BG(n) (((n) % 2) ? clrYellow : 0xFF8C00 /* darkorange */) //--- class SudokuPlugin::Menu ------------------------------------------------- /** Constructor */ Menu::Menu(cPlugin* plugin, const SetupData& setup, PuzzleGame*& puzzle) : cOsdObject(true), plugin(plugin), setup(setup), puzzle(puzzle) { if (puzzle == NULL) puzzle = new PuzzleGame(setup.givens_count, setup.symmetric); xPos = (720 - GRID_SIZE) / 2; yPos = (576 - GRID_SIZE) / 2; osd = NULL; info = NULL; infoText = NULL; new_puzzle_request = false; maxi_font = cFont::CreateFont(setup.maxi_font, setup.maxi_font_height, setup.maxi_font_width); mini_font = cFont::CreateFont(setup.mini_font, setup.mini_font_height, setup.mini_font_width); command_menu = NULL; list_menu = NULL; setup_menu = NULL; listfile = AddDirectory(plugin->ConfigDirectory(plugin->Name()), SUDOKU_LIST); } /** Destructor */ Menu::~Menu() { delete setup_menu; delete list_menu; delete command_menu; delete maxi_font; delete mini_font; delete info; delete osd; } /** Display the menu on the OSD. */ void Menu::Show() { int x1 = xPos, y1 = yPos; int x2 = xPos + GRID_SIZE - 1, y2 = yPos + GRID_SIZE -1; osd = cOsdProvider::NewOsd(0, 0); if (osd) { tArea area = { x1, y1, x2, y2, 4 }; osd->SetAreas(&area, 1); paint(); } } /** Process user events. */ eOSState Menu::ProcessKey(eKeys key) { if (command_menu) { eOSState state = command_menu->ProcessKey(key); if (state == osBack) { state = osContinue; CommandType command = command_menu->get_selected_command(); DELETENULL(command_menu); if (command) state = (this->*command)(); if (state == osContinue) Show(); if (state == osUnknown) state = osContinue; } return state; } if (list_menu) { eOSState state = list_menu->ProcessKey(key); if (state == osBack) { state = osContinue; const char* sudoku = list_menu->get_selected_sudoku(); if (sudoku) puzzle->load_from_dump(sudoku); DELETENULL(list_menu); Show(); } return state; } if (setup_menu) { eOSState state = setup_menu->ProcessKey(key); if (state == osBack) { state = osContinue; if (key == kOk) Setup.Save(); DELETENULL(setup_menu); DELETENULL(maxi_font); DELETENULL(mini_font); maxi_font = cFont::CreateFont(setup.maxi_font, setup.maxi_font_height, setup.maxi_font_width); mini_font = cFont::CreateFont(setup.mini_font, setup.mini_font_height, setup.mini_font_width); Show(); } return state; } eOSState state = cOsdObject::ProcessKey(key); if (state == osUnknown) { Pos curr = puzzle->get_pos(); CommandType command = NULL; switch (key) { case kLeft: case kLeft|k_Repeat: puzzle->set_pos(curr.prev_col()); break; case kRight: case kRight|k_Repeat: puzzle->set_pos(curr.next_col()); break; case kUp: case kUp|k_Repeat: puzzle->set_pos(curr.prev_row()); break; case kDown: case kDown|k_Repeat: puzzle->set_pos(curr.next_row()); break; case k0: case k1: case k2: case k3: case k4: case k5: case k6: case k7: case k8: case k9: puzzle->set_with_history(key - k0); break; case kRed: command = CommandList::command(setup.key_red); break; case kGreen: command = CommandList::command(setup.key_green); break; case kYellow: command = CommandList::command(setup.key_yellow); break; case kBlue: osd->Flush(); DELETENULL(osd); command_menu = new CommandMenu(); command_menu->Display(); return osContinue; case kOk: if (new_puzzle_request) generate(); break; case kBack: return exit(); default: return osContinue; } if (command) { state = (this->*command)(); if (state == osUnknown) return osContinue; if (state == osEnd) return osEnd; } new_puzzle_request = !new_puzzle_request && puzzle->solved(); if (new_puzzle_request) infoText = tr("Congratulations!\nPress OK to start a new puzzle"); paint(); state = osContinue; } return state; } /** Generate a new puzzle. */ eOSState Menu::generate() { puzzle->generate(setup.givens_count, setup.symmetric); return osContinue; } /** Load a puzzle. */ eOSState Menu::load() { if (osd) osd->Flush(); DELETENULL(osd); list_menu = new ListMenu(listfile); list_menu->Display(); return osUnknown; } /** Save the puzzle. */ eOSState Menu::save() { if (osd) osd->Flush(); DELETENULL(osd); list_menu = new ListMenu(listfile, puzzle->get_dump()); list_menu->Display(); return osUnknown; } /** Undo last action. */ eOSState Menu::undo() { puzzle->backward(); return osContinue; } /** Redo last action. */ eOSState Menu::redo() { puzzle->forward(); return osContinue; } /** Mark/unmark the current cell. */ eOSState Menu::toggle_mark() { puzzle->toggle_mark(puzzle->get_pos()); return osContinue; } /** Move the cursor to the next free cell with minimal possible numbers. */ eOSState Menu::next_cell() { Pos new_pos = puzzle->next_cell(puzzle->get_pos()); if (new_pos <= Pos::last()) puzzle->set_pos(new_pos); return osContinue; } /** Set the next possible number for the current cell. */ eOSState Menu::next_number() { puzzle->set_with_history(puzzle->next_number(puzzle->get_pos())); return osContinue; } /** Reset the puzzle. */ eOSState Menu::reset() { puzzle->reset(setup.clear_marks); return osContinue; } /** Open setup menu. */ eOSState Menu::open_setup() { if (osd) osd->Flush(); DELETENULL(osd); setup_menu = plugin->SetupMenu(); setup_menu->SetPlugin(plugin); setup_menu->Display(); return osUnknown; } /** Exit plugin menu. */ eOSState Menu::exit() { return osEnd; } /** Paint all pieces of the menu. */ void Menu::paint() { int trans = setup.transparency; tColor fg, bg = TRANS(GRID_COLOR, trans); int x1 = xPos, y1 = yPos; int x2 = xPos + GRID_SIZE - 1, y2 = yPos + GRID_SIZE -1; // Save and restore palette to reduce flickering. cPalette savePalette(*osd->GetBitmap(0)); osd->DrawRectangle(x1, y1, x2, y2, bg); osd->SetPalette(savePalette, 0); // Paint all cells. for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) { fg = NUMBER_FG, bg = NUMBER_BG; if (puzzle->given(p)) fg = GIVEN_FG, bg = GIVEN_BG; else if (puzzle->marked(p)) fg = MARKED_FG, bg = MARKED_BG; else if (setup.mark_errors && puzzle->error(p)) fg = ERROR_FG, bg = ERROR_BG; else if (setup.mark_ambiguous && puzzle->ambiguous(p)) fg = AMBIG_FG, bg = AMBIG_BG; fg = TRANS(fg, trans); bg = TRANS(bg, trans); // Paint the background of the cell. x1 = xPos + CELL_POS(p.col()), y1 = yPos + CELL_POS(p.row()); x2 = x1 + CELL_SIZE - 1, y2 = y1 + CELL_SIZE - 1; osd->DrawRectangle(x1, y1, x2, y2, bg); // Paint the content of the cell. if (puzzle->get(p) != 0) { char txt[2] = { '0' + puzzle->get(p), 0 }; osd->DrawText(x1, y1, txt, fg, bg, maxi_font, CELL_SIZE, CELL_SIZE, taCenter); } else if (setup.show_possibles_pattern || setup.show_possibles_digits) { for (unsigned int n = 1; n <= DIM; ++n) { if (puzzle->possible_number(p, n)) { int x3 = x1 + (((n - 1) % RDIM) * CELL_SIZE) / RDIM; int y3 = y1 + (((n - 1) / RDIM) * CELL_SIZE) / RDIM; int x4 = x1 + (((n - 1) % RDIM + 1) * CELL_SIZE) / RDIM - 1; int y4 = y1 + (((n - 1) / RDIM + 1) * CELL_SIZE) / RDIM - 1; if (setup.show_possibles_pattern) { fg = TRANS(POSSIBLE_FG, trans); bg = TRANS(POSSIBLE_BG(n), trans); osd->DrawRectangle(x3, y3, x4, y4, bg); } if (setup.show_possibles_digits) { char txt[2] = { '0' + n, 0 }; osd->DrawText(x3, y3, txt, fg, bg, mini_font, CELL_SIZE / RDIM, CELL_SIZE / RDIM, taCenter); } } } } } // Paint the cursor. Pos curr = puzzle->get_pos(); bg = TRANS(CURSUR_COLOR, trans); x1 = xPos + CELL_POS(curr.col()), y1 = yPos + CELL_POS(curr.row()); x2 = x1 + CELL_SIZE - 1, y2 = y1 + CELL_SIZE - 1; osd->DrawRectangle(x1 - 5, y1 - 5, x2, y1, bg); osd->DrawRectangle(x1 - 5, y1, x1, y2 + 5, bg); osd->DrawRectangle(x1, y2, x2 + 5, y2 + 5, bg); osd->DrawRectangle(x2, y1 - 5, x2 + 5, y2, bg); // Paint info window. if (infoText) { if (!info) info = new Bitmap(GRID_SIZE - 20, 90); info->text(infoText); osd->DrawBitmap(xPos + 10, yPos + 10, *info); infoText = NULL; } osd->Flush(); } sudoku-0.3.5/menu.h000066400000000000000000000054111135634645700141650ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2008, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_MENU_H #define VDR_SUDOKU_MENU_H #include "sudoku.h" namespace Sudoku { class PuzzleGame; } #include #include #include #include #include namespace SudokuPlugin { class SetupData; class Bitmap; class CommandMenu; class ListMenu; class SetupPage; //--- class SudokuPlugin::Menu ----------------------------------------------- /** Main menu of the plugin */ class Menu : public cOsdObject { cPlugin* plugin; const SetupData& setup; Sudoku::PuzzleGame*& puzzle; int xPos, yPos; cOsd* osd; Bitmap* info; const char* infoText; bool new_puzzle_request; const cFont* maxi_font; const cFont* mini_font; CommandMenu* command_menu; ListMenu* list_menu; cMenuSetupPage* setup_menu; cString listfile; public: /** Constructor */ Menu(cPlugin* plugin, const SetupData& setup, Sudoku::PuzzleGame*& puzzle); /** Destructor */ virtual ~Menu(); /** Display the menu on the OSD. */ virtual void Show(); /** Process user events. */ virtual eOSState ProcessKey(eKeys key); /** Generate a new puzzle. */ eOSState generate(); /** Load a puzzle. */ eOSState load(); /** Save the puzzle. */ eOSState save(); /** Undo last action. */ eOSState undo(); /** Redo last action. */ eOSState redo(); /** Mark/unmark the current cell. */ eOSState toggle_mark(); /** Move the cursor to the next free cell with minimal possible numbers. */ eOSState next_cell(); /** Set the next possible number for the current cell. */ eOSState next_number(); /** Reset the puzzle. */ eOSState reset(); /** Open setup menu. */ eOSState open_setup(); /** Exit plugin menu. */ eOSState exit(); private: /** Paint all pieces of the menu. */ void paint(); }; } // namespace SudokuPlugin #endif // VDR_SUDOKU_MENU_H sudoku-0.3.5/po/000077500000000000000000000000001135634645700134655ustar00rootroot00000000000000sudoku-0.3.5/po/de_DE.po000066400000000000000000000053331135634645700147710ustar00rootroot00000000000000# German translations for vdr-sudoku package. # Copyright (C) 2007-2010 Thomas Günther # This file is distributed under the same license as the vdr-sudoku package. # Thomas Günther , 2005, 2008. # msgid "" msgstr "" "Project-Id-Version: vdr-sudoku 0.3.5\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2008-11-21 00:36+0100\n" "PO-Revision-Date: 2008-11-21 00:36+0100\n" "Last-Translator: Thomas Günther \n" "Language-Team: \n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=iso-8859-15\n" "Content-Transfer-Encoding: 8bit\n" msgid "Generate a new puzzle" msgstr "Neues Puzzle erzeugen" msgid "Load a puzzle" msgstr "Puzzle laden" msgid "Save the puzzle" msgstr "Puzzle speichern" msgid "Undo last action" msgstr "Letzte Aktion zurücknehmen" msgid "Redo last action" msgstr "Letzte Aktion wiederholen" msgid "Mark/unmark" msgstr "Markierung setzen/löschen" msgid "Next cell" msgstr "Nächste Zelle" msgid "Next number" msgstr "Nächste Zahl" msgid "Reset the puzzle" msgstr "Puzzle zurücksetzen" msgid "Open setup menu" msgstr "Einstellungsmenü öffnen" msgid "Exit" msgstr "Beenden" msgid "Sudoku list" msgstr "Sudoku-Liste" msgid "Delete the puzzle?" msgstr "Puzzle löschen?" msgid "Button$Load" msgstr "Laden" msgid "Button$Back" msgstr "Zurück" msgid "Edit sudoku list" msgstr "Sudoku-Liste bearbeiten" msgid "Description" msgstr "Beschreibung" msgid "" "Congratulations!\n" "Press OK to start a new puzzle" msgstr "" "Herzlichen Glückwunsch!\n" "OK startet ein neues Puzzle" msgid "Givens count" msgstr "Anzahl vorgegebener Zahlen" msgid "Symmetric givens" msgstr "Vorgegebene Zahlen symmetrisch anordnen" msgid "Mark errors" msgstr "Fehler markieren" msgid "Mark ambiguous numbers" msgstr "Unklare Zahlen markieren" msgid "Show possible numbers as pattern" msgstr "Mögliche Zahlen als Muster anzeigen" msgid "Show possible numbers as digits" msgstr "Mögliche Zahlen als Ziffern anzeigen" msgid "Clear marks on reset" msgstr "Markierungen löschen beim Reset" msgid "Key Red" msgstr "Taste Rot" msgid "Key Green" msgstr "Taste Grün" msgid "Key Yellow" msgstr "Taste Gelb" msgid "Large font" msgstr "Große Schriftart" msgid "Large font height (pixel)" msgstr "Große Schrifthöhe (pixel)" msgid "Large font width (pixel)" msgstr "Große Schriftbreite (pixel)" msgid "Small font" msgstr "Kleine Schriftart" msgid "Small font height (pixel)" msgstr "Kleine Schrifthöhe (pixel)" msgid "Small font width (pixel)" msgstr "Kleine Schriftbreite (pixel)" msgid "Transparency (%)" msgstr "Transparenz (%)" msgid "Sudoku - generate and solve Number Place puzzles" msgstr "Sudoku - Erzeugen und Lösen von Zahlenpuzzles" msgid "Sudoku" msgstr "Sudoku" sudoku-0.3.5/po/es_ES.po000066400000000000000000000053231135634645700150260ustar00rootroot00000000000000# Spanish translations for vdr-sudoku package. # Copyright (C) 2007-2010 Thomas Günther # This file is distributed under the same license as the vdr-sudoku package. # Bittor Corl , 2007, 2008. # msgid "" msgstr "" "Project-Id-Version: vdr-sudoku 0.3.5\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2008-11-21 00:36+0100\n" "PO-Revision-Date: 2008-11-26 18:31+0200\n" "Last-Translator: Bittor Corl \n" "Language-Team: \n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=iso-8859-15\n" "Content-Transfer-Encoding: 8bit\n" msgid "Generate a new puzzle" msgstr "Generar nuevo rompecabezas" msgid "Load a puzzle" msgstr "Cargar un rompecabezas" msgid "Save the puzzle" msgstr "Guardar rompecabezas" msgid "Undo last action" msgstr "Deshacer última acción" msgid "Redo last action" msgstr "Rehacer última acción" msgid "Mark/unmark" msgstr "Marcar/desmarcar" msgid "Next cell" msgstr "Celda siguiente" msgid "Next number" msgstr "Número siguiente" msgid "Reset the puzzle" msgstr "Reiniciar el rompecabezas" msgid "Open setup menu" msgstr "Abrir menú de opciones" msgid "Exit" msgstr "Salir" msgid "Sudoku list" msgstr "Lista Sudoku" msgid "Delete the puzzle?" msgstr "¿Borrar el rompecabezas?" msgid "Button$Load" msgstr "Cargar" msgid "Button$Back" msgstr "Volver" msgid "Edit sudoku list" msgstr "Editar lista Sudoku" msgid "Description" msgstr "Descripción" msgid "" "Congratulations!\n" "Press OK to start a new puzzle" msgstr "" "¡Enhorabuena!\n" "Pulse OK para iniciar un nuevo rompecabezas" msgid "Givens count" msgstr "Celdas rellenadas" msgid "Symmetric givens" msgstr "Números simétricos rellenados" msgid "Mark errors" msgstr "Marcar errores" msgid "Mark ambiguous numbers" msgstr "Marcar números ambiguos" msgid "Show possible numbers as pattern" msgstr "Mostrar posibles núm. como patrón" msgid "Show possible numbers as digits" msgstr "Mostrar posibles núm. como dígitos" msgid "Clear marks on reset" msgstr "Quitar marcas al reiniciar" msgid "Key Red" msgstr "Botón Rojo" msgid "Key Green" msgstr "Botón Verde" msgid "Key Yellow" msgstr "Botón Amarillo" msgid "Large font" msgstr "Fuente grande" msgid "Large font height (pixel)" msgstr "Alto fuente grande (pixel)" msgid "Large font width (pixel)" msgstr "Ancho fuente grande (pixel)" msgid "Small font" msgstr "Fuente pequeña" msgid "Small font height (pixel)" msgstr "Alto fuente pequeña (pixel)" msgid "Small font width (pixel)" msgstr "Ancho fuente pequeña (pixel)" msgid "Transparency (%)" msgstr "Transparencia (%)" msgid "Sudoku - generate and solve Number Place puzzles" msgstr "Solucionar rompecabezas numérico" msgid "Sudoku" msgstr "Sudoku" sudoku-0.3.5/po/fi_FI.po000066400000000000000000000052771135634645700150140ustar00rootroot00000000000000# Finnish translations for vdr-sudoku package. # Copyright (C) 2007-2010 Thomas Günther # This file is distributed under the same license as the vdr-sudoku package. # Ville Skyttä , 2005, 2008. # msgid "" msgstr "" "Project-Id-Version: vdr-sudoku 0.3.5\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2008-11-21 00:36+0100\n" "PO-Revision-Date: 2008-11-24 18:49+0200\n" "Last-Translator: Ville Skyttä \n" "Language-Team: \n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=iso-8859-15\n" "Content-Transfer-Encoding: 8bit\n" msgid "Generate a new puzzle" msgstr "Uusi ristikko" msgid "Load a puzzle" msgstr "Lataa ristikko" msgid "Save the puzzle" msgstr "Tallenna ristikko" msgid "Undo last action" msgstr "Peru viimeisin" msgid "Redo last action" msgstr "Toista viimeisin" msgid "Mark/unmark" msgstr "Merkitse/poista merkintä" msgid "Next cell" msgstr "Seuraava ruutu" msgid "Next number" msgstr "Seuraava numero" msgid "Reset the puzzle" msgstr "Tyhjennä ristikko" msgid "Open setup menu" msgstr "Asetukset" msgid "Exit" msgstr "Poistu" msgid "Sudoku list" msgstr "Tallennetut ristikot" msgid "Delete the puzzle?" msgstr "Poistetaanko ristikko?" msgid "Button$Load" msgstr "Lataa" msgid "Button$Back" msgstr "Takaisin" msgid "Edit sudoku list" msgstr "Ristikon tiedot" msgid "Description" msgstr "Kuvaus" msgid "" "Congratulations!\n" "Press OK to start a new puzzle" msgstr "" "Onnittelut!\n" "Valitse 'OK' aloittaaksesi uuden ristikon" msgid "Givens count" msgstr "Annettujen numeroiden lukumäärä" msgid "Symmetric givens" msgstr "Järjestä annetut symmetrisesti" msgid "Mark errors" msgstr "Merkitse virheet" msgid "Mark ambiguous numbers" msgstr "Merkitse epävarmat" msgid "Show possible numbers as pattern" msgstr "Näytä mahdolliset kuviona" msgid "Show possible numbers as digits" msgstr "Näytä mahdolliset numeroina" msgid "Clear marks on reset" msgstr "Poista merkinnät aloitettaessa" msgid "Key Red" msgstr "Punainen näppäin" msgid "Key Green" msgstr "Vihreä näppäin" msgid "Key Yellow" msgstr "Keltainen näppäin" msgid "Large font" msgstr "Suuri kirjasin" msgid "Large font height (pixel)" msgstr "Suuren kirjasimen korkeus (pikseleitä)" msgid "Large font width (pixel)" msgstr "Suuren kirjasimen leveys (pikseleitä)" msgid "Small font" msgstr "Pieni kirjasin" msgid "Small font height (pixel)" msgstr "Pienen kirjasimen korkeus (pikseleitä)" msgid "Small font width (pixel)" msgstr "Pienen kirjasimen leveys (pikseleitä)" msgid "Transparency (%)" msgstr "Läpinäkyvyys (%)" msgid "Sudoku - generate and solve Number Place puzzles" msgstr "Sudoku-numeroristikot" msgid "Sudoku" msgstr "Sudoku" sudoku-0.3.5/po/fr_FR.po000066400000000000000000000055211135634645700150260ustar00rootroot00000000000000# French translations for vdr-sudoku package. # Copyright (C) 2007-2010 Thomas Günther # This file is distributed under the same license as the vdr-sudoku package. # Patrice Staudt , 2008. # NIVAL Michaël , 2008. # msgid "" msgstr "" "Project-Id-Version: vdr-sudoku 0.3.5\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2008-11-21 00:36+0100\n" "PO-Revision-Date: 2008-11-24 19:06+0100\n" "Last-Translator: NIVAL Michaël \n" "Language-Team: \n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=iso-8859-15\n" "Content-Transfer-Encoding: 8bit\n" msgid "Generate a new puzzle" msgstr "Créer un nouveau puzzle" msgid "Load a puzzle" msgstr "Charger un puzzle" msgid "Save the puzzle" msgstr "Sauvegarder le puzzle" msgid "Undo last action" msgstr "Annuler la dernière action" msgid "Redo last action" msgstr "Répéter la dernière action" msgid "Mark/unmark" msgstr "Marquer/Démarquer" msgid "Next cell" msgstr "Cellule suivante" msgid "Next number" msgstr "Nombre suivant" msgid "Reset the puzzle" msgstr "Remise à zéro du puzzle" msgid "Open setup menu" msgstr "Ouvrir le menu de configuration" msgid "Exit" msgstr "Terminer" msgid "Sudoku list" msgstr "Liste Sudoku" msgid "Delete the puzzle?" msgstr "Supprimer le puzzle ?" msgid "Button$Load" msgstr "Charger" msgid "Button$Back" msgstr "Retour" msgid "Edit sudoku list" msgstr "Editer la liste Sudoku" msgid "Description" msgstr "Description" msgid "" "Congratulations!\n" "Press OK to start a new puzzle" msgstr "" "Félicitation!\n" "Avec OK vous lancez un nouveau puzzle" msgid "Givens count" msgstr "Nombre de chiffre donné" msgid "Symmetric givens" msgstr "Chiffre donné symétrique" msgid "Mark errors" msgstr "Marquer les erreurs" msgid "Mark ambiguous numbers" msgstr "Marquer les chiffres anbigus" msgid "Show possible numbers as pattern" msgstr "Afficher les chiffres possible comme modèle" msgid "Show possible numbers as digits" msgstr "Afficher les chiffres possible comme chiffre" msgid "Clear marks on reset" msgstr "Effacer les marques lors de la mise à zéro" msgid "Key Red" msgstr "Bouton rouge" msgid "Key Green" msgstr "Bouton vert" msgid "Key Yellow" msgstr "Bouton jaune" msgid "Large font" msgstr "Grande police" msgid "Large font height (pixel)" msgstr "Hauteur grande police (pixel)" msgid "Large font width (pixel)" msgstr "Largeur grande police (pixel)" msgid "Small font" msgstr "Petite police" msgid "Small font height (pixel)" msgstr "Hauteur petite police (pixel)" msgid "Small font width (pixel)" msgstr "Largeur petite police (pixel)" msgid "Transparency (%)" msgstr "Transparence (%)" msgid "Sudoku - generate and solve Number Place puzzles" msgstr "Sudoku - créer et résoudre des puzzles de chiffres" msgid "Sudoku" msgstr "Sudoku" sudoku-0.3.5/po/it_IT.po000066400000000000000000000052731135634645700150440ustar00rootroot00000000000000# Italian translations for vdr-sudoku package. # Copyright (C) 2007-2010 Thomas Günther # This file is distributed under the same license as the vdr-sudoku package. # Diego Pierotto , 2007, 2008. # msgid "" msgstr "" "Project-Id-Version: vdr-sudoku 0.3.5\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2008-11-21 00:36+0100\n" "PO-Revision-Date: 2008-11-25 20:47+0100\n" "Last-Translator: Diego Pierotto \n" "Language-Team: \n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=iso-8859-15\n" "Content-Transfer-Encoding: 8bit\n" msgid "Generate a new puzzle" msgstr "Genera nuova partita" msgid "Load a puzzle" msgstr "Carica partita" msgid "Save the puzzle" msgstr "Salva partita" msgid "Undo last action" msgstr "Annulla ultima azione" msgid "Redo last action" msgstr "Ripeti ultima azione" msgid "Mark/unmark" msgstr "Marca/Smarca" msgid "Next cell" msgstr "Cella successiva" msgid "Next number" msgstr "Num. successivo" msgid "Reset the puzzle" msgstr "Ricomincia partita" msgid "Open setup menu" msgstr "Apri menu opzioni" msgid "Exit" msgstr "Esci" msgid "Sudoku list" msgstr "Elenco Sudoku" msgid "Delete the puzzle?" msgstr "Eliminare la partita?" msgid "Button$Load" msgstr "Carica" msgid "Button$Back" msgstr "Indietro" msgid "Edit sudoku list" msgstr "Modifica elenco Sudoku" msgid "Description" msgstr "Descrizione" msgid "" "Congratulations!\n" "Press OK to start a new puzzle" msgstr "" "Complimenti!\n" "Premi OK per iniziare una nuova partita" msgid "Givens count" msgstr "Numero cifre assegnate" msgid "Symmetric givens" msgstr "Cifre simmetriche assegnate" msgid "Mark errors" msgstr "Segna errori" msgid "Mark ambiguous numbers" msgstr "Segna numeri ambigui" msgid "Show possible numbers as pattern" msgstr "Mostra num. possibili in valori" msgid "Show possible numbers as digits" msgstr "Mostra num. possibili in cifre" msgid "Clear marks on reset" msgstr "Pulisci segni al riavvio" msgid "Key Red" msgstr "Tasto Rosso" msgid "Key Green" msgstr "Tasto Verde" msgid "Key Yellow" msgstr "Tasto Giallo" msgid "Large font" msgstr "Caratteri grandi" msgid "Large font height (pixel)" msgstr "Altezza car. grandi (pixel)" msgid "Large font width (pixel)" msgstr "Larghezza car. grandi (pixel)" msgid "Small font" msgstr "Caratteri piccoli" msgid "Small font height (pixel)" msgstr "Altezza car. piccoli (pixel)" msgid "Small font width (pixel)" msgstr "Larghezza car. piccoli (pixel)" msgid "Transparency (%)" msgstr "Trasparenza (%)" msgid "Sudoku - generate and solve Number Place puzzles" msgstr "Sudoku - Genera e risolvi il rompicapo dei numeri" msgid "Sudoku" msgstr "Sudoku" sudoku-0.3.5/puzzle.cpp000066400000000000000000000243761135634645700151200ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "puzzle.h" #include "generator.h" #include "history.h" #include #include using namespace Sudoku; //--- class Sudoku::Numbers ---------------------------------------------------- /** Constructor */ Numbers::Numbers(const char* dump) : numbers_dump() { load_from_dump(dump); assert(!numbers_dump); } /** Destructor */ Numbers::~Numbers() { delete[] numbers_dump; } /** Get the numbers as dump */ const char* Numbers::get_dump() const { if (!numbers_dump) numbers_dump = new char[SDIM + DIM]; assert(numbers_dump); char* dump = numbers_dump; unsigned int n; for (unsigned int row = 0; row < DIM; ++row, *dump++ = '+') for (unsigned int col = 0; col < DIM; ++col, ++dump) *dump = (n = get(Pos(col, row))) ? '0' + n : '_'; *--dump = 0; return numbers_dump; } /** Remove all numbers. */ void Numbers::reset() { for (unsigned int i = 0; i < SDIM; ++i) content[i] = 0; } /** Set numbers from contents of sudoku if marked in marks. */ void Numbers::set_contents(const Numbers& sudoku, const bool marks[SDIM]) { for (unsigned int i = 0; i < SDIM; ++i) if (marks[i]) content[i] = sudoku.get(i); else content[i] = 0; } /** Set the number into this cell. */ void Numbers::set(Pos pos, unsigned int number) { assert(pos <= Pos::last()); assert(0 <= number && number <= DIM); content[pos] = number; } /** Get the number from this cell. */ unsigned int Numbers::get(Pos pos) const { assert(pos <= Pos::last()); assert(0 <= content[pos] && content[pos] <= DIM); return content[pos]; } /** Load numbers from a dump. */ void Numbers::load_from_dump(const char* dump) { reset(); if (dump) for (unsigned int i = 0; *dump && *dump != ':' && i < SDIM; ++i, ++dump) if (*dump == '+') --i; else if (*dump > '0' && *dump - '0' <= DIM) content[i] = *dump - '0'; } //--- class Sudoku::Puzzle ----------------------------------------------------- /** Constructor */ Puzzle::Puzzle(const char* dump) : puzzle_dump() { load_from_dump(dump); assert(!puzzle_dump); } /** Constructor with generation of a random puzzle */ Puzzle::Puzzle(unsigned int givens_count, bool symmetric) : puzzle_dump() { if (givens_count == 0) clear_givens(); else generate(givens_count, symmetric); assert(!puzzle_dump); } /** Destructor */ Puzzle::~Puzzle() { delete[] puzzle_dump; } /** Get the puzzle as dump */ const char* Puzzle::get_dump() const { if (!puzzle_dump) puzzle_dump = new char[3 * (SDIM + DIM)]; assert(puzzle_dump); // Set givens as first part of the dump strcpy(puzzle_dump, givens.get_dump()); if (!untouched()) { // Set numbers as second part of the dump strcat(puzzle_dump, ":"); strcat(puzzle_dump, Numbers::get_dump()); // Set marks as third part of the dump strcat(puzzle_dump, ":"); strcat(puzzle_dump, marks.get_dump()); } return puzzle_dump; } /** Reset the puzzle (including marks). */ void Puzzle::reset() { reset(true); } /** Reset the puzzle (either with or without marks). */ void Puzzle::reset(bool clear_marks) { unsigned int i; // Fill the puzzle with the givens. for (i = 0; i < SDIM; ++i) Numbers::set(i, givens.get(i)); // Compute possible numbers for all cells. for (i = 0; i < SDIM; ++i) compute_numbers(i); // Reset marked cells. if (clear_marks) marks.reset(); } /** Set the number into this cell. */ void Puzzle::set(Pos pos, unsigned int number) { assert(pos <= Pos::last()); assert(0 <= number && number <= DIM); if (!given(pos) && get(pos) != number) { Numbers::set(pos, number); // Refresh possible numbers of all affected cells. for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) if (p.interacts_with(pos)) compute_numbers(p); } } /** Load a puzzle from a dump. */ void Puzzle::load_from_dump(const char* dump) { // Set givens from the first part of the dump (before the first colon) givens.load_from_dump(dump); reset(); // Set numbers from the second part (between the first and the second colon) if (dump) dump = strchr(dump, ':'); if (dump) { Numbers numbers(++dump); for (unsigned int i = 0; i < SDIM; ++i) if (numbers.get(i) != 0) set(i, numbers.get(i)); } // Set marks from the third part (behind the second colon) if (dump) dump = strchr(dump, ':'); if (dump) marks.load_from_dump(++dump); } /** Generate a new puzzle. */ void Puzzle::generate(unsigned int givens_count, bool symmetric) { // Search a random non-ambiguous puzzle. for (bool found = false; !found;) { Generator generator(*this, givens_count, symmetric, symmetric ? 500 : 2000); generator.find_next_solution(); found = generator.solution_is_valid(); } reset(); } /** Set givens from contents of sudoku if marked in given_marks. */ void Puzzle::set_givens(const Numbers& sudoku, const bool given_marks[SDIM]) { givens.set_contents(sudoku, given_marks); reset(); } /** Remove all givens. */ void Puzzle::clear_givens() { givens.reset(); reset(); } /** No cells set? */ bool Puzzle::untouched() const { for (unsigned int i = 0; i < SDIM; ++i) if (get(i) != givens.get(i)) return false; return true; } /** Is the number in this cell given? */ bool Puzzle::given(Pos pos) const { assert(pos <= Pos::last()); return givens.get(pos) != 0; } /** Is there an error on this position? */ bool Puzzle::error(Pos pos) const { assert(pos <= Pos::last()); return !correct(pos); } /** Is the number in this cell ambiguous? */ bool Puzzle::ambiguous(Pos pos) const { assert(pos <= Pos::last()); return get(pos) != 0 && count[pos] > 1; } /** All cells set and no errors? */ bool Puzzle::solved() const { for (unsigned int i = 0; i < SDIM; ++i) if (get(i) == 0 || !correct(i)) return false; return true; } /** Is this cell marked? */ bool Puzzle::marked(Pos pos) const { assert(pos <= Pos::last()); return marks.get(pos) != 0; } /** Toggle the mark for this cell. */ void Puzzle::toggle_mark(Pos pos) { assert(pos <= Pos::last()); marks.set(pos, marks.get(pos) != 0 ? 0 : 1); } /** Get the next free cell with minimal possible numbers. */ Pos Puzzle::next_cell(Pos pos) const { unsigned int min_count = DIM+1, min_index = SDIM, i; for (pos = (pos+1)%SDIM, i = 0; i < SDIM; ++i, pos = (pos+1)%SDIM) if (get(pos) == 0 && count[pos] < min_count) min_count = count[pos], min_index = pos; return min_index; } /** Get the next possible number for this cell. */ unsigned int Puzzle::next_number(Pos pos) const { assert(pos <= Pos::last()); unsigned int n = get(pos); unsigned int i; if (!given(pos)) for (n = (n+1)%(DIM+1), i = 0; i < DIM+1; ++i, n = (n+1)%(DIM+1)) if (numbers[pos][n]) break; return n; } /** Get the count of possible numbers for this cell. */ unsigned int Puzzle::numbers_count(Pos pos) const { assert(pos <= Pos::last()); return count[pos]; } /** Is this number in this cell a possible number? */ bool Puzzle::possible_number(Pos pos, unsigned int number) const { assert(pos <= Pos::last()); assert(0 < number && number <= DIM); return numbers[pos][number]; } /** Compute all possible numbers for this cell. */ void Puzzle::compute_numbers(Pos pos) { assert(pos <= Pos::last()); unsigned int i; // Fill list with all numbers. for (i = 1; i <= DIM; ++i) numbers[pos][i] = true; // Disable numbers found in row, column or region. for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) if (p.interacts_with(pos)) numbers[pos][get(p)] = false; // Count the possible numbers. count[pos] = 0; for (i = 1; i <= DIM; ++i) if (numbers[pos][i]) ++count[pos]; // 0 is always possible. numbers[pos][0] = true; } /** Is the number in this cell a possible number? */ bool Puzzle::correct(Pos pos) const { assert(pos <= Pos::last()); return count[pos] != 0 && numbers[pos][get(pos)]; } //--- class Sudoku::PuzzleGame ------------------------------------------------- /** Constructor */ PuzzleGame::PuzzleGame(const char* dump) : Puzzle(dump), pos(Pos::center()), history(new History()) { assert(history); } /** Constructor with generation of a random puzzle */ PuzzleGame::PuzzleGame(unsigned int givens_count, bool symmetric) : Puzzle(givens_count, symmetric), pos(Pos::center()), history(new History()) { assert(history); } /** Destructor */ PuzzleGame::~PuzzleGame() { delete history; } /** Reset the puzzle (including marks). */ void PuzzleGame::reset() { reset(true); } /** Reset the puzzle (either with or without marks). */ void PuzzleGame::reset(bool clear_marks) { Puzzle::reset(clear_marks); if (history) history->reset(); } /** Set the number into the current cell, write action into history. */ void PuzzleGame::set_with_history(unsigned int number) { if (history && !given(pos) && get(pos) != number) { history->add(new SetMove(*this, number)); history->current()->execute(); } else set(pos, number); } /** Get the position of the current cell. */ Pos PuzzleGame::get_pos() const { return pos; } /** Set the position of the current cell. */ void PuzzleGame::set_pos(Pos new_pos) { pos = new_pos; } /** Go one step backward in the history. */ void PuzzleGame::backward() { if (history->movesExecuted()) { history->current()->takeBack(); history->backward(); } } /** Go one step forward in the history. */ void PuzzleGame::forward() { if (history->movesToExecute()) { history->forward(); history->current()->execute(); } } sudoku-0.3.5/puzzle.h000066400000000000000000000164311135634645700145560ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_PUZZLE_H #define VDR_SUDOKU_PUZZLE_H #include "sudoku.h" /** Sudoku puzzle * * A Sudoku puzzle consists of 9 x 9 cells subdivided into 9 regions with 3 x 3 * cells. The rules are simple. There have to be the numbers from 1 to 9 in * every row, column and region. */ namespace Sudoku { class History; /** Regions, rows/columns and square dimension of the puzzle */ enum { /** Regions dimension. Width and height of a region */ RDIM = 3, /** Dimension. Number of cells in a row, column or region */ DIM = RDIM * RDIM, /** Square dimension. Number of cells in the whole puzzle */ SDIM = DIM * DIM }; //--- class Sudoku::Pos ------------------------------------------------------ /** Position in a Sudoku */ class Pos { unsigned int pos; public: Pos(unsigned int col, unsigned int row) : pos(col + row * DIM) {} Pos(unsigned int pos = 0) : pos(pos) {} operator unsigned int() const { return pos; } static Pos first() { return 0; } static Pos last() { return SDIM-1; } Pos next() const { return pos + 1; } unsigned int col() const { return pos % DIM; } unsigned int row() const { return pos / DIM; } unsigned int reg() const { return (col() / RDIM) + RDIM * (row() / RDIM); } static Pos center() { return SDIM / 2; } Pos symmetric() const { return SDIM - 1 - pos; } Pos prev_col() const { return col() > 0 ? pos - 1 : pos; } Pos next_col() const { return col() < DIM-1 ? pos + 1 : pos; } Pos prev_row() const { return row() > 0 ? pos - DIM : pos; } Pos next_row() const { return row() < DIM-1 ? pos + DIM : pos; } bool interacts_with(Pos other) const { return pos != other && (col() == other.col() || row() == other.row() || reg() == other.reg()); } }; //--- class Sudoku::Numbers -------------------------------------------------- /** Numbers of a Sudoku */ class Numbers { unsigned int content[SDIM]; mutable char* numbers_dump; // prevent use of copy constructor and copy operator Numbers(const Numbers& other); Numbers& operator=(const Numbers& other); public: /** Constructor */ Numbers(const char* dump = 0); /** Destructor */ virtual ~Numbers(); /** Get the numbers as dump */ virtual const char* get_dump() const; /** Remove all numbers. */ virtual void reset(); /** Set numbers from contents of sudoku if marked in marks. */ virtual void set_contents(const Numbers& sudoku, const bool marks[SDIM]); /** Set the number into this cell. */ virtual void set(Pos pos, unsigned int number); /** Get the number from this cell. */ virtual unsigned int get(Pos pos) const; /** Load numbers from a dump. */ virtual void load_from_dump(const char* dump); }; //--- class Sudoku::Puzzle --------------------------------------------------- /** Sudoku puzzle */ class Puzzle : public Numbers { Numbers givens; Numbers marks; bool numbers[SDIM][DIM+1]; unsigned int count[SDIM]; mutable char* puzzle_dump; // prevent use of copy constructor and copy operator Puzzle(const Puzzle& other); Puzzle& operator=(const Puzzle& other); public: /** Constructor */ Puzzle(const char* dump = 0); /** Constructor with generation of a random puzzle */ Puzzle(unsigned int givens_count, bool symmetric = true); /** Destructor */ virtual ~Puzzle(); /** Get the puzzle as dump */ virtual const char* get_dump() const; /** Reset the puzzle (including marks). */ virtual void reset(); /** Reset the puzzle (either with or without marks). */ virtual void reset(bool clear_marks); /** Set the number into this cell. */ virtual void set(Pos pos, unsigned int number); /** Load a puzzle from a dump. */ virtual void load_from_dump(const char* dump); /** Generate a new puzzle. */ void generate(unsigned int givens_count, bool symmetric = true); /** Set givens from contents of sudoku if marked in given_marks. */ void set_givens(const Numbers& sudoku, const bool given_marks[SDIM]); /** Remove all givens. */ void clear_givens(); /** No cells set? */ bool untouched() const; /** Is the number in this cell given? */ bool given(Pos pos) const; /** Is there an error on this position? */ bool error(Pos pos) const; /** Is the number in this cell ambiguous? */ bool ambiguous(Pos pos) const; /** All cells set and no errors? */ bool solved() const; /** Is this cell marked? */ bool marked(Pos pos) const; /** Toggle the mark for this cell. */ void toggle_mark(Pos pos); /** Get the next free cell with minimal possible numbers. */ Pos next_cell(Pos pos = Pos::last()) const; /** Get the next possible number for this cell. */ unsigned int next_number(Pos pos) const; /** Get the count of possible numbers for this cell. */ unsigned int numbers_count(Pos pos) const; /** Is this number in this cell a possible number? */ bool possible_number(Pos pos, unsigned int number) const; private: /** Compute all possible numbers for this cell. */ void compute_numbers(Pos pos); /** Is the number in this cell a possible number? */ bool correct(Pos pos) const; }; //--- class Sudoku::PuzzleGame ----------------------------------------------- /** Sudoku puzzle game */ class PuzzleGame : public Puzzle { Pos pos; History* history; // prevent use of copy constructor and copy operator PuzzleGame(const PuzzleGame& other); PuzzleGame& operator=(const PuzzleGame& other); public: /** Constructor */ PuzzleGame(const char* dump = 0); /** Constructor with generation of a random puzzle */ PuzzleGame(unsigned int givens_count, bool symmetric = true); /** Destructor */ virtual ~PuzzleGame(); /** Reset the puzzle (including marks). */ virtual void reset(); /** Reset the puzzle (either with or without marks). */ virtual void reset(bool clear_marks); /** Set the number into the current cell, write action into history. */ virtual void set_with_history(unsigned int number); /** Get the position of the current cell. */ Pos get_pos() const; /** Set the position of the current cell. */ void set_pos(Pos new_pos); /** Go one step backward in the history. */ void backward(); /** Go one step forward in the history. */ void forward(); }; } // namespace Sudoku #endif // VDR_SUDOKU_PUZZLE_H sudoku-0.3.5/setup.cpp000066400000000000000000000160561135634645700147230ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "setup.h" #include "commands.h" #include #include using namespace SudokuPlugin; //--- class SudokuPlugin::SetupData -------------------------------------------- /** Constructor * * Initialize the setup parameters of the plugin with standard values. */ SetupData::SetupData() { givens_count = 36; symmetric = 1; mark_errors = 1; mark_ambiguous = 1; show_possibles_pattern = 0; show_possibles_digits = 0; clear_marks = 0; key_red = CommandList::key_red_default_index(); key_green = CommandList::key_green_default_index(); key_yellow = CommandList::key_yellow_default_index(); strcpy(maxi_font, DefaultFontOsd); maxi_font_height = 31; maxi_font_width = 42; strcpy(mini_font, DefaultFontOsd); mini_font_height = 10; mini_font_width = 14; transparency = 50; } /** Parse the setup parameters of the plugin. * * This method is called for each setup parameter the plugin has previously * stored in the global setup data. */ bool SetupData::parse(const char* name, const char* value) { CommandList cl; if (!strcasecmp(name, "GivensCount")) givens_count = atoi(value); else if (!strcasecmp(name, "Symmetric")) symmetric = atoi(value); else if (!strcasecmp(name, "MarkErrors")) mark_errors = atoi(value); else if (!strcasecmp(name, "MarkAmbiguous")) mark_ambiguous = atoi(value); else if (!strcasecmp(name, "ShowPossiblesPattern")) show_possibles_pattern = atoi(value); else if (!strcasecmp(name, "ShowPossiblesDigits")) show_possibles_digits = atoi(value); else if (!strcasecmp(name, "ClearMarks")) clear_marks = atoi(value); else if (!strcasecmp(name, "KeyRed")) key_red = cl.id_to_index(atoi(value), cl.key_red_default_index()); else if (!strcasecmp(name, "KeyGreen")) key_green = cl.id_to_index(atoi(value), cl.key_green_default_index()); else if (!strcasecmp(name, "KeyYellow")) key_yellow = cl.id_to_index(atoi(value), cl.key_yellow_default_index()); else if (!strcasecmp(name, "MaxiFont")) Utf8Strn0Cpy(maxi_font, value, MAXFONTNAME); else if (!strcasecmp(name, "MaxiFontHeight")) maxi_font_height = atoi(value); else if (!strcasecmp(name, "MaxiFontWidth")) maxi_font_width = atoi(value); else if (!strcasecmp(name, "MiniFont")) Utf8Strn0Cpy(mini_font, value, MAXFONTNAME); else if (!strcasecmp(name, "MiniFontHeight")) mini_font_height = atoi(value); else if (!strcasecmp(name, "MiniFontWidth")) mini_font_width = atoi(value); else if (!strcasecmp(name, "Transparency")) transparency = atoi(value); else return false; return true; } //--- class SudokuPlugin::SetupPage -------------------------------------------- /** Constructor */ SetupPage::SetupPage(SetupData& setup) : setup(setup), data(setup) { cFont::GetAvailableFontNames(&maxi_font_names); cFont::GetAvailableFontNames(&mini_font_names); maxi_font_names.Insert(strdup(DefaultFontOsd)); mini_font_names.Insert(strdup(DefaultFontOsd)); maxi_font_index = max(0, maxi_font_names.Find(data.maxi_font)); mini_font_index = max(0, mini_font_names.Find(data.mini_font)); Add(new cMenuEditIntItem(tr("Givens count"), &data.givens_count, 26, 81)); Add(new cMenuEditBoolItem(tr("Symmetric givens"), &data.symmetric)); Add(new cMenuEditBoolItem(tr("Mark errors"), &data.mark_errors)); Add(new cMenuEditBoolItem(tr("Mark ambiguous numbers"), &data.mark_ambiguous)); Add(new cMenuEditBoolItem(tr("Show possible numbers as pattern"), &data.show_possibles_pattern)); Add(new cMenuEditBoolItem(tr("Show possible numbers as digits"), &data.show_possibles_digits)); Add(new cMenuEditBoolItem(tr("Clear marks on reset"), &data.clear_marks)); Add(new cMenuEditStraItem(tr("Key Red"), &data.key_red, CommandList::count(), CommandList::texts())); Add(new cMenuEditStraItem(tr("Key Green"), &data.key_green, CommandList::count(), CommandList::texts())); Add(new cMenuEditStraItem(tr("Key Yellow"), &data.key_yellow, CommandList::count(), CommandList::texts())); Add(new cMenuEditStraItem(tr("Large font"), &maxi_font_index, maxi_font_names.Size(), &maxi_font_names[0])); Add(new cMenuEditIntItem(tr("Large font height (pixel)"), &data.maxi_font_height, 10, MAXFONTSIZE)); Add(new cMenuEditIntItem(tr("Large font width (pixel)"), &data.maxi_font_width, 10, MAXFONTSIZE)); Add(new cMenuEditStraItem(tr("Small font"), &mini_font_index, mini_font_names.Size(), &mini_font_names[0])); Add(new cMenuEditIntItem(tr("Small font height (pixel)"), &data.mini_font_height, 10, MAXFONTSIZE)); Add(new cMenuEditIntItem(tr("Small font width (pixel)"), &data.mini_font_width, 10, MAXFONTSIZE)); Add(new cMenuEditIntItem(tr("Transparency (%)"), &data.transparency, 0, 100)); } /** Store the setup parameters of the plugin. * * The setup parameters of the plugin are stored into the global setup data * file. */ void SetupPage::Store() { Utf8Strn0Cpy(data.maxi_font, maxi_font_names[maxi_font_index], sizeof(data.maxi_font)); Utf8Strn0Cpy(data.mini_font, mini_font_names[mini_font_index], sizeof(data.mini_font)); setup = data; SetupStore("GivensCount", setup.givens_count); SetupStore("Symmetric", setup.symmetric); SetupStore("MarkErrors", setup.mark_errors); SetupStore("MarkAmbiguous", setup.mark_ambiguous); SetupStore("ShowPossiblesPattern", setup.show_possibles_pattern); SetupStore("ShowPossiblesDigits", setup.show_possibles_digits); SetupStore("ClearMarks", setup.clear_marks); SetupStore("KeyRed", CommandList::id(setup.key_red)); SetupStore("KeyGreen", CommandList::id(setup.key_green)); SetupStore("KeyYellow", CommandList::id(setup.key_yellow)); SetupStore("MaxiFont", setup.maxi_font); SetupStore("MaxiFontHeight", setup.maxi_font_height); SetupStore("MaxiFontWidth", setup.maxi_font_width); SetupStore("MiniFont", setup.mini_font); SetupStore("MiniFontHeight", setup.mini_font_height); SetupStore("MiniFontWidth", setup.mini_font_width); SetupStore("Transparency", setup.transparency); } sudoku-0.3.5/setup.h000066400000000000000000000043761135634645700143720ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_SETUP_H #define VDR_SUDOKU_SETUP_H #include "sudoku.h" #include #include #include namespace SudokuPlugin { //--- class SudokuPlugin::SetupData ------------------------------------------ /** Setup parameters of the plugin */ class SetupData { public: int givens_count; int symmetric; int mark_errors; int mark_ambiguous; int show_possibles_pattern; int show_possibles_digits; int clear_marks; int key_red; int key_green; int key_yellow; char maxi_font[MAXFONTNAME]; int maxi_font_height; int maxi_font_width; char mini_font[MAXFONTNAME]; int mini_font_height; int mini_font_width; int transparency; /** Constructor */ SetupData(); /** Parse the setup parameters of the plugin. */ bool parse(const char* name, const char* value); }; //--- class SudokuPlugin::SetupPage ------------------------------------------ /** Setup menu page to adjust the setup parameters of the plugin */ class SetupPage : public cMenuSetupPage { SetupData& setup; SetupData data; cStringList maxi_font_names, mini_font_names; int maxi_font_index, mini_font_index; public: /** Constructor */ SetupPage(SetupData& setup); protected: /** Store the setup parameters of the plugin. */ virtual void Store(); }; } // namespace SudokuPlugin #endif // VDR_SUDOKU_SETUP_H sudoku-0.3.5/solver.cpp000066400000000000000000000054741135634645700150770ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2008, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #define USE_RAND #include "solver.h" #include "backtrack.h" #include "puzzle.h" #include using namespace Sudoku; using namespace BackTrack; //--- class Sudoku::Solver ----------------------------------------------------- /** Constructor */ Solver::Solver(Puzzle& puzzle, bool random_init, unsigned int max_iter) : Algorithm(*this, max_iter), puzzle(puzzle), random_init(random_init) { free_count = 0; for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) if (!puzzle.given(p)) ++free_count; } /** Set the element to the first sibling. */ void Solver::set_first_at(unsigned int level) { assert(level < free_count); const Pos p = puzzle.next_cell(); assert(p <= Pos::last()); free_list[level] = p; puzzle.set(p, 0); if (level == 0) random = random_init; unsigned int i, count = puzzle.numbers_count(p); if (count != 0) { puzzle.set(p, puzzle.next_number(p)); if (random) for (count = rand(count), i = 0; i < count; ++i) puzzle.set(p, puzzle.next_number(p)); } else puzzle.set(p, 1); } /** Set the element to the next sibling. */ void Solver::set_next_at(unsigned int level) { assert(level < free_count); Pos p = free_list[level]; unsigned int n = puzzle.next_number(p); if (n != 0) puzzle.set(p, n); } /** Reset the element. */ void Solver::reset_at(unsigned int level) { assert(level < free_count); puzzle.set(free_list[level], 0); random = false; } /** Check if the element is set to the last sibling. */ bool Solver::is_last_at(unsigned int level) const { assert(level < free_count); return puzzle.next_number(free_list[level]) == 0; } /** Check if the element is valid (following elements ignored). */ bool Solver::is_valid_at(int level) const { assert(level < int(free_count)); if (level < 0) return puzzle.solved(); return !puzzle.error(free_list[level]); } /** Check if the level is the last possible level. */ bool Solver::is_last_level(int level) const { return level >= int(free_count) - 1; } sudoku-0.3.5/solver.h000066400000000000000000000066071135634645700145430ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2007, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_SOLVER_H #define VDR_SUDOKU_SOLVER_H #include "sudoku.h" #include "backtrack.h" #include "puzzle.h" namespace Sudoku { //--- class Sudoku::Solver --------------------------------------------------- /** Implementation of a backtracking algorithm to solve Sudoku puzzles * * The algorithm tries to set numbers in all free cells of the puzzle * sticking to the rules of Sudoku puzzles. * * There are three ways to use this class: * * 1. Solve a Sudoku puzzle with some numbers given: * * \code * Puzzle puzzle(36); // Generate a random puzzle with 36 givens. * Solver solver(puzzle); * solver.find_next_solution(); * if (solver.solution_is_valid()) * { * // Do something with the puzzle. * ... * } * solver.find_next_solution(); * bool more_than_one_solution = solver.solution_is_valid(); * \endcode * * 2. Search a random Sudoku solution: * * \code * Puzzle puzzle; // Generate an empty puzzle without givens. * Solver solver(puzzle, true); * solver.find_next_solution(); * if (solver.solution_is_valid()) * { * // Do something with the puzzle. * ... * } * \endcode * * 3. Search all Sudoku solutions: * * \code * Puzzle puzzle; // Generate an empty puzzle without givens. * Solver solver(puzzle); * solver.find_next_solution(); * while (solver.solution_is_valid()) * { * // Do something with the puzzle. * ... * solver.find_next_solution(); * } * \endcode */ class Solver : public BackTrack::Algorithm, public BackTrack::Solution { Puzzle& puzzle; Pos free_list[SDIM]; unsigned int free_count; bool random_init, random; public: /** Constructor */ Solver(Puzzle& puzzle, bool random_init = false, unsigned int max_iter = 0); /** Set the element to the first sibling. */ virtual void set_first_at(unsigned int level); /** Set the element to the next sibling. */ virtual void set_next_at(unsigned int level); /** Reset the element. */ virtual void reset_at(unsigned int level); /** Check if the element is set to the last sibling. */ virtual bool is_last_at(unsigned int level) const; /** Check if the element is valid (following elements ignored). */ virtual bool is_valid_at(int level) const; /** Check if the level is the last possible level. */ virtual bool is_last_level(int level) const; }; } // namespace Sudoku #endif // VDR_SUDOKU_SOLVER_H sudoku-0.3.5/sudoku.cpp000066400000000000000000000071161135634645700150720ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "sudoku.h" namespace Sudoku { class PuzzleGame; } #include "menu.h" #include "setup.h" #include #include #include #if APIVERSNUM < 10600 #error "VDR-1.6.0 API version or greater is required!" #endif /** 'Sudoku' is a VDR plugin to generate and solve Number Place puzzles. */ namespace SudokuPlugin { /** Version number of the plugin */ static const char* VERSION = "0.3.5"; /** Short description of the plugin's purpose */ static const char* DESCRIPTION = trNOOP("Sudoku - generate and solve Number Place puzzles"); /** Name of the entry in VDR's main menu */ static const char* MAINMENUENTRY = trNOOP("Sudoku"); //--- class SudokuPlugin::Plugin --------------------------------------------- /** Main class of the VDR plugin 'Sudoku' */ class Plugin : public cPlugin { SetupData setup; Sudoku::PuzzleGame* puzzle; public: /** Version number of the plugin */ virtual const char* Version() { return VERSION; } /** Localized short description of the plugin's purpose */ virtual const char* Description() { return tr(DESCRIPTION); } /** Perform the startup actions of the plugin. */ virtual bool Start(); /** Localized name of the entry in VDR's main menu */ virtual const char* MainMenuEntry() { return tr(MAINMENUENTRY); } /** OSD object that shows the plugin's main menu */ virtual cOsdObject* MainMenuAction(); /** Setup menu page to adjust the setup parameters of the plugin */ virtual cMenuSetupPage* SetupMenu(); /** Parse the setup parameters of the plugin. */ virtual bool SetupParse(const char* name, const char* value); }; } // namespace SudokuPlugin using namespace SudokuPlugin; //--- class SudokuPlugin::Plugin ----------------------------------------------- /** Perform the startup actions of the plugin. * * This method is called once at VDR's startup. */ bool Plugin::Start() { puzzle = NULL; return true; } /** OSD object that shows the plugin's main menu * * This method is called every time the plugin's main menu entry is selected. */ cOsdObject* Plugin::MainMenuAction() { return new Menu(this, setup, puzzle); } /** Setup menu page to adjust the setup parameters of the plugin * * This method is called every time the plugin's setup menu entry is selected. */ cMenuSetupPage* Plugin::SetupMenu() { return new SetupPage(setup); } /** Parse the setup parameters of the plugin. * * This method is called for each setup parameter the plugin has previously * stored in the global setup data. */ bool Plugin::SetupParse(const char* name, const char* value) { return setup.parse(name, value); } /** "Magic" hook that allows VDR to load the plugin into its memory */ VDRPLUGINCREATOR(Plugin); // Don't touch this! sudoku-0.3.5/sudoku.h000066400000000000000000000025641135634645700145410ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2008, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #ifndef VDR_SUDOKU_H #define VDR_SUDOKU_H #include namespace Sudoku { //--- template class Vector -------------------------------------------------- template class Vector : public std::vector {}; #ifdef USE_RAND #include #include /** Random number 0 .. max-1 */ static unsigned int rand(unsigned int max) { static unsigned int seed = time(NULL); return (unsigned int)((double)max * rand_r(&seed) / (RAND_MAX + 1.0)); } #endif // USE_RAND } // namespace Sudoku #endif // VDR_SUDOKU_H sudoku-0.3.5/tests/000077500000000000000000000000001135634645700142115ustar00rootroot00000000000000sudoku-0.3.5/tests/Makefile000066400000000000000000000027271135634645700156610ustar00rootroot00000000000000# # Sudoku: A plug-in for the Video Disk Recorder # # Copyright (C) 2010, Thomas Günther # # 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; either version 2 of the License, or # (at your option) any later version. # # 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-1301 USA. PROGRAM = testrunner SRCS = ../puzzle.cpp ../generator.cpp ../solver.cpp ../backtrack.cpp \ ../history.cpp TESTGEN ?= cxxtestgen.py CXX ?= g++ CXXFLAGS ?= -g -O2 -Wall -Woverloaded-virtual DEFINES += -D_GNU_SOURCE ### The main target: all: $(PROGRAM) ./$< ### Dependencies: DEPFILE = .dependencies $(DEPFILE): Makefile @$(CXX) -MM -MG $(SRCS) | sed -e "s/\(.*: .*\)/..\/\1/" > $@ -include $(DEPFILE) ### Targets: $(PROGRAM).cpp: test_*.h $(TESTGEN) -o $@ --error-printer $^ $(PROGRAM): $(PROGRAM).cpp $(SRCS:%.cpp=%.o) $(CXX) $(CXXFLAGS) $(DEFINES) $(INCLUDES) -o $@ $^ clean: @-rm -f $(PROGRAM) $(PROGRAM).cpp $(SRCS:%.cpp=%.o) $(DEPFILE) core* *~ sudoku-0.3.5/tests/test_backtrack.h000066400000000000000000000065061135634645700173550ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include #include "../backtrack.h" using namespace BackTrack; template class Permutation : public Solution { Type (&list)[Size]; public: Permutation(Type (&list)[Size]) : list(list) {} virtual void set_first_at(unsigned int level) { list[level] = (Type)0; } virtual void set_next_at(unsigned int level) { ++list[level]; } virtual void reset_at(unsigned int level) {} virtual bool is_last_at(unsigned int level) const { return list[level] >= (Type)Size-1; } virtual bool is_valid_at(int level) const { for (int idx = 0; idx < level; ++idx) if (list[idx] == list[level]) return false; return true; } virtual bool is_last_level(int level) const { return level >= int(Size)-1; } }; class Test_BackTrack : public CxxTest::TestSuite { public: void test_PermutationBackTrack() { int list[3]; Permutation perm(list); Algorithm algorithm(perm); algorithm.find_next_solution(); bool first_permutation = algorithm.solution_is_valid(); TS_ASSERT(first_permutation); TS_ASSERT_EQUALS(list[0], 0); TS_ASSERT_EQUALS(list[1], 1); TS_ASSERT_EQUALS(list[2], 2); algorithm.find_next_solution(); bool second_permutation = algorithm.solution_is_valid(); TS_ASSERT(second_permutation); TS_ASSERT_EQUALS(list[0], 0); TS_ASSERT_EQUALS(list[1], 2); TS_ASSERT_EQUALS(list[2], 1); algorithm.find_next_solution(); bool third_permutation = algorithm.solution_is_valid(); TS_ASSERT(third_permutation); TS_ASSERT_EQUALS(list[0], 1); TS_ASSERT_EQUALS(list[1], 0); TS_ASSERT_EQUALS(list[2], 2); algorithm.find_next_solution(); bool fourth_permutation = algorithm.solution_is_valid(); TS_ASSERT(fourth_permutation); TS_ASSERT_EQUALS(list[0], 1); TS_ASSERT_EQUALS(list[1], 2); TS_ASSERT_EQUALS(list[2], 0); algorithm.find_next_solution(); bool fifth_permutation = algorithm.solution_is_valid(); TS_ASSERT(fifth_permutation); TS_ASSERT_EQUALS(list[0], 2); TS_ASSERT_EQUALS(list[1], 0); TS_ASSERT_EQUALS(list[2], 1); algorithm.find_next_solution(); bool sixth_permutation = algorithm.solution_is_valid(); TS_ASSERT(sixth_permutation); TS_ASSERT_EQUALS(list[0], 2); TS_ASSERT_EQUALS(list[1], 1); TS_ASSERT_EQUALS(list[2], 0); algorithm.find_next_solution(); bool too_many_permutations = algorithm.solution_is_valid(); TS_ASSERT(!too_many_permutations); } }; sudoku-0.3.5/tests/test_generator.h000066400000000000000000000037611135634645700174160ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include #include "../generator.h" #include "../solver.h" using namespace Sudoku; class Test_Generator : public CxxTest::TestSuite { public: void test_GenerateSymmetricSudoku() { // Generate a random Sudoku with 36 symmetric givens. Puzzle puzzle; Generator generator(puzzle, 36); generator.find_next_solution(); TS_ASSERT(generator.solution_is_valid()); // Solve the generated Sudoku. Solver solver(puzzle); solver.find_next_solution(); TS_ASSERT(solver.solution_is_valid()); solver.find_next_solution(); bool only_one_solution = !solver.solution_is_valid(); TS_ASSERT(only_one_solution); } void test_GenerateNonSymmetricSudoku() { // Generate a random Sudoku with 26 non-symmetric givens. Puzzle puzzle; Generator generator(puzzle, 26, false); generator.find_next_solution(); TS_ASSERT(generator.solution_is_valid()); // Solve the generated Sudoku. Solver solver(puzzle); solver.find_next_solution(); TS_ASSERT(solver.solution_is_valid()); solver.find_next_solution(); bool only_one_solution = !solver.solution_is_valid(); TS_ASSERT(only_one_solution); } }; sudoku-0.3.5/tests/test_history.h000066400000000000000000000065271135634645700171340ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include #include "../history.h" #include "../puzzle.h" using namespace Sudoku; class Test_History : public CxxTest::TestSuite { public: void test_HistoryEmpty() { History history; TS_ASSERT(!history.movesExecuted()); TS_ASSERT(!history.movesToExecute()); history.backward(); TS_ASSERT(!history.movesExecuted()); TS_ASSERT(!history.movesToExecute()); history.forward(); TS_ASSERT(!history.movesExecuted()); TS_ASSERT(!history.movesToExecute()); history.reset(); TS_ASSERT(!history.movesExecuted()); TS_ASSERT(!history.movesToExecute()); } void test_HistoryNull() { History history; TS_ASSERT_EQUALS(history.current(), (Move*)0); history.add(0); TS_ASSERT(!history.movesExecuted()); TS_ASSERT(!history.movesToExecute()); } void test_HistoryAdd() { History history; PuzzleGame puzzle; SetMove* move1 = new SetMove(puzzle, 1); history.add(move1); TS_ASSERT_EQUALS(history.current(), move1); TS_ASSERT(history.movesExecuted()); TS_ASSERT(!history.movesToExecute()); SetMove* move2 = new SetMove(puzzle, 2); history.add(move2); TS_ASSERT_EQUALS(history.current(), move2); TS_ASSERT(history.movesExecuted()); TS_ASSERT(!history.movesToExecute()); history.backward(); TS_ASSERT_EQUALS(history.current(), move1); TS_ASSERT(history.movesExecuted()); TS_ASSERT(history.movesToExecute()); history.forward(); TS_ASSERT_EQUALS(history.current(), move2); TS_ASSERT(history.movesExecuted()); TS_ASSERT(!history.movesToExecute()); history.backward(); TS_ASSERT_EQUALS(history.current(), move1); TS_ASSERT(history.movesExecuted()); TS_ASSERT(history.movesToExecute()); SetMove* move3 = new SetMove(puzzle, 3); history.add(move3); TS_ASSERT_EQUALS(history.current(), move3); TS_ASSERT(history.movesExecuted()); TS_ASSERT(!history.movesToExecute()); history.backward(); TS_ASSERT_EQUALS(history.current(), move1); TS_ASSERT(history.movesExecuted()); TS_ASSERT(history.movesToExecute()); history.backward(); TS_ASSERT_EQUALS(history.current(), (Move*)0); TS_ASSERT(!history.movesExecuted()); TS_ASSERT(history.movesToExecute()); } void test_SetMove() { PuzzleGame puzzle; SetMove move = SetMove(puzzle, 9); Pos pos = puzzle.get_pos(); TS_ASSERT_EQUALS(puzzle.get(pos), 0u); move.execute(); TS_ASSERT_EQUALS(puzzle.get(pos), 9u); move.takeBack(); TS_ASSERT_EQUALS(puzzle.get(pos), 0u); } }; sudoku-0.3.5/tests/test_puzzle.h000066400000000000000000000131241135634645700167530ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include #include "../puzzle.h" using namespace Sudoku; class Test_Puzzle : public CxxTest::TestSuite { public: void test_Pos() { Pos pos; TS_ASSERT_EQUALS(pos, Pos::first()); TS_ASSERT_EQUALS(pos, 0u); TS_ASSERT_EQUALS(pos.col(), 0u); TS_ASSERT_EQUALS(pos.row(), 0u); TS_ASSERT_EQUALS(pos.reg(), 0u); TS_ASSERT_EQUALS(pos, Pos(0, 0)); TS_ASSERT_EQUALS(pos.prev_col(), pos); TS_ASSERT_EQUALS(pos.prev_row(), pos); TS_ASSERT_EQUALS(pos.next(), Pos(1, 0)); TS_ASSERT_EQUALS(pos.next_col(), Pos(1, 0)); TS_ASSERT_EQUALS(pos.next_row(), Pos(0, 1)); pos = pos.symmetric(); TS_ASSERT_EQUALS(pos, Pos::last()); TS_ASSERT_EQUALS(pos, 80u); TS_ASSERT_EQUALS(pos.col(), 8u); TS_ASSERT_EQUALS(pos.row(), 8u); TS_ASSERT_EQUALS(pos.reg(), 8u); TS_ASSERT_EQUALS(pos, Pos(8, 8)); TS_ASSERT_EQUALS(pos.next(), Pos::last()+1); TS_ASSERT_EQUALS(pos.next_col(), pos); TS_ASSERT_EQUALS(pos.next_row(), pos); TS_ASSERT_EQUALS(pos.prev_col(), Pos(7, 8)); TS_ASSERT_EQUALS(pos.prev_row(), Pos(8, 7)); pos = Pos(0, 4); TS_ASSERT_EQUALS(pos.prev_col(), pos); pos = Pos(4, 0); TS_ASSERT_EQUALS(pos.prev_row(), pos); pos = Pos(4, 8); TS_ASSERT_EQUALS(pos.next_row(), pos); pos = Pos(8, 4); TS_ASSERT_EQUALS(pos.next_col(), pos); TS_ASSERT_EQUALS(pos.next(), Pos(0, 5)); pos = Pos::center(); TS_ASSERT_EQUALS(pos, 40u); TS_ASSERT_EQUALS(pos.col(), 4u); TS_ASSERT_EQUALS(pos.row(), 4u); TS_ASSERT_EQUALS(pos.reg(), 4u); TS_ASSERT_EQUALS(pos, Pos(4, 4)); pos = pos.next().next_col().next_row(); TS_ASSERT_EQUALS(pos, Pos(6, 5)); TS_ASSERT_EQUALS(pos, 51u); TS_ASSERT_EQUALS(pos.col(), 6u); TS_ASSERT_EQUALS(pos.row(), 5u); TS_ASSERT_EQUALS(pos.reg(), 5u); pos = pos.prev_col().prev_row(); TS_ASSERT_EQUALS(pos, Pos(5, 4)); for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) if (p == pos) { TS_ASSERT(!p.interacts_with(pos)); } else if (p.col() == pos.col()) { TS_ASSERT(p.interacts_with(pos)); } else if (p.row() == pos.row()) { TS_ASSERT(p.interacts_with(pos)); } else if (p.reg() == pos.reg()) { TS_ASSERT(p.interacts_with(pos)); } else { TS_ASSERT(!p.interacts_with(pos)); } } void test_NumbersEmptyDump() { Numbers numbers; const char dump[] = "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________"; TS_ASSERT_SAME_DATA(numbers.get_dump(), dump, sizeof(dump)); } void test_NumbersConstruct() { const char dump[] = "________9+" "_______8_+" "______7__+" "_____6___+" "____5____+" "___4_____+" "__3______+" "_2_______+" "1________"; Numbers numbers(dump); for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) if (p.col() == DIM - 1 - p.row()) { TS_ASSERT_EQUALS(numbers.get(p), p.col()+1); } else { TS_ASSERT_EQUALS(numbers.get(p), 0u); } TS_ASSERT_SAME_DATA(numbers.get_dump(), dump, sizeof(dump)); } void test_NumbersSetGet() { Numbers numbers; numbers.set(Pos(0, 0), 1); numbers.set(Pos(1, 1), 2); numbers.set(Pos(2, 2), 3); numbers.set(Pos(3, 3), 4); numbers.set(Pos(4, 4), 5); numbers.set(Pos(5, 5), 6); numbers.set(Pos(6, 6), 7); numbers.set(Pos(7, 7), 8); numbers.set(Pos(8, 8), 9); for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) if (p.col() == p.row()) { TS_ASSERT_EQUALS(numbers.get(p), p.col()+1); } else { TS_ASSERT_EQUALS(numbers.get(p), 0u); } } void test_PuzzleEmpty() { Puzzle puzzle; for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) { TS_ASSERT_EQUALS(puzzle.get(p), 0u); TS_ASSERT(!puzzle.given(p)); } } void test_PuzzleNumbers() { const char dump[] = "________9+" "_______8_+" "______7__+" "_____6___+" "____5____+" "___4_____+" "__3______+" "_2_______+" "1________"; Numbers numbers(dump); Puzzle puzzle(dump); for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) { TS_ASSERT_EQUALS(puzzle.get(p), numbers.get(p)); TS_ASSERT_EQUALS(puzzle.given(p), numbers.get(p) != 0u); } } }; sudoku-0.3.5/tests/test_solver.h000066400000000000000000000101451135634645700167340ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include #include "../solver.h" using namespace Sudoku; class Test_Solver : public CxxTest::TestSuite { public: void test_SearchFirstSudoku() { Puzzle puzzle; Solver solver(puzzle); solver.find_next_solution(); TS_ASSERT(solver.solution_is_valid()); const char dump[] = "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________:" "123456789+" "456789123+" "789123456+" "231674895+" "875912364+" "694538217+" "317265948+" "542897631+" "968341572:" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________"; TS_ASSERT_SAME_DATA(puzzle.get_dump(), dump, sizeof(dump)); solver.find_next_solution(); bool more_than_one_solution = solver.solution_is_valid(); TS_ASSERT(more_than_one_solution); } void test_SearchRandomSudoku() { Puzzle puzzle; Solver solver(puzzle, true); solver.find_next_solution(); TS_ASSERT(solver.solution_is_valid()); } void test_SolveHardSudoku() { // Hardest Sudoku from sudokusolver.co.uk (nologic, score 80197, 77 guesses) Puzzle puzzle("1____7_9_+" "_3__2___8+" "__96__5__+" "__53__9__+" "_1__8___2+" "6____4___+" "3______1_+" "_4______7+" "__7___3__"); Solver solver(puzzle); solver.find_next_solution(); TS_ASSERT(solver.solution_is_valid()); const char dump[] = "1____7_9_+" "_3__2___8+" "__96__5__+" "__53__9__+" "_1__8___2+" "6____4___+" "3______1_+" "_4______7+" "__7___3__:" "162857493+" "534129678+" "789643521+" "475312986+" "913586742+" "628794135+" "356478219+" "241935867+" "897261354:" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________+" "_________"; TS_ASSERT_SAME_DATA(puzzle.get_dump(), dump, sizeof(dump)); solver.find_next_solution(); bool only_one_solution = !solver.solution_is_valid(); TS_ASSERT(only_one_solution); } }; sudoku-0.3.5/tools/000077500000000000000000000000001135634645700142075ustar00rootroot00000000000000sudoku-0.3.5/tools/Makefile000066400000000000000000000037301135634645700156520ustar00rootroot00000000000000# # Sudoku: A plug-in for the Video Disk Recorder # # Copyright (C) 2005-2008, Thomas Günther # # 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; either version 2 of the License, or # (at your option) any later version. # # 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-1301 USA. # Define STATIC_LINK=1 to force static linking #STATIC_LINK = 1 # Define WITH_TEST=1 to include test procedures #WITH_TEST = 1 PROGRAM = sudoku_generator SRCS = ../puzzle.cpp ../generator.cpp ../solver.cpp ../backtrack.cpp \ ../history.cpp VERSION = $(shell sed -ne '/static .* VERSION *=/s/^.*"\(.*\)".*$$/\1/p' \ ../sudoku.cpp) CXX ?= g++ CXXFLAGS ?= -g -O2 -Wall -Woverloaded-virtual DEFINES += -D_GNU_SOURCE -DVERSION=\"$(VERSION)\" ifdef STATIC_LINK CXXFLAGS += -static endif ifdef WITH_TEST DEFINES += -DWITH_TEST endif ### Directories: prefix = /usr/local bindir = $(prefix)/bin mandir = $(prefix)/share/man man1dir = $(mandir)/man1 ### Tools: INSTALL = install INSTALL_DIRS = $(INSTALL) -d INSTALL_PROG = $(INSTALL) INSTALL_DATA = $(INSTALL) -m u=rw,g=r,o=r ### Targets: all: $(PROGRAM) $(PROGRAM): $(PROGRAM).cpp $(SRCS) $(SRCS:%.cpp=%.h) $(CXX) $(CXXFLAGS) $(DEFINES) $(INCLUDES) -o $@ $(PROGRAM).cpp $(SRCS) install: all $(INSTALL_DIRS) $(DESTDIR)$(bindir) $(DESTDIR)$(man1dir) $(INSTALL_PROG) $(PROGRAM) $(DESTDIR)$(bindir)/ $(INSTALL_DATA) $(PROGRAM).1 $(DESTDIR)$(man1dir)/ clean: @-rm -f $(PROGRAM) core* *~ sudoku-0.3.5/tools/sudoku_generator.1000066400000000000000000000044721135634645700176600ustar00rootroot00000000000000.\" .\" Sudoku: A plug-in for the Video Disk Recorder .\" .\" Copyright (C) 2008-2010, Thomas Günther .\" .\" 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; either version 2 of the License, or .\" (at your option) any later version. .\" .\" 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-1301 USA. .\" .TH sudoku_generator "1" "April 2010" "sudoku_generator 0.3.5" "User Commands" .SH NAME sudoku_generator \- generate and solve Sudoku puzzles .SH SYNOPSIS .B sudoku_generator [\fI-n|--non-sym\fR] [\fI-d|--dump\fR] [\fIgivens_count\fR] .br .B sudoku_generator \fI-s|--solve|-p|--print\fR \fIsudoku_dump\fR .SH DESCRIPTION .B sudoku_generator generates, solves and prints Number Place puzzles, so called Sudokus. A Sudoku puzzle consists of 9 x 9 cells subdivided into 9 regions with 3 x 3 cells. The rules are simple. There have to be the numbers from 1 to 9 in every row, column and region. .TP \fBgivens_count\fR Number of givens (<= 81). Default is 36. Generation of Sudoku puzzles with less than 26 givens takes very long. .TP \fBsudoku_dump\fR String with 81 * 1\-9 or _ (+ ignored). .SH OPTIONS .TP \fB\-n\fR, \fB\-\-non\-sym\fR Generate a non\-symmetric Sudoku puzzle. Default is symmetric. .TP \fB\-d\fR, \fB\-\-dump\fR Dump the generated Sudoku puzzle (don't print). .TP \fB\-s\fR, \fB\-\-solve\fR \fIsudoku_dump\fR Solve a Sudoku puzzle. .TP \fB\-p\fR, \fB\-\-print\fR \fIsudoku_dump\fR Print a Sudoku puzzle. .TP \fB\-v\fR, \fB\-\-version\fR Print version information and exit. .TP \fB\-h\fR, \fB\-\-help\fR Print help message and exit. .SH COPYRIGHT Copyright \(co 2005-2010, Thomas G\(:unther .br This GPL program comes with ABSOLUTELY NO WARRANTY; this is free software, and you are welcome to redistribute it under certain conditions; see the source for details. sudoku-0.3.5/tools/sudoku_generator.cpp000066400000000000000000000247551135634645700203100ustar00rootroot00000000000000/* * Sudoku: A plug-in for the Video Disk Recorder * * Copyright (C) 2005-2010, Thomas Günther * * 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; either version 2 of the License, or * (at your option) any later version. * * 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-1301 USA. */ #include "../puzzle.h" #include "../solver.h" #include "../generator.h" #include #include #include using namespace Sudoku; int print_version() { printf("sudoku_generator %s\n" "Copyright (C) 2005-2010, Thomas Günther \n" "This GPL program comes with ABSOLUTELY NO WARRANTY;\n" "this is free software, and you are welcome to redistribute it\n" "under certain conditions; see the source for details.\n", VERSION); return 0; } void print_description(unsigned int givens_count) { printf("Sudoku with %d givens generated by sudoku_generator %s\n" " This puzzle can be used without any limitations.\n" "\n", givens_count, VERSION); } int print_usage() { printf("Usage: sudoku_generator [-n|--non-sym] [-d|--dump] []\n" " Generate a Sudoku puzzle.\n" " givens_count Number of givens (<= 81). Default is 36.\n" " Less than 26 givens takes very long.\n" " -n, --non-sym Generate a non-symmetric Sudoku puzzle.\n" " -d, --dump Dump the generated Sudoku (don't print).\n" "\n" " sudoku_generator -s|--solve \n" " Solve a Sudoku puzzle.\n" " sudoku_dump String with 81 * 1-9 or _ (+ ignored).\n" "\n" " sudoku_generator -p|--print \n" " Print a Sudoku puzzle.\n" " sudoku_dump String with 81 * 1-9 or _ (+ ignored).\n" "\n" #ifdef WITH_TEST " sudoku_generator -t|--test\n" " Perform some test procedures.\n" "\n" #endif " sudoku_generator -v|--version\n" " Print version information and exit.\n" "\n" " sudoku_generator -h|--help\n" " Print this help message and exit.\n" "\n"); return 2; } void print_sudoku(const Numbers* sudoku_list[], unsigned int count, unsigned int givens_count = 0) { printf("\n"); for (unsigned int row = 0; row <= DIM; ++row) { if (row % RDIM == 0) { for (unsigned int idx = 0; idx < count; ++idx) { printf(" "); for (unsigned int col = 0; col < DIM; ++col) { if (col % RDIM == 0) printf(" "); printf("- "); } printf(" "); } printf("\n"); } if (row < DIM) { for (unsigned int idx = 0; idx < count; ++idx) { printf(" "); for (unsigned int col = 0; col < DIM; ++col) { if (col % RDIM == 0) printf("| "); unsigned int n = sudoku_list[idx]->get(Pos(col, row)); if (n) printf("%d ", n); else printf(" "); } printf("| "); } printf("\n"); } } printf("\n"); if (givens_count != 0) print_description(givens_count); } void print_sudoku(const Numbers& sudoku, unsigned int givens_count = 0) { const Numbers* sudoku_list[] = { &sudoku }; print_sudoku(sudoku_list, 1, givens_count); } void print_sudoku(const Numbers& sudoku1, const Numbers& sudoku2, unsigned int givens_count = 0) { const Numbers* sudoku_list[] = { &sudoku1, &sudoku2 }; print_sudoku(sudoku_list, 2, givens_count); } void dump_sudoku(const Numbers& sudoku) { printf("%s\n", sudoku.get_dump()); } int generate_puzzle(unsigned int givens_count, bool non_sym, bool dump) { Puzzle puzzle; Generator generator(puzzle, givens_count, !non_sym); generator.find_next_solution(); if (!generator.solution_is_valid()) return 1; if (dump) dump_sudoku(puzzle); else print_sudoku(puzzle, givens_count); return 0; } int solve_puzzle(const char *dump) { Numbers numbers(dump); bool given_marks[SDIM]; for (Pos p = Pos::first(); p <= Pos::last(); p = p.next()) given_marks[p] = numbers.get(p) != 0; Puzzle puzzle; puzzle.set_givens(numbers, given_marks); Solver solver(puzzle); solver.find_next_solution(); if (!solver.solution_is_valid()) return 1; print_sudoku(numbers, puzzle); solver.find_next_solution(); if (!solver.solution_is_valid()) return 0; printf("Error: Sudoku has more than one solution!\n"); return 1; } int print_puzzle(const char *dump) { Numbers numbers(dump); print_sudoku(numbers); return 0; } #ifdef WITH_TEST bool test_search_first() { bool correct = true; printf("Search the first Sudoku!\n"); Puzzle puzzle; Solver solver(puzzle); solver.find_next_solution(); if (solver.solution_is_valid()) print_sudoku(puzzle); else correct = false, printf("Error: Sudoku is invalid!\n"); printf("Search the second Sudoku!\n"); solver.find_next_solution(); if (solver.solution_is_valid()) print_sudoku(puzzle); else correct = false, printf("Error: Sudoku is invalid!\n"); return correct; } bool test_search_random() { bool correct = true; printf("Search a random Sudoku!\n"); Puzzle puzzle; Solver solver(puzzle, true); solver.find_next_solution(); if (solver.solution_is_valid()) print_sudoku(puzzle); else correct = false, printf("Error: Sudoku is invalid!\n"); printf("Search another random Sudoku!\n"); solver.reset(); solver.find_next_solution(); if (solver.solution_is_valid()) print_sudoku(puzzle); else correct = false, printf("Error: Sudoku is invalid!\n"); return correct; } bool test_generate_symmetric() { bool correct = true; printf("Generate a random Sudoku with 36 symmetric givens!\n"); Puzzle puzzle; Generator generator(puzzle, 36); generator.find_next_solution(); if (generator.solution_is_valid()) print_sudoku(puzzle); else correct = false, printf("Error: Sudoku is invalid!\n"); printf("Solve the generated Sudoku!\n"); Solver solver(puzzle); solver.find_next_solution(); if (solver.solution_is_valid()) print_sudoku(puzzle); else correct = false, printf("Error: Sudoku is invalid!\n"); solver.find_next_solution(); if (solver.solution_is_valid()) correct = false, print_sudoku(puzzle), printf("Error: Sudoku has more than one solution!\n"); else printf("Sudoku has only one solution!\n"); printf("\n"); return correct; } bool test_generate_non_symmetric() { bool correct = true; printf("Generate a random Sudoku with 26 non-symmetric givens!\n"); Puzzle puzzle; Generator generator(puzzle, 26, false); generator.find_next_solution(); if (generator.solution_is_valid()) print_sudoku(puzzle); else correct = false, printf("Error: Sudoku is invalid!\n"); printf("Solve the generated Sudoku!\n"); Solver solver(puzzle); solver.find_next_solution(); if (solver.solution_is_valid()) print_sudoku(puzzle); else correct = false, printf("Error: Sudoku is invalid!\n"); solver.find_next_solution(); if (solver.solution_is_valid()) correct = false, print_sudoku(puzzle), printf("Error: Sudoku has more than one solution!\n"); else printf("Sudoku has only one solution!\n"); printf("\n"); return correct; } int test_sudoku() { unsigned int count = 0; unsigned int error = 0; ++count; if (!test_search_first()) ++error; ++count; if (!test_search_random()) ++error; ++count; if (!test_generate_symmetric()) ++error; ++count; if (!test_generate_non_symmetric()) ++error; if (error > 0) printf("%d errors in %d tests\n", error, count); else printf("All %d tests correct\n", count); if (error > 0) return 1; return 0; } #endif // WITH_TEST int main(int argc, char* argv[]) { static const struct option long_options[] = { { "non-sym", no_argument, NULL, 'n' }, { "dump", no_argument, NULL, 'd' }, { "solve", no_argument, NULL, 's' }, { "print", no_argument, NULL, 'p' }, #ifdef WITH_TEST { "test", no_argument, NULL, 't' }, #endif { "version", no_argument, NULL, 'v' }, { "help", no_argument, NULL, 'h' }, { NULL } }; #ifdef WITH_TEST static const char* options = "ndsptvh"; #else static const char* options = "ndspvh"; #endif bool non_sym = false; bool dump = false; bool solve = false; bool print = false; bool test = false; bool version = false; bool help = false; bool error = false; int c; while ((c = getopt_long(argc, argv, options, long_options, NULL)) != -1) { switch (c) { case 'n': non_sym = true; break; case 'd': dump = true; break; case 's': solve = true; break; case 'p': print = true; break; #ifdef WITH_TEST case 't': test = true; break; #endif case 'v': version = true; break; case 'h': help = true; break; default: error = true; } } int arg_count = argc - optind; bool generate = non_sym || dump || (arg_count == 0 && !test && !version && !help) || (arg_count == 1 && !solve && !print); unsigned int givens_count = 36; if (arg_count == 1 && generate && sscanf(argv[optind], "%u", &givens_count) != 1) return print_usage(); if ((generate ? 1 : 0) + (solve ? 1 : 0) + (print ? 1 : 0) + (test ? 1 : 0) + (version ? 1 : 0) + (help ? 1 : 0) > 1 || error) return print_usage(); if (generate && 0 < givens_count && givens_count <= SDIM) return generate_puzzle(givens_count, non_sym, dump); if (solve && arg_count == 1 && strlen(argv[optind]) >= SDIM) return solve_puzzle(argv[optind]); if (print && arg_count == 1 && strlen(argv[optind]) >= SDIM) return print_puzzle(argv[optind]); #ifdef WITH_TEST if (test) return test_sudoku(); #endif if (version) return print_version(); return print_usage(); }