diff --git a/.github/workflows/macos-check.yml b/.github/workflows/macos-check.yml new file mode 100644 index 0000000..03ae6c9 --- /dev/null +++ b/.github/workflows/macos-check.yml @@ -0,0 +1,18 @@ +name: tests macos + +on: + push: + branches: [ "master" ] + pull_request: + branches: [ "master" ] + +jobs: + build: + + runs-on: macos-latest + + steps: + - uses: actions/checkout@v3 + - name: mandatory tests + run: cd push_swap; make; ./push_swap 1 2 3 4 5; + shell: bash diff --git a/.github/workflows/norminette.yml b/.github/workflows/norminette.yml new file mode 100644 index 0000000..1a15fe9 --- /dev/null +++ b/.github/workflows/norminette.yml @@ -0,0 +1,17 @@ +name: norminette + +on: + push: + branches: [ "master" ] + pull_request: + branches: [ "master" ] + +jobs: + norminette_job: + runs-on: ubuntu-latest + name: norminette + steps: + - uses: actions/checkout@v2 + - uses: alexandregv/norminette-action@v3 + with: + flags: './push_swap' diff --git a/Makefile b/Makefile deleted file mode 100644 index af3357e..0000000 --- a/Makefile +++ /dev/null @@ -1,71 +0,0 @@ -# **************************************************************************** # -# # -# ::: :::::::: # -# Makefile :+: :+: :+: # -# +:+ +:+ +:+ # -# By: user42 +#+ +:+ +#+ # -# +#+#+#+#+#+ +#+ # -# Created: 2021/05/29 11:04:13 by user42 #+# #+# # -# Updated: 2021/06/17 15:05:21 by malatini ### ########.fr # -# # -# **************************************************************************** # - -SRCS_SORTER = ./srcs/sorter/main.c \ - ./srcs/sorter/short_suites/short_suites.c \ - ./srcs/sorter/long_suites/step1_target_index.c \ - ./srcs/sorter/long_suites/step2_keep_push.c \ - ./srcs/sorter/long_suites/step3_find_shortest_action.c \ - ./srcs/sorter/long_suites/step4_sort.c \ - -SRCS_COMMON = ./srcs/common/stack/stack_utils0.c \ - ./srcs/common/stack/stack_utils1.c \ - ./srcs/common/stack/stack_utils2.c \ - ./srcs/common/stack/stack_utils3.c \ - ./srcs/common/utils/utils0.c \ - ./srcs/common/actions/push_stack.c \ - ./srcs/common/actions/reverse_rotate_stack.c \ - ./srcs/common/actions/rotate_stack.c \ - ./srcs/common/actions/swap_stack.c \ - ./srcs/common/parsing/parsing_utils.c \ - ./srcs/common/exit/exit.c \ - -SRCS_CHECKER = ./srcs/checker_bonus/get_next_line.c \ - ./srcs/checker_bonus/get_next_line_utils.c \ - ./srcs/checker_bonus/main.c \ - -OBJS_SORTER = ${SRCS_SORTER:.c=.o} -OBJS_COMMON = ${SRCS_COMMON:.c=.o} -OBJS_CHECKER = ${SRCS_CHECKER:.c=.o} - -INCLUDE = ./srcs/include - -NAME = push_swap -NAME_CHECKER = checker - -CC = gcc -CFLAGS = -Wall -Wextra -Werror -RM = rm -rf - -all: ${NAME} - -.c.o: - ${CC} ${CFLAGS} -I${INCLUDE} -c $< -o ${<:.c=.o} - - -${NAME}: ${OBJS_COMMON} ${OBJS_SORTER} - ${CC} ${CFLAGS} -I${INCLUDE} -o ${NAME} ${OBJS_COMMON} ${OBJS_SORTER} - -${NAME_CHECKER}: ${OBJS_COMMON} ${OBJS_CHECKER} - ${CC} ${CFLAGS} -I${INCLUDE} -o ${NAME_CHECKER} ${OBJS_COMMON} ${OBJS_CHECKER} - -clean: - ${RM} ${OBJS_COMMON} ${OBJS_CHECKER} ${OBJS_SORTER} - -fclean: clean - ${RM} ${NAME} ${NAME_CHECKER} - -re: fclean all - -bonus: checker - -.PHONY: checker bonus all clean fclean re diff --git a/push_swap b/push_swap deleted file mode 100755 index 889497d..0000000 Binary files a/push_swap and /dev/null differ diff --git a/push_swap.h b/push_swap.h deleted file mode 100644 index e2cc35d..0000000 --- a/push_swap.h +++ /dev/null @@ -1,23 +0,0 @@ -/* ************************************************************************** */ -/* */ -/* ::: :::::::: */ -/* push_swap.h :+: :+: :+: */ -/* +:+ +:+ +:+ */ -/* By: user42 +#+ +:+ +#+ */ -/* +#+#+#+#+#+ +#+ */ -/* Created: 2021/05/29 11:08:23 by user42 #+# #+# */ -/* Updated: 2021/06/02 13:58:08 by user42 ### ########.fr */ -/* */ -/* ************************************************************************** */ - -#ifndef PUSH_SWAP_H -# define PUSH_SWAP_H -# define SUCCESS 1 -# define ERROR 0 -# include -# include -# include -# include -# include -# include -#endif diff --git a/push_swap/Makefile b/push_swap/Makefile new file mode 100644 index 0000000..cab95f2 --- /dev/null +++ b/push_swap/Makefile @@ -0,0 +1,71 @@ +# **************************************************************************** # +# # +# ::: :::::::: # +# Makefile :+: :+: :+: # +# +:+ +:+ +:+ # +# By: mahautlatinis +#+ +:+ +#+ */ +/* By: mahautlatinis b, 0, mem); else if (!ft_strcmp(action, "rrr")) rrr(mem->a, mem->b, 0, mem); - else if (!ft_strcmp(action, "sa")) + else if (!ft_strcmp(action, "sa")) sa(mem->a, 0, mem); else if (!ft_strcmp(action, "sb")) sb(mem->b, 0, mem); diff --git a/srcs/common/.DS_Store b/push_swap/srcs/common/.DS_Store similarity index 100% rename from srcs/common/.DS_Store rename to push_swap/srcs/common/.DS_Store diff --git a/srcs/common/actions/push_stack.c b/push_swap/srcs/common/actions/push_stack.c similarity index 100% rename from srcs/common/actions/push_stack.c rename to push_swap/srcs/common/actions/push_stack.c diff --git a/srcs/common/actions/reverse_rotate_stack.c b/push_swap/srcs/common/actions/reverse_rotate_stack.c similarity index 100% rename from srcs/common/actions/reverse_rotate_stack.c rename to push_swap/srcs/common/actions/reverse_rotate_stack.c diff --git a/srcs/common/actions/rotate_stack.c b/push_swap/srcs/common/actions/rotate_stack.c similarity index 100% rename from srcs/common/actions/rotate_stack.c rename to push_swap/srcs/common/actions/rotate_stack.c diff --git a/srcs/common/actions/swap_stack.c b/push_swap/srcs/common/actions/swap_stack.c similarity index 100% rename from srcs/common/actions/swap_stack.c rename to push_swap/srcs/common/actions/swap_stack.c diff --git a/srcs/common/exit/exit.c b/push_swap/srcs/common/exit/exit.c similarity index 100% rename from srcs/common/exit/exit.c rename to push_swap/srcs/common/exit/exit.c diff --git a/srcs/common/parsing/parsing_utils.c b/push_swap/srcs/common/parsing/parsing_utils.c similarity index 100% rename from srcs/common/parsing/parsing_utils.c rename to push_swap/srcs/common/parsing/parsing_utils.c diff --git a/srcs/common/stack/stack_utils0.c b/push_swap/srcs/common/stack/stack_utils0.c similarity index 100% rename from srcs/common/stack/stack_utils0.c rename to push_swap/srcs/common/stack/stack_utils0.c diff --git a/srcs/common/stack/stack_utils1.c b/push_swap/srcs/common/stack/stack_utils1.c similarity index 100% rename from srcs/common/stack/stack_utils1.c rename to push_swap/srcs/common/stack/stack_utils1.c diff --git a/srcs/common/stack/stack_utils2.c b/push_swap/srcs/common/stack/stack_utils2.c similarity index 100% rename from srcs/common/stack/stack_utils2.c rename to push_swap/srcs/common/stack/stack_utils2.c diff --git a/srcs/common/stack/stack_utils3.c b/push_swap/srcs/common/stack/stack_utils3.c similarity index 100% rename from srcs/common/stack/stack_utils3.c rename to push_swap/srcs/common/stack/stack_utils3.c diff --git a/srcs/common/utils/utils0.c b/push_swap/srcs/common/utils/utils0.c similarity index 100% rename from srcs/common/utils/utils0.c rename to push_swap/srcs/common/utils/utils0.c diff --git a/srcs/include/checker_bonus/checker_bonus.h b/push_swap/srcs/include/checker_bonus/checker_bonus.h similarity index 100% rename from srcs/include/checker_bonus/checker_bonus.h rename to push_swap/srcs/include/checker_bonus/checker_bonus.h diff --git a/srcs/include/common/common.h b/push_swap/srcs/include/common/common.h similarity index 100% rename from srcs/include/common/common.h rename to push_swap/srcs/include/common/common.h diff --git a/srcs/include/sorter/sorter.h b/push_swap/srcs/include/sorter/sorter.h similarity index 100% rename from srcs/include/sorter/sorter.h rename to push_swap/srcs/include/sorter/sorter.h diff --git a/srcs/include/.DS_Store b/push_swap/srcs/sorter/.DS_Store similarity index 78% rename from srcs/include/.DS_Store rename to push_swap/srcs/sorter/.DS_Store index eaba4fb..733d2da 100644 Binary files a/srcs/include/.DS_Store and b/push_swap/srcs/sorter/.DS_Store differ diff --git a/srcs/sorter/long_suites/.DS_Store b/push_swap/srcs/sorter/long_suites/.DS_Store similarity index 100% rename from srcs/sorter/long_suites/.DS_Store rename to push_swap/srcs/sorter/long_suites/.DS_Store diff --git a/srcs/sorter/long_suites/step1_target_index.c b/push_swap/srcs/sorter/long_suites/step1_target_index.c similarity index 100% rename from srcs/sorter/long_suites/step1_target_index.c rename to push_swap/srcs/sorter/long_suites/step1_target_index.c diff --git a/srcs/sorter/long_suites/step2_keep_push.c b/push_swap/srcs/sorter/long_suites/step2_keep_push.c similarity index 76% rename from srcs/sorter/long_suites/step2_keep_push.c rename to push_swap/srcs/sorter/long_suites/step2_keep_push.c index 69208dd..ed9be08 100644 --- a/srcs/sorter/long_suites/step2_keep_push.c +++ b/push_swap/srcs/sorter/long_suites/step2_keep_push.c @@ -1,19 +1,17 @@ /* ************************************************************************** */ /* */ /* ::: :::::::: */ -/* step2.c :+: :+: :+: */ +/* step2_keep_push.c :+: :+: :+: */ /* +:+ +:+ +:+ */ -/* By: malatini +#+ +:+ +#+ */ +/* By: mahautlatinis -/* Compte la plus longue suite de target_index triés dans l'ordre croissant*/ -/* Va renseigner keep a true si bool define est true */ int largest_keep_a(t_s_elem *start, t_stack *stack, bool define) { t_s_elem *elem; @@ -43,7 +41,6 @@ int largest_keep_a(t_s_elem *start, t_stack *stack, bool define) return (count); } -/* Retourne l'adresse du premiere élément de la suite triée à garder sur A */ t_s_elem *get_max_keep(t_stack *stack) { t_s_elem *elem; @@ -58,15 +55,14 @@ t_s_elem *get_max_keep(t_stack *stack) cur = largest_keep_a(elem, stack, false); if (cur > max_keep) { - max_keep = cur; - max = elem; + max_keep = cur; + max = elem; } elem = elem->next; } return (max); } -/* Va determiner la plus longue suite d'index triés et mettre keep a true */ void set_keep(t_mem *mem) { t_s_elem *max; @@ -77,7 +73,6 @@ void set_keep(t_mem *mem) mem->maxsize = largest_keep_a(max, stack, true); } -/* Mets sur la stack B tous ceux dont keep = false */ void push_keep_false_b(t_mem *mem) { int size; diff --git a/srcs/sorter/long_suites/step3_find_shortest_action.c b/push_swap/srcs/sorter/long_suites/step3_find_shortest_action.c similarity index 100% rename from srcs/sorter/long_suites/step3_find_shortest_action.c rename to push_swap/srcs/sorter/long_suites/step3_find_shortest_action.c diff --git a/srcs/sorter/long_suites/step4_sort.c b/push_swap/srcs/sorter/long_suites/step4_sort.c similarity index 100% rename from srcs/sorter/long_suites/step4_sort.c rename to push_swap/srcs/sorter/long_suites/step4_sort.c diff --git a/srcs/sorter/main.c b/push_swap/srcs/sorter/main.c similarity index 100% rename from srcs/sorter/main.c rename to push_swap/srcs/sorter/main.c diff --git a/srcs/sorter/short_suites/short_suites.c b/push_swap/srcs/sorter/short_suites/short_suites.c similarity index 100% rename from srcs/sorter/short_suites/short_suites.c rename to push_swap/srcs/sorter/short_suites/short_suites.c diff --git a/push_swap_visualizer/.clang-format b/push_swap_visualizer/.clang-format deleted file mode 100644 index 33bf2a3..0000000 --- a/push_swap_visualizer/.clang-format +++ /dev/null @@ -1,137 +0,0 @@ ---- -Language: Cpp -# BasedOnStyle: LLVM -AccessModifierOffset: -2 -AlignAfterOpenBracket: Align -AlignConsecutiveMacros: false -AlignConsecutiveAssignments: false -AlignConsecutiveDeclarations: false -AlignEscapedNewlines: Right -AlignOperands: true -AlignTrailingComments: true -AllowAllArgumentsOnNextLine: true -AllowAllConstructorInitializersOnNextLine: true -AllowAllParametersOfDeclarationOnNextLine: true -AllowShortBlocksOnASingleLine: Never -AllowShortCaseLabelsOnASingleLine: false -AllowShortFunctionsOnASingleLine: All -AllowShortLambdasOnASingleLine: All -AllowShortIfStatementsOnASingleLine: Never -AllowShortLoopsOnASingleLine: false -AlwaysBreakAfterDefinitionReturnType: None -AlwaysBreakAfterReturnType: None -AlwaysBreakBeforeMultilineStrings: false -AlwaysBreakTemplateDeclarations: MultiLine -BinPackArguments: true -BinPackParameters: true -BraceWrapping: - AfterCaseLabel: false - AfterClass: false - AfterControlStatement: false - AfterEnum: false - AfterFunction: false - AfterNamespace: false - AfterObjCDeclaration: false - AfterStruct: false - AfterUnion: false - AfterExternBlock: false - BeforeCatch: false - BeforeElse: false - IndentBraces: false - SplitEmptyFunction: true - SplitEmptyRecord: true - SplitEmptyNamespace: true -BreakBeforeBinaryOperators: None -BreakBeforeBraces: Attach -BreakBeforeInheritanceComma: false -BreakInheritanceList: BeforeColon -BreakBeforeTernaryOperators: true -BreakConstructorInitializersBeforeComma: false -BreakConstructorInitializers: BeforeColon -BreakAfterJavaFieldAnnotations: false -BreakStringLiterals: true -ColumnLimit: 80 -CommentPragmas: '^ IWYU pragma:' -CompactNamespaces: false -ConstructorInitializerAllOnOneLineOrOnePerLine: false -ConstructorInitializerIndentWidth: 4 -ContinuationIndentWidth: 4 -Cpp11BracedListStyle: true -DeriveLineEnding: true -DerivePointerAlignment: false -DisableFormat: false -ExperimentalAutoDetectBinPacking: false -FixNamespaceComments: true -ForEachMacros: - - foreach - - Q_FOREACH - - BOOST_FOREACH -IncludeBlocks: Preserve -IncludeCategories: - - Regex: '^"(llvm|llvm-c|clang|clang-c)/' - Priority: 2 - SortPriority: 0 - - Regex: '^(<|"(gtest|gmock|isl|json)/)' - Priority: 3 - SortPriority: 0 - - Regex: '.*' - Priority: 1 - SortPriority: 0 -IncludeIsMainRegex: '(Test)?$' -IncludeIsMainSourceRegex: '' -IndentCaseLabels: false -IndentGotoLabels: true -IndentPPDirectives: None -IndentWidth: 2 -IndentWrappedFunctionNames: false -JavaScriptQuotes: Leave -JavaScriptWrapImports: true -KeepEmptyLinesAtTheStartOfBlocks: true -MacroBlockBegin: '' -MacroBlockEnd: '' -MaxEmptyLinesToKeep: 1 -NamespaceIndentation: None -ObjCBinPackProtocolList: Auto -ObjCBlockIndentWidth: 2 -ObjCSpaceAfterProperty: false -ObjCSpaceBeforeProtocolList: true -PenaltyBreakAssignment: 2 -PenaltyBreakBeforeFirstCallParameter: 19 -PenaltyBreakComment: 300 -PenaltyBreakFirstLessLess: 120 -PenaltyBreakString: 1000 -PenaltyBreakTemplateDeclaration: 10 -PenaltyExcessCharacter: 1000000 -PenaltyReturnTypeOnItsOwnLine: 60 -PointerAlignment: Right -ReflowComments: true -SortIncludes: true -SortUsingDeclarations: true -SpaceAfterCStyleCast: false -SpaceAfterLogicalNot: false -SpaceAfterTemplateKeyword: true -SpaceBeforeAssignmentOperators: true -SpaceBeforeCpp11BracedList: false -SpaceBeforeCtorInitializerColon: true -SpaceBeforeInheritanceColon: true -SpaceBeforeParens: ControlStatements -SpaceBeforeRangeBasedForLoopColon: true -SpaceInEmptyBlock: false -SpaceInEmptyParentheses: false -SpacesBeforeTrailingComments: 1 -SpacesInAngles: false -SpacesInConditionalStatement: false -SpacesInContainerLiterals: true -SpacesInCStyleCastParentheses: false -SpacesInParentheses: false -SpacesInSquareBrackets: false -SpaceBeforeSquareBrackets: false -Standard: Latest -StatementMacros: - - Q_UNUSED - - QT_REQUIRE_VERSION -TabWidth: 8 -UseCRLF: false -UseTab: Never -... - diff --git a/push_swap_visualizer/.gitignore b/push_swap_visualizer/.gitignore deleted file mode 100644 index 04fd5e6..0000000 --- a/push_swap_visualizer/.gitignore +++ /dev/null @@ -1,3 +0,0 @@ -__pycache__ -build/ -.vscode/ diff --git a/push_swap_visualizer/CMakeLists.txt b/push_swap_visualizer/CMakeLists.txt deleted file mode 100644 index 663fbb1..0000000 --- a/push_swap_visualizer/CMakeLists.txt +++ /dev/null @@ -1,12 +0,0 @@ -cmake_minimum_required(VERSION 3.16) -project(push_swap_visualizer - LANGUAGES CXX - VERSION 1.0 -) -set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/bin) - -add_subdirectory(dependencies) -add_subdirectory(src) -add_subdirectory(tests) - -configure_file(${CMAKE_CURRENT_SOURCE_DIR}/imgui.ini ${CMAKE_RUNTIME_OUTPUT_DIRECTORY}/imgui.ini COPYONLY) diff --git a/push_swap_visualizer/LICENSE b/push_swap_visualizer/LICENSE deleted file mode 100644 index 94a9ed0..0000000 --- a/push_swap_visualizer/LICENSE +++ /dev/null @@ -1,674 +0,0 @@ - GNU GENERAL PUBLIC LICENSE - Version 3, 29 June 2007 - - Copyright (C) 2007 Free Software Foundation, Inc. - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - - Preamble - - The GNU General Public License is a free, copyleft license for -software and other kinds of works. - - The licenses for most software and other practical works are designed -to take away your freedom to share and change the works. By contrast, -the GNU General Public License is intended to guarantee your freedom to -share and change all versions of a program--to make sure it remains free -software for all its users. We, the Free Software Foundation, use the -GNU General Public License for most of our software; it applies also to -any other work released this way by its authors. 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 -them 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 prevent others from denying you -these rights or asking you to surrender the rights. Therefore, you have -certain responsibilities if you distribute copies of the software, or if -you modify it: responsibilities to respect the freedom of others. - - For example, if you distribute copies of such a program, whether -gratis or for a fee, you must pass on to the recipients the same -freedoms that you received. 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. - - Developers that use the GNU GPL protect your rights with two steps: -(1) assert copyright on the software, and (2) offer you this License -giving you legal permission to copy, distribute and/or modify it. - - For the developers' and authors' protection, the GPL clearly explains -that there is no warranty for this free software. For both users' and -authors' sake, the GPL requires that modified versions be marked as -changed, so that their problems will not be attributed erroneously to -authors of previous versions. - - Some devices are designed to deny users access to install or run -modified versions of the software inside them, although the manufacturer -can do so. This is fundamentally incompatible with the aim of -protecting users' freedom to change the software. The systematic -pattern of such abuse occurs in the area of products for individuals to -use, which is precisely where it is most unacceptable. Therefore, we -have designed this version of the GPL to prohibit the practice for those -products. If such problems arise substantially in other domains, we -stand ready to extend this provision to those domains in future versions -of the GPL, as needed to protect the freedom of users. - - Finally, every program is threatened constantly by software patents. -States should not allow patents to restrict development and use of -software on general-purpose computers, but in those that do, we wish to -avoid the special danger that patents applied to a free program could -make it effectively proprietary. To prevent this, the GPL assures that -patents cannot be used to render the program non-free. - - The precise terms and conditions for copying, distribution and -modification follow. - - TERMS AND CONDITIONS - - 0. Definitions. - - "This License" refers to version 3 of the GNU General Public License. - - "Copyright" also means copyright-like laws that apply to other kinds of -works, such as semiconductor masks. - - "The Program" refers to any copyrightable work licensed under this -License. Each licensee is addressed as "you". "Licensees" and -"recipients" may be individuals or organizations. - - To "modify" a work means to copy from or adapt all or part of the work -in a fashion requiring copyright permission, other than the making of an -exact copy. The resulting work is called a "modified version" of the -earlier work or a work "based on" the earlier work. - - A "covered work" means either the unmodified Program or a work based -on the Program. - - To "propagate" a work means to do anything with it that, without -permission, would make you directly or secondarily liable for -infringement under applicable copyright law, except executing it on a -computer or modifying a private copy. Propagation includes copying, -distribution (with or without modification), making available to the -public, and in some countries other activities as well. - - To "convey" a work means any kind of propagation that enables other -parties to make or receive copies. Mere interaction with a user through -a computer network, with no transfer of a copy, is not conveying. - - An interactive user interface displays "Appropriate Legal Notices" -to the extent that it includes a convenient and prominently visible -feature that (1) displays an appropriate copyright notice, and (2) -tells the user that there is no warranty for the work (except to the -extent that warranties are provided), that licensees may convey the -work under this License, and how to view a copy of this License. If -the interface presents a list of user commands or options, such as a -menu, a prominent item in the list meets this criterion. - - 1. Source Code. - - The "source code" for a work means the preferred form of the work -for making modifications to it. "Object code" means any non-source -form of a work. - - A "Standard Interface" means an interface that either is an official -standard defined by a recognized standards body, or, in the case of -interfaces specified for a particular programming language, one that -is widely used among developers working in that language. - - The "System Libraries" of an executable work include anything, other -than the work as a whole, that (a) is included in the normal form of -packaging a Major Component, but which is not part of that Major -Component, and (b) serves only to enable use of the work with that -Major Component, or to implement a Standard Interface for which an -implementation is available to the public in source code form. A -"Major Component", in this context, means a major essential component -(kernel, window system, and so on) of the specific operating system -(if any) on which the executable work runs, or a compiler used to -produce the work, or an object code interpreter used to run it. - - The "Corresponding Source" for a work in object code form means all -the source code needed to generate, install, and (for an executable -work) run the object code and to modify the work, including scripts to -control those activities. However, it does not include the work's -System Libraries, or general-purpose tools or generally available free -programs which are used unmodified in performing those activities but -which are not part of the work. For example, Corresponding Source -includes interface definition files associated with source files for -the work, and the source code for shared libraries and dynamically -linked subprograms that the work is specifically designed to require, -such as by intimate data communication or control flow between those -subprograms and other parts of the work. - - The Corresponding Source need not include anything that users -can regenerate automatically from other parts of the Corresponding -Source. - - The Corresponding Source for a work in source code form is that -same work. - - 2. Basic Permissions. - - All rights granted under this License are granted for the term of -copyright on the Program, and are irrevocable provided the stated -conditions are met. This License explicitly affirms your unlimited -permission to run the unmodified Program. The output from running a -covered work is covered by this License only if the output, given its -content, constitutes a covered work. This License acknowledges your -rights of fair use or other equivalent, as provided by copyright law. - - You may make, run and propagate covered works that you do not -convey, without conditions so long as your license otherwise remains -in force. You may convey covered works to others for the sole purpose -of having them make modifications exclusively for you, or provide you -with facilities for running those works, provided that you comply with -the terms of this License in conveying all material for which you do -not control copyright. Those thus making or running the covered works -for you must do so exclusively on your behalf, under your direction -and control, on terms that prohibit them from making any copies of -your copyrighted material outside their relationship with you. - - Conveying under any other circumstances is permitted solely under -the conditions stated below. Sublicensing is not allowed; section 10 -makes it unnecessary. - - 3. Protecting Users' Legal Rights From Anti-Circumvention Law. - - No covered work shall be deemed part of an effective technological -measure under any applicable law fulfilling obligations under article -11 of the WIPO copyright treaty adopted on 20 December 1996, or -similar laws prohibiting or restricting circumvention of such -measures. - - When you convey a covered work, you waive any legal power to forbid -circumvention of technological measures to the extent such circumvention -is effected by exercising rights under this License with respect to -the covered work, and you disclaim any intention to limit operation or -modification of the work as a means of enforcing, against the work's -users, your or third parties' legal rights to forbid circumvention of -technological measures. - - 4. Conveying Verbatim Copies. - - You may convey 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; -keep intact all notices stating that this License and any -non-permissive terms added in accord with section 7 apply to the code; -keep intact all notices of the absence of any warranty; and give all -recipients a copy of this License along with the Program. - - You may charge any price or no price for each copy that you convey, -and you may offer support or warranty protection for a fee. - - 5. Conveying Modified Source Versions. - - You may convey a work based on the Program, or the modifications to -produce it from the Program, in the form of source code under the -terms of section 4, provided that you also meet all of these conditions: - - a) The work must carry prominent notices stating that you modified - it, and giving a relevant date. - - b) The work must carry prominent notices stating that it is - released under this License and any conditions added under section - 7. This requirement modifies the requirement in section 4 to - "keep intact all notices". - - c) You must license the entire work, as a whole, under this - License to anyone who comes into possession of a copy. This - License will therefore apply, along with any applicable section 7 - additional terms, to the whole of the work, and all its parts, - regardless of how they are packaged. This License gives no - permission to license the work in any other way, but it does not - invalidate such permission if you have separately received it. - - d) If the work has interactive user interfaces, each must display - Appropriate Legal Notices; however, if the Program has interactive - interfaces that do not display Appropriate Legal Notices, your - work need not make them do so. - - A compilation of a covered work with other separate and independent -works, which are not by their nature extensions of the covered work, -and which are not combined with it such as to form a larger program, -in or on a volume of a storage or distribution medium, is called an -"aggregate" if the compilation and its resulting copyright are not -used to limit the access or legal rights of the compilation's users -beyond what the individual works permit. Inclusion of a covered work -in an aggregate does not cause this License to apply to the other -parts of the aggregate. - - 6. Conveying Non-Source Forms. - - You may convey a covered work in object code form under the terms -of sections 4 and 5, provided that you also convey the -machine-readable Corresponding Source under the terms of this License, -in one of these ways: - - a) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by the - Corresponding Source fixed on a durable physical medium - customarily used for software interchange. - - b) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by a - written offer, valid for at least three years and valid for as - long as you offer spare parts or customer support for that product - model, to give anyone who possesses the object code either (1) a - copy of the Corresponding Source for all the software in the - product that is covered by this License, on a durable physical - medium customarily used for software interchange, for a price no - more than your reasonable cost of physically performing this - conveying of source, or (2) access to copy the - Corresponding Source from a network server at no charge. - - c) Convey individual copies of the object code with a copy of the - written offer to provide the Corresponding Source. This - alternative is allowed only occasionally and noncommercially, and - only if you received the object code with such an offer, in accord - with subsection 6b. - - d) Convey the object code by offering access from a designated - place (gratis or for a charge), and offer equivalent access to the - Corresponding Source in the same way through the same place at no - further charge. You need not require recipients to copy the - Corresponding Source along with the object code. If the place to - copy the object code is a network server, the Corresponding Source - may be on a different server (operated by you or a third party) - that supports equivalent copying facilities, provided you maintain - clear directions next to the object code saying where to find the - Corresponding Source. Regardless of what server hosts the - Corresponding Source, you remain obligated to ensure that it is - available for as long as needed to satisfy these requirements. - - e) Convey the object code using peer-to-peer transmission, provided - you inform other peers where the object code and Corresponding - Source of the work are being offered to the general public at no - charge under subsection 6d. - - A separable portion of the object code, whose source code is excluded -from the Corresponding Source as a System Library, need not be -included in conveying the object code work. - - A "User Product" is either (1) a "consumer product", which means any -tangible personal property which is normally used for personal, family, -or household purposes, or (2) anything designed or sold for incorporation -into a dwelling. In determining whether a product is a consumer product, -doubtful cases shall be resolved in favor of coverage. For a particular -product received by a particular user, "normally used" refers to a -typical or common use of that class of product, regardless of the status -of the particular user or of the way in which the particular user -actually uses, or expects or is expected to use, the product. A product -is a consumer product regardless of whether the product has substantial -commercial, industrial or non-consumer uses, unless such uses represent -the only significant mode of use of the product. - - "Installation Information" for a User Product means any methods, -procedures, authorization keys, or other information required to install -and execute modified versions of a covered work in that User Product from -a modified version of its Corresponding Source. The information must -suffice to ensure that the continued functioning of the modified object -code is in no case prevented or interfered with solely because -modification has been made. - - If you convey an object code work under this section in, or with, or -specifically for use in, a User Product, and the conveying occurs as -part of a transaction in which the right of possession and use of the -User Product is transferred to the recipient in perpetuity or for a -fixed term (regardless of how the transaction is characterized), the -Corresponding Source conveyed under this section must be accompanied -by the Installation Information. But this requirement does not apply -if neither you nor any third party retains the ability to install -modified object code on the User Product (for example, the work has -been installed in ROM). - - The requirement to provide Installation Information does not include a -requirement to continue to provide support service, warranty, or updates -for a work that has been modified or installed by the recipient, or for -the User Product in which it has been modified or installed. Access to a -network may be denied when the modification itself materially and -adversely affects the operation of the network or violates the rules and -protocols for communication across the network. - - Corresponding Source conveyed, and Installation Information provided, -in accord with this section must be in a format that is publicly -documented (and with an implementation available to the public in -source code form), and must require no special password or key for -unpacking, reading or copying. - - 7. Additional Terms. - - "Additional permissions" are terms that supplement the terms of this -License by making exceptions from one or more of its conditions. -Additional permissions that are applicable to the entire Program shall -be treated as though they were included in this License, to the extent -that they are valid under applicable law. If additional permissions -apply only to part of the Program, that part may be used separately -under those permissions, but the entire Program remains governed by -this License without regard to the additional permissions. - - When you convey a copy of a covered work, you may at your option -remove any additional permissions from that copy, or from any part of -it. (Additional permissions may be written to require their own -removal in certain cases when you modify the work.) You may place -additional permissions on material, added by you to a covered work, -for which you have or can give appropriate copyright permission. - - Notwithstanding any other provision of this License, for material you -add to a covered work, you may (if authorized by the copyright holders of -that material) supplement the terms of this License with terms: - - a) Disclaiming warranty or limiting liability differently from the - terms of sections 15 and 16 of this License; or - - b) Requiring preservation of specified reasonable legal notices or - author attributions in that material or in the Appropriate Legal - Notices displayed by works containing it; or - - c) Prohibiting misrepresentation of the origin of that material, or - requiring that modified versions of such material be marked in - reasonable ways as different from the original version; or - - d) Limiting the use for publicity purposes of names of licensors or - authors of the material; or - - e) Declining to grant rights under trademark law for use of some - trade names, trademarks, or service marks; or - - f) Requiring indemnification of licensors and authors of that - material by anyone who conveys the material (or modified versions of - it) with contractual assumptions of liability to the recipient, for - any liability that these contractual assumptions directly impose on - those licensors and authors. - - All other non-permissive additional terms are considered "further -restrictions" within the meaning of section 10. If the Program as you -received it, or any part of it, contains a notice stating that it is -governed by this License along with a term that is a further -restriction, you may remove that term. If a license document contains -a further restriction but permits relicensing or conveying under this -License, you may add to a covered work material governed by the terms -of that license document, provided that the further restriction does -not survive such relicensing or conveying. - - If you add terms to a covered work in accord with this section, you -must place, in the relevant source files, a statement of the -additional terms that apply to those files, or a notice indicating -where to find the applicable terms. - - Additional terms, permissive or non-permissive, may be stated in the -form of a separately written license, or stated as exceptions; -the above requirements apply either way. - - 8. Termination. - - You may not propagate or modify a covered work except as expressly -provided under this License. Any attempt otherwise to propagate or -modify it is void, and will automatically terminate your rights under -this License (including any patent licenses granted under the third -paragraph of section 11). - - However, if you cease all violation of this License, then your -license from a particular copyright holder is reinstated (a) -provisionally, unless and until the copyright holder explicitly and -finally terminates your license, and (b) permanently, if the copyright -holder fails to notify you of the violation by some reasonable means -prior to 60 days after the cessation. - - Moreover, your license from a particular copyright holder is -reinstated permanently if the copyright holder notifies you of the -violation by some reasonable means, this is the first time you have -received notice of violation of this License (for any work) from that -copyright holder, and you cure the violation prior to 30 days after -your receipt of the notice. - - Termination of your rights under this section does not terminate the -licenses of parties who have received copies or rights from you under -this License. If your rights have been terminated and not permanently -reinstated, you do not qualify to receive new licenses for the same -material under section 10. - - 9. Acceptance Not Required for Having Copies. - - You are not required to accept this License in order to receive or -run a copy of the Program. Ancillary propagation of a covered work -occurring solely as a consequence of using peer-to-peer transmission -to receive a copy likewise does not require acceptance. However, -nothing other than this License grants you permission to propagate or -modify any covered work. These actions infringe copyright if you do -not accept this License. Therefore, by modifying or propagating a -covered work, you indicate your acceptance of this License to do so. - - 10. Automatic Licensing of Downstream Recipients. - - Each time you convey a covered work, the recipient automatically -receives a license from the original licensors, to run, modify and -propagate that work, subject to this License. You are not responsible -for enforcing compliance by third parties with this License. - - An "entity transaction" is a transaction transferring control of an -organization, or substantially all assets of one, or subdividing an -organization, or merging organizations. If propagation of a covered -work results from an entity transaction, each party to that -transaction who receives a copy of the work also receives whatever -licenses to the work the party's predecessor in interest had or could -give under the previous paragraph, plus a right to possession of the -Corresponding Source of the work from the predecessor in interest, if -the predecessor has it or can get it with reasonable efforts. - - You may not impose any further restrictions on the exercise of the -rights granted or affirmed under this License. For example, you may -not impose a license fee, royalty, or other charge for exercise of -rights granted under this License, and you may not initiate litigation -(including a cross-claim or counterclaim in a lawsuit) alleging that -any patent claim is infringed by making, using, selling, offering for -sale, or importing the Program or any portion of it. - - 11. Patents. - - A "contributor" is a copyright holder who authorizes use under this -License of the Program or a work on which the Program is based. The -work thus licensed is called the contributor's "contributor version". - - A contributor's "essential patent claims" are all patent claims -owned or controlled by the contributor, whether already acquired or -hereafter acquired, that would be infringed by some manner, permitted -by this License, of making, using, or selling its contributor version, -but do not include claims that would be infringed only as a -consequence of further modification of the contributor version. For -purposes of this definition, "control" includes the right to grant -patent sublicenses in a manner consistent with the requirements of -this License. - - Each contributor grants you a non-exclusive, worldwide, royalty-free -patent license under the contributor's essential patent claims, to -make, use, sell, offer for sale, import and otherwise run, modify and -propagate the contents of its contributor version. - - In the following three paragraphs, a "patent license" is any express -agreement or commitment, however denominated, not to enforce a patent -(such as an express permission to practice a patent or covenant not to -sue for patent infringement). To "grant" such a patent license to a -party means to make such an agreement or commitment not to enforce a -patent against the party. - - If you convey a covered work, knowingly relying on a patent license, -and the Corresponding Source of the work is not available for anyone -to copy, free of charge and under the terms of this License, through a -publicly available network server or other readily accessible means, -then you must either (1) cause the Corresponding Source to be so -available, or (2) arrange to deprive yourself of the benefit of the -patent license for this particular work, or (3) arrange, in a manner -consistent with the requirements of this License, to extend the patent -license to downstream recipients. "Knowingly relying" means you have -actual knowledge that, but for the patent license, your conveying the -covered work in a country, or your recipient's use of the covered work -in a country, would infringe one or more identifiable patents in that -country that you have reason to believe are valid. - - If, pursuant to or in connection with a single transaction or -arrangement, you convey, or propagate by procuring conveyance of, a -covered work, and grant a patent license to some of the parties -receiving the covered work authorizing them to use, propagate, modify -or convey a specific copy of the covered work, then the patent license -you grant is automatically extended to all recipients of the covered -work and works based on it. - - A patent license is "discriminatory" if it does not include within -the scope of its coverage, prohibits the exercise of, or is -conditioned on the non-exercise of one or more of the rights that are -specifically granted under this License. You may not convey a covered -work if you are a party to an arrangement with a third party that is -in the business of distributing software, under which you make payment -to the third party based on the extent of your activity of conveying -the work, and under which the third party grants, to any of the -parties who would receive the covered work from you, a discriminatory -patent license (a) in connection with copies of the covered work -conveyed by you (or copies made from those copies), or (b) primarily -for and in connection with specific products or compilations that -contain the covered work, unless you entered into that arrangement, -or that patent license was granted, prior to 28 March 2007. - - Nothing in this License shall be construed as excluding or limiting -any implied license or other defenses to infringement that may -otherwise be available to you under applicable patent law. - - 12. No Surrender of Others' Freedom. - - If 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 convey a -covered work so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you may -not convey it at all. For example, if you agree to terms that obligate you -to collect a royalty for further conveying from those to whom you convey -the Program, the only way you could satisfy both those terms and this -License would be to refrain entirely from conveying the Program. - - 13. Use with the GNU Affero General Public License. - - Notwithstanding any other provision of this License, you have -permission to link or combine any covered work with a work licensed -under version 3 of the GNU Affero General Public License into a single -combined work, and to convey the resulting work. The terms of this -License will continue to apply to the part which is the covered work, -but the special requirements of the GNU Affero General Public License, -section 13, concerning interaction through a network will apply to the -combination as such. - - 14. Revised Versions of this License. - - The Free Software Foundation may publish revised and/or new versions of -the GNU 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 that a certain numbered version of the GNU General -Public License "or any later version" applies to it, you have the -option of following the terms and conditions either of that numbered -version or of any later version published by the Free Software -Foundation. If the Program does not specify a version number of the -GNU General Public License, you may choose any version ever published -by the Free Software Foundation. - - If the Program specifies that a proxy can decide which future -versions of the GNU General Public License can be used, that proxy's -public statement of acceptance of a version permanently authorizes you -to choose that version for the Program. - - Later license versions may give you additional or different -permissions. However, no additional obligations are imposed on any -author or copyright holder as a result of your choosing to follow a -later version. - - 15. Disclaimer of Warranty. - - 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. - - 16. Limitation of Liability. - - IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS -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. - - 17. Interpretation of Sections 15 and 16. - - If the disclaimer of warranty and limitation of liability provided -above cannot be given local legal effect according to their terms, -reviewing courts shall apply local law that most closely approximates -an absolute waiver of all civil liability in connection with the -Program, unless a warranty or assumption of liability accompanies a -copy of the Program in return for a fee. - - 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 -state 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 3 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, see . - -Also add information on how to contact you by electronic and paper mail. - - If the program does terminal interaction, make it output a short -notice like this when it starts in an interactive mode: - - Copyright (C) - This program 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, your program's commands -might be different; for a GUI interface, you would use an "about box". - - You should also get your employer (if you work as a programmer) or school, -if any, to sign a "copyright disclaimer" for the program, if necessary. -For more information on this, and how to apply and follow the GNU GPL, see -. - - The GNU 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. But first, please read -. diff --git a/push_swap_visualizer/README.md b/push_swap_visualizer/README.md deleted file mode 100644 index ed725d5..0000000 --- a/push_swap_visualizer/README.md +++ /dev/null @@ -1,32 +0,0 @@ -# Push Swap Visualizer -This project is a visualizer for the **"PUSH_SWAP"** 42 School Project. - -**Push Swap** is a program that takes as argument a space separated list of numbers and outputs a list of commands that can be used to sort them. - -You can read the subject [here](https://github.com/Binary-Hackers/42_Subjects/blob/master/00_Projects/02_Algorithmic/push_swap.pdf). - -## Usage -- In the **Values** window - - Choose the size of the push swap input with the slider [Optional] - - **Shuffle** the input [Optional] - - The space separated values should be filled automatically, you can also put your own values - - Set the Push Swap program path (Absolute or relative path). - - **Compute** the sort commands, it will display OK when done. -- In the **Controls** window - - **Load** the commands in the visualizer - - **Start** the animation - - Adjust the **Speed** as needed - - **Pause** and go **Step** by step to see the details of your algorithm. - - **Load** to restart the animation - -## Install -This project uses C++17, cmake, SFML and ImGui. -- Install a C++ compiler (gcc, clang,...) -- Install cmake -- create a 'build' subfolder -- cd in the build folder and type : - - 'cmake ..' - - 'make .' -- run the visualizer with ./bin/visualizer - -![](https://i.imgur.com/zqcsZfY.png) diff --git a/push_swap_visualizer/dependencies/CMakeLists.txt b/push_swap_visualizer/dependencies/CMakeLists.txt deleted file mode 100644 index 17c0ab5..0000000 --- a/push_swap_visualizer/dependencies/CMakeLists.txt +++ /dev/null @@ -1,31 +0,0 @@ -include(FetchContent) - -FetchContent_Declare( - sfml - URL https://github.com/SFML/SFML/releases/download/2.5.1/SFML-2.5.1-sources.zip -) - -FetchContent_Declare( - imgui - GIT_REPOSITORY https://github.com/ocornut/imgui - GIT_TAG 35b1148efb839381b84de9290d9caf0b66ad7d03 -) - -FetchContent_MakeAvailable(imgui) - -FetchContent_Declare( - imgui-sfml - GIT_REPOSITORY https://github.com/eliasdaler/imgui-sfml - GIT_TAG 82dc2033e51b8323857c3ae1cf1f458b3a933c35 -) - -add_subdirectory(imgui-sfml) -add_subdirectory(sfml) - -FetchContent_Declare( - catch2 - GIT_REPOSITORY https://github.com/catchorg/Catch2.git - GIT_TAG v2.13.7 -) - -add_subdirectory(catch2) diff --git a/push_swap_visualizer/dependencies/catch2/CMakeLists.txt b/push_swap_visualizer/dependencies/catch2/CMakeLists.txt deleted file mode 100644 index 9eddf24..0000000 --- a/push_swap_visualizer/dependencies/catch2/CMakeLists.txt +++ /dev/null @@ -1,4 +0,0 @@ -message(STATUS "Fetching Catch2...") - -FetchContent_MakeAvailable(catch2) -list(APPEND CMAKE_MODULE_PATH ${catch2_SOURCE_DIR}/contrib) diff --git a/push_swap_visualizer/dependencies/imgui-sfml/CMakeLists.txt b/push_swap_visualizer/dependencies/imgui-sfml/CMakeLists.txt deleted file mode 100644 index 9b8f449..0000000 --- a/push_swap_visualizer/dependencies/imgui-sfml/CMakeLists.txt +++ /dev/null @@ -1,7 +0,0 @@ -message(STATUS "Fetching ImGui-SFML...") - -set(IMGUI_DIR ${imgui_SOURCE_DIR}) -set(IMGUI_SFML_FIND_SFML OFF) -set(IMGUI_SFML_IMGUI_DEMO OFF) - -FetchContent_MakeAvailable(imgui-sfml) diff --git a/push_swap_visualizer/dependencies/sfml/CMakeLists.txt b/push_swap_visualizer/dependencies/sfml/CMakeLists.txt deleted file mode 100644 index a09f298..0000000 --- a/push_swap_visualizer/dependencies/sfml/CMakeLists.txt +++ /dev/null @@ -1,7 +0,0 @@ -message(STATUS "Fetching SFML...") - -# No need to build audio and network modules -set(SFML_BUILD_AUDIO FALSE) -set(SFML_BUILD_NETWORK FALSE) - -FetchContent_MakeAvailable(sfml) diff --git a/push_swap_visualizer/imgui.ini b/push_swap_visualizer/imgui.ini deleted file mode 100644 index 941895e..0000000 --- a/push_swap_visualizer/imgui.ini +++ /dev/null @@ -1,19 +0,0 @@ -[Window][Debug##Default] -Pos=60,60 -Size=400,400 -Collapsed=0 - -[Window][Controls] -Pos=975,47 -Size=205,101 -Collapsed=0 - -[Window][Commands] -Pos=1060,459 -Size=167,320 -Collapsed=0 - -[Window][Values] -Pos=1212,140 -Size=182,207 -Collapsed=0 diff --git a/push_swap_visualizer/include/gui.h b/push_swap_visualizer/include/gui.h deleted file mode 100644 index 6bb5b43..0000000 --- a/push_swap_visualizer/include/gui.h +++ /dev/null @@ -1,39 +0,0 @@ -#pragma once - -#include "pushswap.h" -#include "queues.h" -#include -#include -#include -#include -#include - -class Gui { -private: - enum class STATE {Running, Reverse, Stopped}; - Queues queues; - PushSwap pushswap; - - std::vector barsA; - std::vector barsB; - int generateNumberSize; - std::string numbers; - int speed; - STATE state; - float scale; - - void _updateControls(); - void _drawBars(); - void _animateQueue(sf::Clock &clock); - std::list _generateValues(const unsigned int size); - void _updateBars(); - sf::Color _rgb(const double ratio); - -public: - sf::RenderWindow _window; - - Gui(); - ~Gui(); - - void loop(); -}; diff --git a/push_swap_visualizer/include/pushswap.h b/push_swap_visualizer/include/pushswap.h deleted file mode 100644 index 987f052..0000000 --- a/push_swap_visualizer/include/pushswap.h +++ /dev/null @@ -1,17 +0,0 @@ -#pragma once - -#include -#include - -class PushSwap { -private: - std::list _split(const std::string &input, const char delimitor); - -public: - PushSwap(); - ~PushSwap(); - void run(const std::string &numbers); - - std::string path; - std::list commands; -}; diff --git a/push_swap_visualizer/include/queues.h b/push_swap_visualizer/include/queues.h deleted file mode 100644 index 75f6bb6..0000000 --- a/push_swap_visualizer/include/queues.h +++ /dev/null @@ -1,38 +0,0 @@ -#pragma once - -#include -#include - -class Queues { - enum COMMAND { NONE, SA, SB, SS, PA, PB, RA, RB, RR, RRA, RRB, RRR }; - std::map commandMap; - -public: - Queues(); - ~Queues(); - - void step(); - void stepBack(); - void start(const std::list &start); - - std::list commands; - std::list executedCommands; - std::list queueA; - std::list queueB; - -private: - void _executeCommand(const std::string &cmd); - void _executeReverseCommand(const std::string &cmd); - std::list _normalize(const std::list &numbers); - void _sa(); - void _sb(); - void _ss(); - void _pa(); - void _pb(); - void _ra(); - void _rb(); - void _rr(); - void _rra(); - void _rrb(); - void _rrr(); -}; diff --git a/push_swap_visualizer/include/utils.h b/push_swap_visualizer/include/utils.h deleted file mode 100644 index e2194d3..0000000 --- a/push_swap_visualizer/include/utils.h +++ /dev/null @@ -1,12 +0,0 @@ -#pragma once - -#include -#include - -namespace Utils { -std::list SplitStringToString(const std::string &s, - const char delimitor); -std::list SplitStringToInt(const std::string &s, - const char delimitor); - -} // namespace Utils diff --git a/push_swap_visualizer/push_swap b/push_swap_visualizer/push_swap deleted file mode 100755 index dae3bc8..0000000 Binary files a/push_swap_visualizer/push_swap and /dev/null differ diff --git a/push_swap_visualizer/src/CMakeLists.txt b/push_swap_visualizer/src/CMakeLists.txt deleted file mode 100644 index 04d36b5..0000000 --- a/push_swap_visualizer/src/CMakeLists.txt +++ /dev/null @@ -1,13 +0,0 @@ -add_library(VisualizerLib STATIC utils.cpp queues.cpp pushswap.cpp gui.cpp) - -target_link_libraries(VisualizerLib PUBLIC ImGui-SFML::ImGui-SFML) -target_include_directories(VisualizerLib PUBLIC "${CMAKE_CURRENT_SOURCE_DIR}/../include") -target_compile_features(VisualizerLib PRIVATE cxx_std_17) -target_compile_options(VisualizerLib PRIVATE -$<$:/W4 /WX> -$<$>:-Wall -Wextra -Wpedantic -Werror> -) - -add_executable(visualizer main.cpp) -target_compile_features(visualizer PRIVATE cxx_std_17) -target_link_libraries(visualizer PRIVATE VisualizerLib) diff --git a/push_swap_visualizer/src/gui.cpp b/push_swap_visualizer/src/gui.cpp deleted file mode 100644 index e24710f..0000000 --- a/push_swap_visualizer/src/gui.cpp +++ /dev/null @@ -1,239 +0,0 @@ -#include "gui.h" -#include "utils.h" -#include -#include -#include -#include -#include -#include - -Gui::Gui() - : generateNumberSize{0}, speed{1}, state{STATE::Stopped}, scale{1.0f}, - _window{sf::VideoMode::getDesktopMode(), "Push Swap Visualizer"} { - _window.setFramerateLimit(60); -} -Gui::~Gui() {} - -std::list Gui::_generateValues(const unsigned int size) { - std::vector values; - for (unsigned int v = 1; v <= size; ++v) { - values.push_back(v); - } - std::shuffle(values.begin(), values.end(), - std::mt19937{std::random_device{}()}); - std::list shuffledList; - std::move(values.begin(), values.end(), back_inserter(shuffledList)); - return shuffledList; -} - -void Gui::_updateBars() { - this->barsA.clear(); - this->barsB.clear(); - const sf::Vector2f windowSize = this->_window.getDefaultView().getSize(); - const uint64_t queuesSize{this->queues.queueA.size() + - this->queues.queueB.size()}; - if (queuesSize == 0) { - return; - } - const float barWidth = static_cast(windowSize.y) / queuesSize; - const float barUnit = static_cast(windowSize.x) / (2 * queuesSize + 2); - - const auto updateBar = [=](std::list queue, - std::vector &bar, - int deltaX = 0) { - int index{0}; - for (const int val : queue) { - bar.push_back( - sf::RectangleShape(sf::Vector2f((1 + val) * barUnit, barWidth))); - bar.back().setPosition(deltaX, index * barWidth); - bar.back().setFillColor(this->_rgb(static_cast(val) / queuesSize)); - index++; - } - }; - - updateBar(this->queues.queueA, this->barsA); - updateBar(this->queues.queueB, this->barsB, windowSize.x / 2); -} - -void Gui::_updateControls() { - ImGui::Begin("Controls"); - ImGui::SliderInt("Speed", &this->speed, 1, 240, "%i/s"); - - if (ImGui::Button("Load")) { - this->state = STATE::Stopped; - this->queues.start(Utils::SplitStringToInt(this->numbers, ' ')); - this->queues.commands = this->pushswap.commands; - } - - ImGui::SameLine(); - if (ImGui::Button("Start")) { - this->state = STATE::Running; - } - - ImGui::SameLine(); - if (ImGui::Button("Reverse")) { - this->state = STATE::Reverse; - } - - ImGui::SameLine(); - if (ImGui::Button("Pause")) { - this->state = STATE::Stopped; - } - - ImGui::SameLine(); - if (ImGui::Button("Step")) { - this->state = STATE::Stopped; - this->queues.step(); - } - - ImGui::SameLine(); - if (ImGui::Button("Step Back")) { - this->state = STATE::Stopped; - this->queues.stepBack(); - } - - ImGui::SliderFloat("Scale UI", &this->scale, 0.5f, 3.0f, "%.2f"); - ImGui::End(); - - ImGui::Begin("Values"); - ImGui::Text("Values to generate"); - ImGui::InputInt("Count", &this->generateNumberSize); - if (this->generateNumberSize < 0) { - this->generateNumberSize = 0; - } - - if (ImGui::Button("Shuffle")) { - unsigned int size = static_cast(this->generateNumberSize); - std::list valueInts = this->_generateValues(size); - std::string values; - for (const int value : valueInts) { - values += std::to_string(value) + ' '; - } - this->numbers = values; - } - - ImGui::Text("Space separated values"); - ImGui::InputText("Values", &this->numbers); - - ImGui::Text("push_swap file path"); - ImGui::InputText("", &this->pushswap.path); - if (ImGui::Button("Compute")) { - this->pushswap.run(this->numbers); - } - - std::string status{"..."}; - if (!this->pushswap.commands.empty()) { - status = "OK"; - } - ImGui::SameLine(); - ImGui::Text("%s", status.c_str()); - - ImGui::End(); - - ImGui::Begin("Commands"); - ImGui::Text("Count: %zu", this->pushswap.commands.size()); - ImGui::BeginChild("Scrolling"); - for (const auto &cmd : this->queues.commands) { - ImGui::Text("%s", cmd.c_str()); - } - ImGui::EndChild(); - ImGui::End(); -} - -void Gui::_drawBars() { - for (const auto &shape : this->barsA) { - this->_window.draw(shape); - } - for (const auto &shape : this->barsB) { - this->_window.draw(shape); - } -} - -void Gui::_animateQueue(sf::Clock &clock) { - float delta = clock.getElapsedTime().asSeconds(); - if (delta >= (1.0 / this->speed)) { - clock.restart(); - } - switch (this->state) { - case STATE::Running: { - int steps = static_cast(delta * this->speed); - for (int i = 0; i < steps; ++i) { - this->queues.step(); - } - break; - } - case STATE::Reverse: { - int steps = static_cast(delta * this->speed); - for (int i = 0; i < steps; ++i) { - this->queues.stepBack(); - } - break; - } - case STATE::Stopped: - break; - } -} - -void Gui::loop() { - ImGui::SFML::Init(_window); - - sf::Clock deltaClock; - sf::Clock stepClock; - while (_window.isOpen()) { - sf::Event event; - while (_window.pollEvent(event)) { - ImGui::SFML::ProcessEvent(event); - - if (event.type == sf::Event::Closed) { - _window.close(); - } - } - ImGui::GetIO().FontGlobalScale = this->scale; - this->_updateBars(); - ImGui::SFML::Update(this->_window, deltaClock.restart()); - - this->_updateControls(); - - this->_animateQueue(stepClock); - - _window.clear(); - - this->_drawBars(); - - ImGui::SFML::Render(_window); - _window.display(); - } - ImGui::SFML::Shutdown(); -} - -sf::Color Gui::_rgb(const double ratio) { - int normalized = static_cast(ratio * 256 * 4); - int region = normalized / 256; - int x = normalized % 256; - - sf::Color color; - color.a = 255; - switch (region) { - case 0: - color.r = 0; - color.g = x; - color.b = 255; - break; - case 1: - color.r = 0; - color.g = 255; - color.b = 255 - x; - break; - case 2: - color.r = x; - color.g = 255; - color.b = 0; - break; - case 3: - color.r = 255; - color.g = 255 - x; - color.b = 0; - break; - } - return color; -} diff --git a/push_swap_visualizer/src/main.cpp b/push_swap_visualizer/src/main.cpp deleted file mode 100644 index 08f5788..0000000 --- a/push_swap_visualizer/src/main.cpp +++ /dev/null @@ -1,7 +0,0 @@ -#include "gui.h" - -int main() { - Gui gui; - gui.loop(); - return 0; -} diff --git a/push_swap_visualizer/src/pushswap.cpp b/push_swap_visualizer/src/pushswap.cpp deleted file mode 100644 index 6b10e1e..0000000 --- a/push_swap_visualizer/src/pushswap.cpp +++ /dev/null @@ -1,27 +0,0 @@ -#include "pushswap.h" -#include "utils.h" -#include -#include -#include -#include -#include - -PushSwap::PushSwap() : path{"./push_swap"} {} -PushSwap::~PushSwap() {} - -void PushSwap::run(const std::string &numbers) { - this->commands.clear(); - std::array buffer; - std::string result; - std::string command = this->path + " " + numbers; - std::unique_ptr pipe(popen(command.c_str(), "r"), - pclose); - - if (!pipe) { - throw std::runtime_error("popen() failed!"); - } - while (fgets(buffer.data(), buffer.size(), pipe.get()) != nullptr) { - result += buffer.data(); - } - this->commands = Utils::SplitStringToString(result, '\n'); -} diff --git a/push_swap_visualizer/src/queues.cpp b/push_swap_visualizer/src/queues.cpp deleted file mode 100644 index 9da5b00..0000000 --- a/push_swap_visualizer/src/queues.cpp +++ /dev/null @@ -1,221 +0,0 @@ -#include "queues.h" -#include -#include -#include - -Queues::Queues() - : commandMap{ - {"sa", COMMAND::SA}, {"sb", COMMAND::SB}, {"ss", COMMAND::SS}, - {"pa", COMMAND::PA}, {"pb", COMMAND::PB}, {"ra", COMMAND::RA}, - {"rb", COMMAND::RB}, {"rr", COMMAND::RR}, {"rra", COMMAND::RRA}, - {"rrb", COMMAND::RRB}, {"rrr", COMMAND::RRR}, - } {} -Queues::~Queues() {} - -void Queues::step() { - if (this->commands.empty()) { - return; - } - this->_executeCommand(this->commands.front()); - this->executedCommands.push_front(this->commands.front()); - this->commands.pop_front(); -} - -void Queues::stepBack() { - if (this->executedCommands.empty()) { - return; - } - this->_executeReverseCommand(this->executedCommands.front()); - this->commands.push_front(this->executedCommands.front()); - this->executedCommands.pop_front(); -} - -std::list Queues::_normalize(const std::list &numbers) { - std::list normalized{numbers}; - std::vector ordered(numbers.size()); - std::copy(numbers.begin(), numbers.end(), ordered.begin()); - std::sort(ordered.begin(), ordered.end()); - for (int &number : normalized) { - const auto order = std::find(ordered.begin(), ordered.end(), number); - number = order - ordered.begin(); - } - return normalized; -} - -void Queues::start(const std::list &start) { - this->queueA = this->_normalize(start); - this->queueB.clear(); -} - -void Queues::_executeCommand(const std::string &cmd) { - COMMAND command{COMMAND::NONE}; - try { - command = this->commandMap[cmd]; - } catch (...) { - } - switch (command) { - case COMMAND::SA: - this->_sa(); - break; - case COMMAND::SB: - this->_sb(); - break; - case COMMAND::SS: - this->_ss(); - break; - case COMMAND::PA: - this->_pa(); - break; - case COMMAND::PB: - this->_pb(); - break; - case COMMAND::RA: - this->_ra(); - break; - case COMMAND::RB: - this->_rb(); - break; - case COMMAND::RR: - this->_rr(); - break; - case COMMAND::RRA: - this->_rra(); - break; - case COMMAND::RRB: - this->_rrb(); - break; - case COMMAND::RRR: - this->_rrr(); - break; - default: - break; - } -} - -void Queues::_executeReverseCommand(const std::string &cmd) { - COMMAND command{COMMAND::NONE}; - try { - command = this->commandMap[cmd]; - } catch (...) { - } - switch (command) { - case COMMAND::SA: - this->_sa(); - break; - case COMMAND::SB: - this->_sb(); - break; - case COMMAND::SS: - this->_ss(); - break; - case COMMAND::PA: - this->_pb(); - break; - case COMMAND::PB: - this->_pa(); - break; - case COMMAND::RA: - this->_rra(); - break; - case COMMAND::RB: - this->_rrb(); - break; - case COMMAND::RR: - this->_rrr(); - break; - case COMMAND::RRA: - this->_ra(); - break; - case COMMAND::RRB: - this->_rb(); - break; - case COMMAND::RRR: - this->_rr(); - break; - default: - break; - } -} - -void Queues::_sa() { - if (this->queueA.size() < 2) { - return; - } - std::swap(*this->queueA.begin(), *(++this->queueA.begin())); -} - -void Queues::_sb() { - if (this->queueB.size() < 2) { - return; - } - std::swap(*this->queueB.begin(), *(++this->queueB.begin())); -} - -void Queues::_ss() { - this->_sa(); - this->_sb(); -} - -void Queues::_pa() { - if (this->queueB.empty()) { - return; - } - int firstElement = this->queueB.front(); - this->queueB.pop_front(); - this->queueA.push_front(firstElement); -} - -void Queues::_pb() { - if (this->queueA.empty()) { - return; - } - int firstElement = this->queueA.front(); - this->queueA.pop_front(); - this->queueB.push_front(firstElement); -} - -void Queues::_ra() { - if (this->queueA.size() < 2) { - return; - } - int firstElement = this->queueA.front(); - this->queueA.pop_front(); - this->queueA.push_back(firstElement); -} - -void Queues::_rb() { - if (this->queueB.size() < 2) { - return; - } - int firstElement = this->queueB.front(); - this->queueB.pop_front(); - this->queueB.push_back(firstElement); -} - -void Queues::_rr() { - this->_ra(); - this->_rb(); -} - -void Queues::_rra() { - if (this->queueA.size() < 2) { - return; - } - int lastElement = this->queueA.back(); - this->queueA.pop_back(); - this->queueA.push_front(lastElement); -} - -void Queues::_rrb() { - if (this->queueB.size() < 2) { - return; - } - int lastElement = this->queueB.back(); - this->queueB.pop_back(); - this->queueB.push_front(lastElement); -} - -void Queues::_rrr() { - this->_rra(); - this->_rrb(); -} diff --git a/push_swap_visualizer/src/utils.cpp b/push_swap_visualizer/src/utils.cpp deleted file mode 100644 index 55160ed..0000000 --- a/push_swap_visualizer/src/utils.cpp +++ /dev/null @@ -1,27 +0,0 @@ -#include "utils.h" -#include -#include -#include - -namespace Utils { -std::list SplitStringToString(const std::string &s, - const char delimitor) { - std::stringstream ss(s); - std::string item; - std::list elems; - while (std::getline(ss, item, delimitor)) { - elems.push_back(item); - } - return elems; -} - -std::list SplitStringToInt(const std::string &s, const char delimitor) { - std::stringstream ss(s); - std::string item; - std::list elems; - while (std::getline(ss, item, delimitor)) { - elems.push_back(std::stoi(item)); - } - return elems; -} -} // namespace Utils diff --git a/push_swap_visualizer/tests/CMakeLists.txt b/push_swap_visualizer/tests/CMakeLists.txt deleted file mode 100644 index 3ea33d3..0000000 --- a/push_swap_visualizer/tests/CMakeLists.txt +++ /dev/null @@ -1,4 +0,0 @@ - -add_executable(tests test_queues.cpp test_pushswap.cpp) -target_link_libraries(tests PRIVATE Catch2::Catch2 VisualizerLib) -target_include_directories(tests PUBLIC "${CMAKE_CURRENT_SOURCE_DIR}/include") diff --git a/push_swap_visualizer/tests/test_pushswap.cpp b/push_swap_visualizer/tests/test_pushswap.cpp deleted file mode 100644 index 45bf00f..0000000 --- a/push_swap_visualizer/tests/test_pushswap.cpp +++ /dev/null @@ -1,10 +0,0 @@ -#include -#include "pushswap.h" - -TEST_CASE("run", "[PushSwap]") { - PushSwap ps; - ps.path = "../push_swap"; - ps.run("2 1 3"); - REQUIRE_FALSE(ps.commands.empty()); - REQUIRE(ps.commands.front() == "sa"); -} diff --git a/push_swap_visualizer/tests/test_queues.cpp b/push_swap_visualizer/tests/test_queues.cpp deleted file mode 100644 index c65ea06..0000000 --- a/push_swap_visualizer/tests/test_queues.cpp +++ /dev/null @@ -1,84 +0,0 @@ -#define CATCH_CONFIG_MAIN -#include -#include "queues.h" - -TEST_CASE("normalize", "[Queues]") { - Queues queues; - queues.start({2, 10, 4}); - auto it = queues.queueA.begin(); - REQUIRE(*it == 0); - REQUIRE(*(++it) == 2); - REQUIRE(*(++it) == 1); -} - -TEST_CASE("sa", "[Queues]") { - Queues queues; - queues.queueA = {1, 2, 3, 4}; - queues.commands = {"sa"}; - queues.step(); - REQUIRE(queues.queueA.front() == 2); - REQUIRE(*(++queues.queueA.begin()) == 1); -} - -TEST_CASE("sb", "[Queues]") { - Queues queues; - queues.queueB = {1, 2, 3, 4}; - queues.commands = {"sb"}; - queues.step(); - REQUIRE(queues.queueB.front() == 2); - REQUIRE(*(++queues.queueB.begin()) == 1); -} - -TEST_CASE("pa", "[Queues]") { - Queues queues; - queues.queueB = {1, 2, 3, 4}; - queues.commands = {"pa"}; - queues.step(); - REQUIRE(queues.queueB.front() == 2); - REQUIRE(queues.queueA.front() == 1); -} - -TEST_CASE("pb", "[Queues]") { - Queues queues; - queues.queueA = {1, 2, 3, 4}; - queues.commands = {"pb"}; - queues.step(); - REQUIRE(queues.queueA.front() == 2); - REQUIRE(queues.queueB.front() == 1); -} - -TEST_CASE("ra", "[Queues]") { - Queues queues; - queues.queueA = {1, 2, 3, 4}; - queues.commands = {"ra"}; - queues.step(); - REQUIRE(queues.queueA.front() == 2); - REQUIRE(queues.queueA.back() == 1); -} - -TEST_CASE("rb", "[Queues]") { - Queues queues; - queues.queueB = {1, 2, 3, 4}; - queues.commands = {"rb"}; - queues.step(); - REQUIRE(queues.queueB.front() == 2); - REQUIRE(queues.queueB.back() == 1); -} - -TEST_CASE("rra", "[Queues]") { - Queues queues; - queues.queueA = {1, 2, 3, 4}; - queues.commands = {"rra"}; - queues.step(); - REQUIRE(queues.queueA.front() == 4); - REQUIRE(queues.queueA.back() == 3); -} - -TEST_CASE("rrb", "[Queues]") { - Queues queues; - queues.queueB = {1, 2, 3, 4}; - queues.commands = {"rrb"}; - queues.step(); - REQUIRE(queues.queueB.front() == 4); - REQUIRE(queues.queueB.back() == 3); -} diff --git a/pyviz.py b/pyviz.py deleted file mode 100644 index b11b530..0000000 --- a/pyviz.py +++ /dev/null @@ -1,228 +0,0 @@ -#!/usr/bin/env python3 - - -from tkinter import * -from tkinter import ttk - -import sys -import time -import subprocess -import os -from math import sqrt - - -""" -__project__ = "push_swap visualizer" -__author__ = "Emmanuel Ruaud" -__email__ = "eruaud@student.le-101.fr" -This python script was created to visualize your work with the PUSH_SWAP -42 Project. -You must put this script in the same path or in a sibling path of your program -Of course you need Python3 with the builtin Tkinter. -You can install it with Brew. ---> Brew install python3 -Execute the script with : ---> python3 pyviz.py `ruby -e "puts (-200..200).to_a.shuffle.join(' ')"` -You can change the PUSHS_PATH to get to the relative path of your push_swap -You can decrease or increase the speed with the matching buttons. -""" - - -RELATIVE_PATH = r'push_swap' - - -class PsGui: - def __init__(self, master): - ww = 600 - wh = 600 - self.i = 0 - self.speed = 0 - dirname = os.path.dirname(os.path.abspath(__file__)) - PUSHS_PATH = os.path.join(dirname, RELATIVE_PATH) - self.pile_a = [int(num) for num in sys.argv[1:]] - self.first_pile = self.pile_a[:] - self.pile_b = [] - self.cmds = subprocess.check_output([PUSHS_PATH] + sys.argv[1:], stderr=subprocess.STDOUT, - timeout=12).splitlines() - self.prespeed = 1 / len(self.pile_a) - self.master = master - master.title("Push_swap viewer") - self.mainframe = Frame(master) - self.mainframe.pack(fill=BOTH) - self.can = Canvas(self.mainframe, width=ww, height=wh, bg="black") - self.can.pack(side=LEFT) - self.toolframe = Frame(self.mainframe) - self.toolframe.pack(side=RIGHT, fill=BOTH) - self.butframe = Frame(self.toolframe) - self.butframe.pack(side=TOP, fill=Y) - self.PrevCtl = Button(self.butframe, text="<<", command=self.speed_down) - self.PrevCtl.pack(side=LEFT) - self.PauseCtl = Button(self.butframe, text=">", command=self.pause) - self.PauseCtl.pack(side=LEFT) - self.NextCtl = Button(self.butframe, text=">>", command=self.speed_up) - self.NextCtl.pack(side=LEFT) - self.ResetCtl = Button(self.butframe, text="R", command=self.reset) - self.ResetCtl.pack(side=LEFT) - self.listbox = Listbox(self.toolframe, bg='black', fg='light cyan', - font=("monospace", 12), relief=FLAT) - self.listbox.pack(fill=BOTH, expand=1) - for cmd in self.cmds: - self.listbox.insert(END, cmd) - self.statusframe = Frame(master) - self.statusframe.pack(side=BOTTOM, fill=X) - self.speedmeter = Label(self.statusframe, - text='frame rate = ' + str(self.speed), - font=("monospace", 10)) - self.speedmeter.pack(side=LEFT) - self.totalcount = Label(self.statusframe, - text='- operations = ' + str(len(self.cmds)), - font=("monospace", 10)) - self.totalcount.pack(side=LEFT) - self.draw_rectangles() - self.launch() - - def reset(self): - self.speed = 0 - self.i = 0 - del self.pile_a[:] - self.pile_a = self.first_pile[:] - del self.pile_b[:] - self.can.delete("all") - self.draw_rectangles() - self.listbox.see(0) - self.PauseCtl.config(text='>') - self.launch() - - def pause(self): - if self.speed != 0: - self.prespeed = self.speed - self.speed = 0 - self.speedmeter.config(text='frame rate = 0') - self.PauseCtl.config(text='>') - else: - self.speed = self.prespeed - self.speedmeter.config(text='frame rate = ' \ - + '{:.2e}'.format(self.speed)) - self.PauseCtl.config(text='||') - - def speed_up(self): - if self.speed == 0: - self.PauseCtl.config(text='||') - self.speed = self.prespeed - self.speed = self.speed ** 2 - self.speedmeter.config(text='frame rate = ' \ - + '{:.2e}'.format(self.speed)) - - def speed_down(self): - self.speed = sqrt(self.speed) - self.speedmeter.config(text='frame rate = ' \ - + '{:.2e}'.format(self.speed)) - - def launch_cmds(self, cmd): - if cmd == b'sa' and len(self.pile_a) >= 2: - self.pile_a[0], self.pile_a[1] = self.pile_a[1], self.pile_a[0] - if cmd == b'sb' and len(self.pile_b) >= 2: - self.pile_b[0], self.pile_b[1] = self.pile_b[1], self.pile_b[0] - if cmd == b'ss': - if (len(self.pile_a) >= 2): - self.pile_a[0], self.pile_a[1] = self.pile_a[1], self.pile_a[0] - if (len(self.pile_b) >= 2): - self.pile_b[0], self.pile_b[1] = self.pile_b[1], self.pile_b[0] - if cmd == b'ra' and len(self.pile_a) >= 2: - self.pile_a.append(self.pile_a[0]) - del self.pile_a[0] - if cmd == b'rb' and len(self.pile_b) >= 2: - self.pile_b.append(self.pile_b[0]) - del self.pile_b[0] - if cmd == b'rr': - if (len(self.pile_a) >= 2): - self.pile_a.append(self.pile_a[0]) - del self.pile_a[0] - if (len(self.pile_b) >= 2): - self.pile_b.append(self.pile_b[0]) - del self.pile_b[0] - if cmd == b'rra' and len(self.pile_a) >= 2: - self.pile_a = [self.pile_a[-1]] + self.pile_a - del self.pile_a[-1] - if cmd == b'rrb' and len(self.pile_b) >= 2: - self.pile_b = [self.pile_b[-1]] + self.pile_b - del self.pile_b[-1] - if cmd == b'rrr': - if (len(self.pile_a) >= 2): - self.pile_a = [self.pile_a[-1]] + self.pile_a - del self.pile_a[-1] - if (len(self.pile_b) >= 2): - self.pile_b = [self.pile_b[-1]] + self.pile_b - del self.pile_b[-1] - if cmd == b'pa' and len(self.pile_b) >= 1: - self.pile_a = [self.pile_b[0]] + self.pile_a - del self.pile_b[0] - if cmd == b'pb' and len(self.pile_a) >= 1: - self.pile_b = [self.pile_a[0]] + self.pile_b - del self.pile_a[0] - return self.pile_a, self.pile_b - - def set_color(self, index): - col = '#%02x%02x%02x' % (int(255 * (index - 0.3) * (index > 0.3)), - int(255 * index - - ((510 * (index - 0.6)) * (index > 0.6))), - int((255 - 510 * index) * (index < 0.5))) - return col - - def draw_rectangles(self): - vi = 0 - ww = 600 - wh = 600 - hw = ww / 2 - hm = len(self.pile_a) + len(self.pile_b) - mx = max(self.pile_a + self.pile_b) - mn = min(self.pile_a + self.pile_b) - rects = [] - if len(self.pile_a) > 0: - a_val = [(num - mn) / (mx - mn) for num in self.pile_a] - for vala in a_val: - rects.append(self.can.create_rectangle(0, vi, - 10 + vala * (hw - 100), vi + wh / hm, - fill=self.set_color(vala), outline="")) - vi += wh / hm - vi = 0 - if len(self.pile_b) > 0: - b_val = [(num - mn) / (mx - mn) for num in self.pile_b] - for valb in b_val: - rects.append(self.can.create_rectangle(hw, vi, - hw + 10 + valb * (hw - 100), vi + wh / hm, - fill=self.set_color(valb), outline="")) - vi += wh / hm - - def launch(self): - while self.i < len(self.cmds): - if self.speed != 0: - while self.i < len(self.cmds): - self.listbox.activate(self.i) - self.can.delete("all") - self.pile_a, self.pile_b = \ - self.launch_cmds(self.cmds[self.i]) - self.draw_rectangles() - time.sleep(2 * self.speed) - self.can.update() - self.listbox.yview_scroll(1, 'units') - self.i += 1 - if self.speed == 0: - break - time.sleep(0.25) - self.can.update() - self.PauseCtl.config(text='>') - - -# root = Tk() -# root.resizable(width=False, height=False) -# gui = PsGui(root) -# root.mainloop() - -root = Tk() -frm = ttk.Frame(root, padding=10) -# frm.grid() -gui = PsGui(root) -ttk.Label(frm, text="PushSwap").grid(column=0, row=0) -ttk.Button(frm, text="Quit", command=root.destroy).grid(column=1, row=0) -root.mainloop() \ No newline at end of file diff --git a/srcs/.DS_Store b/srcs/.DS_Store deleted file mode 100644 index 194ba1d..0000000 Binary files a/srcs/.DS_Store and /dev/null differ diff --git a/srcs/common/actions/push_stack.o b/srcs/common/actions/push_stack.o deleted file mode 100644 index c45300f..0000000 Binary files a/srcs/common/actions/push_stack.o and /dev/null differ diff --git a/srcs/common/actions/reverse_rotate_stack.o b/srcs/common/actions/reverse_rotate_stack.o deleted file mode 100644 index 3920543..0000000 Binary files a/srcs/common/actions/reverse_rotate_stack.o and /dev/null differ diff --git a/srcs/common/actions/rotate_stack.o b/srcs/common/actions/rotate_stack.o deleted file mode 100644 index dbb3b4d..0000000 Binary files a/srcs/common/actions/rotate_stack.o and /dev/null differ diff --git a/srcs/common/actions/swap_stack.o b/srcs/common/actions/swap_stack.o deleted file mode 100644 index 40dd45c..0000000 Binary files a/srcs/common/actions/swap_stack.o and /dev/null differ diff --git a/srcs/common/exit/exit.o b/srcs/common/exit/exit.o deleted file mode 100644 index 61a4b9a..0000000 Binary files a/srcs/common/exit/exit.o and /dev/null differ diff --git a/srcs/common/parsing/parsing_utils.o b/srcs/common/parsing/parsing_utils.o deleted file mode 100644 index 6304469..0000000 Binary files a/srcs/common/parsing/parsing_utils.o and /dev/null differ diff --git a/srcs/common/stack/stack_utils0.o b/srcs/common/stack/stack_utils0.o deleted file mode 100644 index 31b3ccd..0000000 Binary files a/srcs/common/stack/stack_utils0.o and /dev/null differ diff --git a/srcs/common/stack/stack_utils1.o b/srcs/common/stack/stack_utils1.o deleted file mode 100644 index 1d6ac0a..0000000 Binary files a/srcs/common/stack/stack_utils1.o and /dev/null differ diff --git a/srcs/common/stack/stack_utils2.o b/srcs/common/stack/stack_utils2.o deleted file mode 100644 index 704120f..0000000 Binary files a/srcs/common/stack/stack_utils2.o and /dev/null differ diff --git a/srcs/common/stack/stack_utils3.o b/srcs/common/stack/stack_utils3.o deleted file mode 100644 index f4b3721..0000000 Binary files a/srcs/common/stack/stack_utils3.o and /dev/null differ diff --git a/srcs/common/utils/utils0.o b/srcs/common/utils/utils0.o deleted file mode 100644 index 1f642af..0000000 Binary files a/srcs/common/utils/utils0.o and /dev/null differ diff --git a/srcs/sorter/.DS_Store b/srcs/sorter/.DS_Store deleted file mode 100644 index 1899448..0000000 Binary files a/srcs/sorter/.DS_Store and /dev/null differ diff --git a/srcs/sorter/long_suites/step1_target_index.o b/srcs/sorter/long_suites/step1_target_index.o deleted file mode 100644 index 762eb72..0000000 Binary files a/srcs/sorter/long_suites/step1_target_index.o and /dev/null differ diff --git a/srcs/sorter/long_suites/step2_keep_push.o b/srcs/sorter/long_suites/step2_keep_push.o deleted file mode 100644 index ae3f4aa..0000000 Binary files a/srcs/sorter/long_suites/step2_keep_push.o and /dev/null differ diff --git a/srcs/sorter/long_suites/step3_find_shortest_action.o b/srcs/sorter/long_suites/step3_find_shortest_action.o deleted file mode 100644 index 0e13881..0000000 Binary files a/srcs/sorter/long_suites/step3_find_shortest_action.o and /dev/null differ diff --git a/srcs/sorter/long_suites/step4_sort.o b/srcs/sorter/long_suites/step4_sort.o deleted file mode 100644 index 0c41d8e..0000000 Binary files a/srcs/sorter/long_suites/step4_sort.o and /dev/null differ diff --git a/srcs/sorter/main.o b/srcs/sorter/main.o deleted file mode 100644 index cd83043..0000000 Binary files a/srcs/sorter/main.o and /dev/null differ diff --git a/srcs/sorter/short_suites/short_suites.o b/srcs/sorter/short_suites/short_suites.o deleted file mode 100644 index ef9fac2..0000000 Binary files a/srcs/sorter/short_suites/short_suites.o and /dev/null differ