mp2i-vms.fr
__init__
This commit is contained in:
commit
e06a000d21
|
|
@ -0,0 +1,59 @@
|
|||
# Prerequisites
|
||||
*.d
|
||||
|
||||
# Object files
|
||||
*.o
|
||||
*.ko
|
||||
*.obj
|
||||
*.elf
|
||||
|
||||
# Linker output
|
||||
*.ilk
|
||||
*.map
|
||||
*.exp
|
||||
|
||||
# Precompiled Headers
|
||||
*.gch
|
||||
*.pch
|
||||
|
||||
# Libraries
|
||||
*.lib
|
||||
*.a
|
||||
*.la
|
||||
*.lo
|
||||
|
||||
# Shared objects (inc. Windows DLLs)
|
||||
*.dll
|
||||
*.so
|
||||
*.so.*
|
||||
*.dylib
|
||||
|
||||
# Executables
|
||||
*.exe
|
||||
*.out
|
||||
*.app
|
||||
*.i*86
|
||||
*.x86_64
|
||||
*.hex
|
||||
|
||||
# Debug files
|
||||
*.dSYM/
|
||||
*.su
|
||||
*.idb
|
||||
*.pdb
|
||||
|
||||
# Kernel Module Compile Results
|
||||
*.mod*
|
||||
*.cmd
|
||||
.tmp_versions/
|
||||
modules.order
|
||||
Module.symvers
|
||||
Mkfile.old
|
||||
dkms.conf
|
||||
|
||||
|
||||
obj/
|
||||
bin/
|
||||
output.csv
|
||||
*.log
|
||||
output-S3.csv
|
||||
|
|
@ -0,0 +1,8 @@
|
|||
# Default ignored files
|
||||
/shelf/
|
||||
/workspace.xml
|
||||
# Editor-based HTTP Client requests
|
||||
/httpRequests/
|
||||
# Datasource local storage ignored files
|
||||
/dataSources/
|
||||
/dataSources.local.xml
|
||||
|
|
@ -0,0 +1,103 @@
|
|||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="BackendCodeEditorSettings">
|
||||
<option name="/Default/Housekeeping/GlobalSettingsUpgraded/IsUpgraded/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppClangFormat/EnableClangFormatSupport/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/EditorConfig/EnableClangFormatSupport/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTILINE_BINARY_EXPRESSIONS_CHAIN/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTILINE_CALLS_CHAIN/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTILINE_EXPRESSION/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTILINE_FOR_STMT/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTIPLE_DECLARATION/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_TERNARY/@EntryValue" value="ALIGN_ALL" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/BLANK_LINES_AROUND_CLASS_DEFINITION/@EntryValue" value="1" type="int" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/KEEP_BLANK_LINES_IN_DECLARATIONS/@EntryValue" value="2" type="int" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/KEEP_BLANK_LINES_IN_CODE/@EntryValue" value="2" type="int" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/KEEP_USER_LINEBREAKS/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/INDENT_CASE_FROM_SWITCH/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/INDENT_COMMENT/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/INT_ALIGN_EQ/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SIMPLE_BLOCK_STYLE/@EntryValue" value="DO_NOT_CHANGE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_COMMA_IN_TEMPLATE_ARGS/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_COMMA_IN_TEMPLATE_PARAMS/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_FOR_SEMICOLON/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_FOR_SEMICOLON/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_UNARY_OPERATOR/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_ARRAY_ACCESS_BRACKETS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_CAST_EXPRESSION_PARENTHESES/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_EMPTY_INITIALIZER_BRACES/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_EMPTY_METHOD_PARENTHESES/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_INITIALIZER_BRACES/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPECIAL_ELSE_IF_TREATMENT/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_CAST_EXPRESSION_PARENTHESES/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_AFTER_BINARY_OPSIGN/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_BEFORE_TERNARY_OPSIGNS/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/TYPE_DECLARATION_BRACES/@EntryValue" value="END_OF_LINE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/OTHER_BRACES/@EntryValue" value="END_OF_LINE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/CASE_BLOCK_BRACES/@EntryValue" value="END_OF_LINE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/BLANK_LINES_AROUND_FUNCTION_DECLARATION/@EntryValue" value="1" type="int" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/BLANK_LINES_AROUND_FUNCTION_DEFINITION/@EntryValue" value="1" type="int" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/PLACE_WHILE_ON_NEW_LINE/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/PLACE_ELSE_ON_NEW_LINE/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/PLACE_CATCH_ON_NEW_LINE/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/NAMESPACE_INDENTATION/@EntryValue" value="All" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTILINE_ARGUMENT/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTILINE_EXTENDS_LIST/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTILINE_PARAMETER/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTILINE_TYPE_ARGUMENT/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ALIGN_MULTILINE_TYPE_PARAMETER/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/BLANK_LINES_AROUND_DECLARATIONS/@EntryValue" value="0" type="int" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/INDENT_ACCESS_SPECIFIERS_FROM_CLASS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/INDENT_CLASS_MEMBERS_FROM_ACCESS_SPECIFIERS/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/LINE_BREAK_AFTER_COLON_IN_MEMBER_INITIALIZER_LISTS/@EntryValue" value="ON_SINGLE_LINE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/MEMBER_INITIALIZER_LIST_STYLE/@EntryValue" value="DO_NOT_CHANGE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/PLACE_NAMESPACE_DEFINITIONS_ON_SAME_LINE/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_COLON_IN_BITFIELD_DECLARATOR/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_COLON_IN_BITFIELD_DECLARATOR/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_EXTENDS_COLON/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_EXTENDS_COLON/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_FOR_COLON/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_FOR_COLON/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_PTR_IN_DATA_MEMBER/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_PTR_IN_DATA_MEMBERS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_PTR_IN_METHOD/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_PTR_IN_NESTED_DECLARATOR/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_REF_IN_DATA_MEMBER/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_REF_IN_DATA_MEMBERS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_AFTER_REF_IN_METHOD/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_PTR_IN_ABSTRACT_DECL/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_PTR_IN_DATA_MEMBER/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_PTR_IN_DATA_MEMBERS/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_PTR_IN_METHOD/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_REF_IN_ABSTRACT_DECL/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_REF_IN_DATA_MEMBER/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_REF_IN_DATA_MEMBERS/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_REF_IN_METHOD/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_TEMPLATE_ARGS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BEFORE_TEMPLATE_PARAMS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_BETWEEN_CLOSING_ANGLE_BRACKETS_IN_TEMPLATE_ARGS/@EntryValue" value="true" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_EMPTY_TEMPLATE_PARAMS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_TEMPLATE_ARGS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_TEMPLATE_PARAMS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_DECLARATION_PARENTHESES/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/SPACE_WITHIN_EMPTY_BLOCKS/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_BEFORE_INVOCATION_LPAR/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_AFTER_INVOCATION_LPAR/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_BEFORE_INVOCATION_RPAR/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_BEFORE_DECLARATION_LPAR/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_AFTER_DECLARATION_LPAR/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_BEFORE_DECLARATION_RPAR/@EntryValue" value="false" type="bool" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_ARGUMENTS_STYLE/@EntryValue" value="WRAP_IF_LONG" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/WRAP_PARAMETERS_STYLE/@EntryValue" value="WRAP_IF_LONG" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/BREAK_TEMPLATE_DECLARATION/@EntryValue" value="LINE_BREAK" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/NAMESPACE_DECLARATION_BRACES/@EntryValue" value="END_OF_LINE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/FREE_BLOCK_BRACES/@EntryValue" value="END_OF_LINE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/INVOCABLE_DECLARATION_BRACES/@EntryValue" value="END_OF_LINE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/ANONYMOUS_METHOD_DECLARATION_BRACES/@EntryValue" value="END_OF_LINE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/INITIALIZER_BRACES/@EntryValue" value="END_OF_LINE_NO_SPACE" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/INDENT_STYLE/@EntryValue" value="Space" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/INDENT_SIZE/@EntryValue" value="4" type="int" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/CONTINUOUS_LINE_INDENT/@EntryValue" value="Double" type="string" />
|
||||
<option name="/Default/CodeStyle/CodeFormatting/CppFormatting/TAB_WIDTH/@EntryValue" value="4" type="int" />
|
||||
</component>
|
||||
</project>
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="ExternalStorageConfigurationManager" enabled="true" />
|
||||
<component name="MakefileSettings">
|
||||
<option name="linkedExternalProjectsSettings">
|
||||
<MakefileProjectSettings>
|
||||
<option name="externalProjectPath" value="$PROJECT_DIR$" />
|
||||
<option name="modules">
|
||||
<set>
|
||||
<option value="$PROJECT_DIR$" />
|
||||
</set>
|
||||
</option>
|
||||
<option name="version" value="2" />
|
||||
</MakefileProjectSettings>
|
||||
</option>
|
||||
</component>
|
||||
<component name="MakefileWorkspace" PROJECT_DIR="$PROJECT_DIR$" />
|
||||
</project>
|
||||
|
|
@ -0,0 +1,6 @@
|
|||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="VcsDirectoryMappings">
|
||||
<mapping directory="" vcs="Git" />
|
||||
</component>
|
||||
</project>
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
{
|
||||
"configurations": [
|
||||
{
|
||||
"name": "linux-gcc-x64",
|
||||
"includePath": [
|
||||
"${workspaceFolder}/**"
|
||||
],
|
||||
"compilerPath": "/usr/bin/gcc",
|
||||
"cStandard": "${default}",
|
||||
"cppStandard": "${default}",
|
||||
"intelliSenseMode": "linux-gcc-x64",
|
||||
"compilerArgs": [
|
||||
""
|
||||
]
|
||||
}
|
||||
],
|
||||
"version": 4
|
||||
}
|
||||
|
|
@ -0,0 +1,24 @@
|
|||
{
|
||||
"version": "0.2.0",
|
||||
"configurations": [
|
||||
{
|
||||
"name": "C/C++ Runner: Debug Session",
|
||||
"type": "cppdbg",
|
||||
"request": "launch",
|
||||
"args": [],
|
||||
"stopAtEntry": false,
|
||||
"externalConsole": false,
|
||||
"cwd": "/home/debian/Desktop/colloscope/src",
|
||||
"program": "/home/debian/Desktop/colloscope/src/build/Debug/outDebug",
|
||||
"MIMode": "gdb",
|
||||
"miDebuggerPath": "gdb",
|
||||
"setupCommands": [
|
||||
{
|
||||
"description": "Enable pretty-printing for gdb",
|
||||
"text": "-enable-pretty-printing",
|
||||
"ignoreFailures": true
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
}
|
||||
|
|
@ -0,0 +1,59 @@
|
|||
{
|
||||
"C_Cpp_Runner.cCompilerPath": "gcc",
|
||||
"C_Cpp_Runner.cppCompilerPath": "g++",
|
||||
"C_Cpp_Runner.debuggerPath": "gdb",
|
||||
"C_Cpp_Runner.cStandard": "",
|
||||
"C_Cpp_Runner.cppStandard": "",
|
||||
"C_Cpp_Runner.msvcBatchPath": "",
|
||||
"C_Cpp_Runner.useMsvc": false,
|
||||
"C_Cpp_Runner.warnings": [
|
||||
"-Wall",
|
||||
"-Wextra",
|
||||
"-Wpedantic",
|
||||
"-Wshadow",
|
||||
"-Wformat=2",
|
||||
"-Wcast-align",
|
||||
"-Wconversion",
|
||||
"-Wsign-conversion",
|
||||
"-Wnull-dereference"
|
||||
],
|
||||
"C_Cpp_Runner.msvcWarnings": [
|
||||
"/W4",
|
||||
"/permissive-",
|
||||
"/w14242",
|
||||
"/w14287",
|
||||
"/w14296",
|
||||
"/w14311",
|
||||
"/w14826",
|
||||
"/w44062",
|
||||
"/w44242",
|
||||
"/w14905",
|
||||
"/w14906",
|
||||
"/w14263",
|
||||
"/w44265",
|
||||
"/w14928"
|
||||
],
|
||||
"C_Cpp_Runner.enableWarnings": true,
|
||||
"C_Cpp_Runner.warningsAsError": false,
|
||||
"C_Cpp_Runner.compilerArgs": [],
|
||||
"C_Cpp_Runner.linkerArgs": [],
|
||||
"C_Cpp_Runner.includePaths": [],
|
||||
"C_Cpp_Runner.includeSearch": [
|
||||
"*",
|
||||
"**/*"
|
||||
],
|
||||
"C_Cpp_Runner.excludeSearch": [
|
||||
"**/build",
|
||||
"**/build/**",
|
||||
"**/.*",
|
||||
"**/.*/**",
|
||||
"**/.vscode",
|
||||
"**/.vscode/**"
|
||||
],
|
||||
"C_Cpp_Runner.useAddressSanitizer": false,
|
||||
"C_Cpp_Runner.useUndefinedSanitizer": false,
|
||||
"C_Cpp_Runner.useLeakSanitizer": false,
|
||||
"C_Cpp_Runner.showCompilationTime": false,
|
||||
"C_Cpp_Runner.useLinkTimeOptimization": false,
|
||||
"C_Cpp_Runner.msvcSecureNoWarnings": false
|
||||
}
|
||||
|
|
@ -0,0 +1,675 @@
|
|||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
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.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
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 <https://www.gnu.org/licenses/>.
|
||||
|
||||
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:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
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
|
||||
<https://www.gnu.org/licenses/>.
|
||||
|
||||
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
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
||||
|
||||
|
|
@ -0,0 +1,83 @@
|
|||
Mullaert
|
||||
MATH
|
||||
14 6 2 2024
|
||||
+
|
||||
Rapin
|
||||
MATH
|
||||
18 6 2 2024
|
||||
18 8 2 2024
|
||||
+
|
||||
Carpintero
|
||||
MATH
|
||||
13 7 2 2024
|
||||
14 7 2 2024
|
||||
+
|
||||
Oubaha
|
||||
MATH
|
||||
17 9 2 2024
|
||||
18 9 2 2024
|
||||
+
|
||||
Boully
|
||||
MATH
|
||||
14 7 2 2024
|
||||
15 7 2 2024
|
||||
+
|
||||
Bouverot
|
||||
MATH
|
||||
14 7 2 2024
|
||||
15 7 2 2024
|
||||
+
|
||||
Chevalier
|
||||
PHYSICS
|
||||
12 5 2 2024
|
||||
14 6 2 2024
|
||||
17 6 2 2024
|
||||
+
|
||||
Chibani
|
||||
PHYSICS
|
||||
16 9 2 2024
|
||||
+
|
||||
Poupy
|
||||
PHYSICS
|
||||
17 7 2 2024
|
||||
18 7 2 2024
|
||||
+
|
||||
Colin
|
||||
PHYSICS
|
||||
17 6 2 2024
|
||||
+
|
||||
De_Roux
|
||||
PHYSICS
|
||||
18 6 2 2024
|
||||
+
|
||||
Belaggoune
|
||||
ENGLISH
|
||||
14 6 2 2024
|
||||
14 8 2 2024
|
||||
15 8 2 2024
|
||||
+
|
||||
Herbaut
|
||||
ENGLISH
|
||||
13 5 2 2024
|
||||
+
|
||||
Le_Gouriellec
|
||||
ENGLISH
|
||||
14 7 2 2024
|
||||
15 7 2 2024
|
||||
+
|
||||
Mann
|
||||
ENGLISH
|
||||
16 7 2 2024
|
||||
17 7 2 2024
|
||||
+
|
||||
Rouvroy
|
||||
INFO
|
||||
14 7 2 2024
|
||||
16 7 2 2024
|
||||
+
|
||||
Jospin
|
||||
INFO
|
||||
12 5 2 2024
|
||||
13 5 2 2024
|
||||
+
|
||||
$
|
||||
|
|
@ -0,0 +1,34 @@
|
|||
12 5 2 2024
|
||||
13 5 2 2024
|
||||
14 6 2 2024
|
||||
14 6 2 2024
|
||||
14 6 2 2024
|
||||
17 6 2 2024
|
||||
17 6 2 2024
|
||||
18 6 2 2024
|
||||
13 7 2 2024
|
||||
14 7 2 2024
|
||||
14 7 2 2024
|
||||
14 7 2 2024
|
||||
14 7 2 2024
|
||||
14 7 2 2024+
|
||||
14 7 2 2024+
|
||||
14 7 2 2024+
|
||||
15 7 2 2024
|
||||
15 7 2 2024
|
||||
15 7 2 2024
|
||||
16 7 2 2024
|
||||
16 7 2 2024+
|
||||
16 7 2 2024+
|
||||
16 7 2 2024+
|
||||
17 7 2 2024
|
||||
17 7 2 2024
|
||||
18 7 2 2024
|
||||
14 8 2 2024
|
||||
15 8 2 2024
|
||||
18 8 2 2024
|
||||
18 8 2 2024
|
||||
16 9 2 2024
|
||||
17 9 2 2024
|
||||
18 9 2 2024
|
||||
$
|
||||
|
|
@ -0,0 +1,42 @@
|
|||
CC=gcc
|
||||
FLAGS=-g -Wall -Wextra -Wpedantic
|
||||
LFLAGS=
|
||||
|
||||
|
||||
all: bin/colloscope
|
||||
|
||||
test: bin/colloscope
|
||||
bin/colloscope -v S3-creneaux.txt 31 S3-colleurs.txt 16 7 15 3000 output-S3.csv 3 6
|
||||
|
||||
mem: bin/
|
||||
valgrind --leak-check=full ./bin/colloscope -v S3-creneaux.txt 31 S3-colleurs.txt 16 7 15 100 output-S3.csv 3 6
|
||||
|
||||
OBJECTS = obj/structure.o obj/algorithm.o obj/display.o obj/logger.o obj/main.o
|
||||
bin/colloscope: $(OBJECTS)
|
||||
@mkdir -p bin
|
||||
$(CC) -o $@ $(LFLAGS) $(FLAGS) $(OBJECTS)
|
||||
|
||||
obj/main.o: src/main.c
|
||||
@mkdir -p obj
|
||||
$(CC) -o $@ -c $(FLAGS) $<
|
||||
|
||||
obj/structure.o: src/structure.c src/structure.h
|
||||
@mkdir -p obj
|
||||
$(CC) -o $@ -c $(FLAGS) $<
|
||||
|
||||
obj/display.o: src/display.c src/display.h
|
||||
@mkdir -p obj
|
||||
$(CC) -o $@ -c $(FLAGS) $<
|
||||
|
||||
obj/algorithm.o: src/algorithm.c src/algorithm.h
|
||||
@mkdir -p obj
|
||||
$(CC) -o $@ -c $(FLAGS) $<
|
||||
|
||||
obj/logger.o: src/logger.c src/logger.h
|
||||
@mkdir -p obj
|
||||
$(CC) -o $@ -c $(FLAGS) $<
|
||||
|
||||
.PHONY: clean
|
||||
|
||||
clean:
|
||||
rm -rf bin/ obj/
|
||||
|
|
@ -0,0 +1,78 @@
|
|||
Carpintero
|
||||
MATH
|
||||
14 24 4 2024
|
||||
15 24 4 2024
|
||||
+
|
||||
Boully
|
||||
MATH
|
||||
14 24 4 2024
|
||||
15 24 4 2024
|
||||
+
|
||||
Mullaert
|
||||
MATH
|
||||
14 23 4 2024
|
||||
18 25 4 2024
|
||||
+
|
||||
Rapin
|
||||
MATH
|
||||
18 23 4 2024
|
||||
18 25 4 2024
|
||||
+
|
||||
Oubaha
|
||||
MATH
|
||||
17 26 4 2024
|
||||
18 26 4 2024
|
||||
+
|
||||
Le_Gouriellec
|
||||
ENGLISH
|
||||
14 24 4 2024
|
||||
15 24 4 2024
|
||||
+
|
||||
Mann
|
||||
ENGLISH
|
||||
16 24 4 2024
|
||||
17 24 4 2024
|
||||
+
|
||||
Belagoune
|
||||
ENGLISH
|
||||
14 23 4 2024
|
||||
17 23 4 2024
|
||||
18 23 4 2024
|
||||
+
|
||||
Herbaut
|
||||
ENGLISH
|
||||
17 23 4 2024
|
||||
+
|
||||
De_Roux
|
||||
PHYSICS
|
||||
18 25 4 2024
|
||||
+
|
||||
Chibani
|
||||
PHYSICS
|
||||
16 26 4 2024
|
||||
+
|
||||
Chevalier
|
||||
PHYSICS
|
||||
12 22 4 2024
|
||||
14 23 4 2024
|
||||
17 23 4 2024
|
||||
+
|
||||
Poupy
|
||||
PHYSICS
|
||||
17 24 4 2024
|
||||
18 24 4 2024
|
||||
+
|
||||
Colin
|
||||
PHYSICS
|
||||
17 23 4 2024
|
||||
+
|
||||
Rouvroy
|
||||
INFO
|
||||
14 24 4 2024
|
||||
+
|
||||
Jospin
|
||||
INFO
|
||||
12 22 4 2024
|
||||
13 22 4 2024
|
||||
+
|
||||
$
|
||||
|
|
@ -0,0 +1,32 @@
|
|||
12 22 4 2024
|
||||
12 22 4 2024+
|
||||
13 22 4 2024+
|
||||
14 23 4 2024
|
||||
14 23 4 2024
|
||||
14 23 4 2024
|
||||
17 23 4 2024
|
||||
17 23 4 2024
|
||||
17 23 4 2024
|
||||
17 23 4 2024
|
||||
18 23 4 2024
|
||||
18 23 4 2024
|
||||
14 24 4 2024+
|
||||
14 24 4 2024+
|
||||
14 24 4 2024+
|
||||
14 24 4 2024
|
||||
14 24 4 2024
|
||||
14 24 4 2024
|
||||
15 24 4 2024
|
||||
15 24 4 2024
|
||||
15 24 4 2024
|
||||
16 24 4 2024
|
||||
17 24 4 2024
|
||||
17 24 4 2024
|
||||
18 24 4 2024
|
||||
18 25 4 2024
|
||||
18 25 4 2024
|
||||
18 25 4 2024
|
||||
16 26 4 2024
|
||||
17 26 4 2024
|
||||
18 26 4 2024
|
||||
$
|
||||
|
|
@ -0,0 +1,25 @@
|
|||
14 23 4 2024
|
||||
A
|
||||
1
|
||||
2
|
||||
3
|
||||
+
|
||||
12 22 4 2024
|
||||
A
|
||||
1
|
||||
2
|
||||
3
|
||||
+
|
||||
14 24 4 2024
|
||||
A
|
||||
1
|
||||
2
|
||||
3
|
||||
+
|
||||
13 22 4 2024
|
||||
A
|
||||
1
|
||||
2
|
||||
3
|
||||
+
|
||||
$
|
||||
|
|
@ -0,0 +1,745 @@
|
|||
/*
|
||||
* Colloscope - A program that generates a colloscope for French 'classes prépas'
|
||||
* Copyright (C) 2024 Alexandre Aboujaib
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <time.h>
|
||||
|
||||
#include "logger.h"
|
||||
#include "structure.h"
|
||||
#include "algorithm.h"
|
||||
|
||||
bool is_equal_date(date d1, date d2) {
|
||||
return (d1.hour == d2.hour && d1.day == d2.day && d2.month == d1.month && d2.year == d1.year);
|
||||
}
|
||||
|
||||
int get_date_index(creneau* edt, int len_creneau, date d) {
|
||||
// could be done in log(n), I know
|
||||
// yields the 1st occurence of d in edt
|
||||
int x = -1;
|
||||
for(int i = 0; i < len_creneau; i++) {
|
||||
x = date_dist(d, edt[i].date);
|
||||
if(x >= 0) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
int get_next_friday(creneau* edt, int len_creneau, date d) {
|
||||
// could be done in log(n), I know again
|
||||
int x = -1;
|
||||
for(int i = 0; i < len_creneau; i++) {
|
||||
x = date_dist(d, edt[i].date);
|
||||
if(x >= 0 && (i == len_creneau-1 || date_dist(d, edt[i+1].date) - x > 1)) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
// typedef struct colleur {char* name; int namelen; topic mat; date* disp; int n_disp;} colleur;
|
||||
colleur* get_colleurs(colleur* cl, int len_cl, date d, int* how_many) {
|
||||
colleur* res = malloc(sizeof(colleur)*30); // max. 3 colles per creneau
|
||||
int ptr = 0;
|
||||
for(int i = 0; i < len_cl; i++) {
|
||||
for(int j = 0; j < cl[i].n_disp; j++) {
|
||||
if(is_equal_date(cl[i].disp[j], d)) {
|
||||
if(ptr >= 30) {
|
||||
warn("Too many colleurs detected for a creneau\n");
|
||||
}
|
||||
res[ptr] = cl[i];
|
||||
ptr++;
|
||||
j = cl[i].n_disp;
|
||||
}
|
||||
}
|
||||
}
|
||||
*how_many = ptr;
|
||||
return res;
|
||||
}
|
||||
|
||||
void swap(int* arr, int i, int j) {
|
||||
if(i != j) {
|
||||
arr[i] += arr[j];
|
||||
arr[j] = arr[i] - arr[j];
|
||||
arr[i] -= arr[j];
|
||||
}
|
||||
}
|
||||
|
||||
void generate_random_perm(int* arr, int len) {
|
||||
// generate a random perm of int between 0 and len-1
|
||||
for(int i = 0; i < len; i++) {
|
||||
arr[i] = i;
|
||||
}
|
||||
for(int i = 0; i < len; i++) {
|
||||
swap(arr, i, rand()%len);
|
||||
}
|
||||
}
|
||||
|
||||
void print_arr(int* arr, int len) {
|
||||
printf("[");
|
||||
for(int i = 0; i < len; i++) {
|
||||
printf("%d ", arr[i]);
|
||||
}
|
||||
printf("]\n");
|
||||
}
|
||||
|
||||
void add_colle(creneau* edt, colleur* chads, int grp, int id_edt, int id_chad) {
|
||||
edt[id_edt].group = grp;
|
||||
edt[id_edt].namelen = chads[id_chad].namelen;
|
||||
str_copy(chads[id_chad].name, chads[id_chad].namelen, edt[id_edt].name);
|
||||
edt[id_edt].mat = chads[id_chad].mat;
|
||||
}
|
||||
|
||||
void remove_colle(creneau* edt, int id_edt) {
|
||||
edt[id_edt].group = 0;
|
||||
edt[id_edt].namelen = 0;
|
||||
str_copy("none", 4, edt[id_edt].name);
|
||||
edt[id_edt].mat = NOTHING;
|
||||
}
|
||||
|
||||
void move_colle(creneau* edt, int len_edt, int id_src, int id_dest) {
|
||||
if((id_src < len_edt && id_src >= 0 && id_dest < len_edt && id_dest >= 0) == false) {
|
||||
printf("Bad\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
edt[id_dest].group = edt[id_src].group;
|
||||
edt[id_dest].namelen = edt[id_src].namelen;
|
||||
str_copy(edt[id_src].name, edt[id_src].namelen, edt[id_dest].name);
|
||||
edt[id_dest].mat = edt[id_src].mat;
|
||||
|
||||
remove_colle(edt, id_src);
|
||||
}
|
||||
|
||||
int mem_id(creneau* edt, int len_edt, int grp, char* colleur, int offset) {
|
||||
for(int i = offset; i < len_edt; i++) {
|
||||
if(edt[i].group == grp && str_equal(edt[i].name, colleur)) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
bool is_overlap(creneau* edt, int len_edt, int id) { // detect if a colleur has 2 colles at the same time
|
||||
int k = 1;
|
||||
while(id+k < len_edt && is_equal_date(edt[id].date, edt[id+k].date)) {
|
||||
if(str_equal(edt[id].name, edt[id+k].name)) {
|
||||
return true;
|
||||
}
|
||||
k++;
|
||||
}
|
||||
k = 1;
|
||||
while(id-k >= 0 && is_equal_date(edt[id].date, edt[id-k].date)) {
|
||||
if(str_equal(edt[id].name, edt[id-k].name)) {
|
||||
return true;
|
||||
}
|
||||
k++;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
bool is_overlap_creneau(creneau* edt, int len_edt, int id, int grp) { // detect if a group has 2 overlapping colles
|
||||
int k = 1;
|
||||
while((id+k < len_edt && edt[id+k].date.hour - edt[id].date.hour < edt[id].length) && edt[id+k].date.day == edt[id].date.day) {
|
||||
if(edt[id+k].group == grp) {
|
||||
return true;
|
||||
}
|
||||
k++;
|
||||
}
|
||||
k = 1;
|
||||
while(id-k >= 0 && is_equal_date(edt[id].date, edt[id-k].date)) {
|
||||
if(edt[id+k].group == grp) {
|
||||
return true;
|
||||
}
|
||||
k++;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
int free_math_space(creneau* edt, int len_edt, int id) {
|
||||
int k = 1;
|
||||
int howmany = 0;
|
||||
while(id+k < len_edt && is_equal_date(edt[id].date, edt[id+k].date)) {
|
||||
if(edt[id+k].mat == NOTHING || edt[id+k].mat == MATH) {
|
||||
howmany++;
|
||||
}
|
||||
k++;
|
||||
}
|
||||
k = 1;
|
||||
while(id-k >= 0 && is_equal_date(edt[id].date, edt[id-k].date)) {
|
||||
if(edt[id-k].mat == NOTHING || edt[id-k].mat == MATH) {
|
||||
howmany++;
|
||||
}
|
||||
k++;
|
||||
}
|
||||
return howmany;
|
||||
}
|
||||
|
||||
void add_colles_for_group_MP2I(int* weeks_len, creneau* edt, int len_edt, colleur* chads, int len_chads, int n_weeks, int grp, topic start_rotation, int mth, int inf, int* skip_count, int mat_halt, int info_app) {
|
||||
topic rotation = start_rotation; // physics/english rotation
|
||||
int math = mth; // math (3/4)
|
||||
int info = inf; // info (1/6)
|
||||
|
||||
int r; // randomize the 1st date
|
||||
int k = 0; // offset
|
||||
int halt = 0; // timeout in case a colle cannot be placed
|
||||
bool found; // interrupt in case a valid colle has been found
|
||||
|
||||
int remaining_to_add = 0; /* self-explainatory
|
||||
please note that this also tells what colle to add :
|
||||
1 = physics/english colle
|
||||
2 = math
|
||||
3 (not implemented) = info
|
||||
*/
|
||||
int len_dudes = 0; // length of colleur*
|
||||
|
||||
int len_perm = 0; // length of int*
|
||||
|
||||
int math_dude = 0; // length of colleur*
|
||||
int weeklen;
|
||||
|
||||
bool normal_skip = true;
|
||||
|
||||
for(int week = 0; week < n_weeks; week++) {
|
||||
|
||||
weeklen = weeks_len[week];
|
||||
// update what colles to add
|
||||
if(mat_halt == 1 || math == 0) {
|
||||
math = mat_halt-1;
|
||||
} else {
|
||||
remaining_to_add++;
|
||||
math--;
|
||||
}
|
||||
if(rotation == ENGLISH) {
|
||||
rotation = PHYSICS;
|
||||
} else {
|
||||
rotation = ENGLISH;
|
||||
}
|
||||
|
||||
remaining_to_add++; // physics/english
|
||||
|
||||
// initialize/reset variables
|
||||
r = rand()%weeklen;
|
||||
halt = 0;
|
||||
found = false;
|
||||
normal_skip = true;
|
||||
|
||||
info++;
|
||||
// info colle
|
||||
while(info >= info_app) {
|
||||
if(edt[k+r%weeklen].mat == NOTHING && edt[k+r%weeklen].length == 2) {
|
||||
// if creneau is empty
|
||||
// import all colleurs available
|
||||
colleur* dudes = get_colleurs(chads, len_chads, edt[k+r%weeklen].date, &len_dudes);
|
||||
len_perm = len_dudes;
|
||||
|
||||
// if there are colleurs available
|
||||
if(len_dudes != 0) {
|
||||
|
||||
// randomize the order of colleurs
|
||||
int* perm = malloc(sizeof(int)*len_perm);
|
||||
generate_random_perm(perm, len_perm);
|
||||
|
||||
// for each one of them, add his colle for selected group pf and only if
|
||||
// - he is a INFO colleur
|
||||
// if a colle has been addded, interrupt the for andwhile loops
|
||||
for(int dude = 0; dude < len_perm*(1-found); dude++) {
|
||||
if(dudes[perm[dude]].mat == INFO && edt[k+r%weeklen].allow_grps[grp-1] == true) {
|
||||
add_colle(edt, dudes, grp, k+r%weeklen, perm[dude]);
|
||||
found = true;
|
||||
info = 0;
|
||||
} else if(edt[k+r%weeklen].allow_grps[grp-1] == true) {
|
||||
normal_skip = false;
|
||||
}
|
||||
}
|
||||
free(perm);
|
||||
}
|
||||
free(dudes);
|
||||
}
|
||||
if(!found && halt > weeklen) {
|
||||
info = 0;
|
||||
*skip_count += (1-normal_skip);
|
||||
}
|
||||
r++;
|
||||
halt++;
|
||||
}
|
||||
// reset the variables
|
||||
r = rand()%weeklen;
|
||||
found = false;
|
||||
halt = 0;
|
||||
normal_skip = true;
|
||||
|
||||
// if there is a math colle to add, enter this loop
|
||||
while(remaining_to_add == 2) {
|
||||
|
||||
if(edt[k+r%weeklen].mat == NOTHING && edt[k+r%weeklen].length == 1) {
|
||||
// if creneau is empty
|
||||
// import all colleurs available
|
||||
colleur* dudes = get_colleurs(chads, len_chads, edt[k+r%weeklen].date, &len_dudes);
|
||||
len_perm = len_dudes;
|
||||
|
||||
// if there are colleurs available
|
||||
if(len_dudes != 0) {
|
||||
|
||||
// randomize the order of colleurs
|
||||
int* perm = malloc(sizeof(int)*len_perm);
|
||||
generate_random_perm(perm, len_perm);
|
||||
|
||||
// for each one of them, add his colle for selected group pf and only if
|
||||
// - he is a MATH colleur
|
||||
// - he does not have another colle at the same time (is_overlap)
|
||||
// if a colle has been addded, interrupt the for andwhile loops
|
||||
for(int dude = 0; dude < len_perm*(1-found); dude++) {
|
||||
if(dudes[perm[dude]].mat == MATH && edt[k+r%weeklen].allow_grps[grp-1] == true) {
|
||||
add_colle(edt, dudes, grp, k+r%weeklen, perm[dude]);
|
||||
if(is_overlap(edt, len_edt, k+r%weeklen)) {
|
||||
remove_colle(edt, k+r%weeklen);
|
||||
} else {
|
||||
found = true;
|
||||
remaining_to_add--;
|
||||
}
|
||||
}
|
||||
}
|
||||
free(perm);
|
||||
}
|
||||
free(dudes);
|
||||
}
|
||||
if(!found && halt > weeklen) {
|
||||
remaining_to_add--;
|
||||
*skip_count += 1;
|
||||
}
|
||||
r++;
|
||||
halt++;
|
||||
}
|
||||
// reset the variables
|
||||
r = rand()%weeklen;
|
||||
found = false;
|
||||
halt = 0;
|
||||
|
||||
// do it again for physics/english colles
|
||||
while(remaining_to_add == 1) {
|
||||
if(edt[k+r%weeklen].mat == NOTHING && edt[k+r%weeklen].length == 1) {
|
||||
colleur* dudes = get_colleurs(chads, len_chads, edt[k+r%weeklen].date, &len_dudes);
|
||||
len_perm = len_dudes;
|
||||
if(len_dudes != 0) {
|
||||
int* perm = malloc(sizeof(int)*len_perm);
|
||||
generate_random_perm(perm, len_perm);
|
||||
math_dude = 0;
|
||||
for(int dude = 0; dude < len_dudes; dude++) {
|
||||
if(dudes[dude].mat == MATH) {
|
||||
math_dude++;
|
||||
}
|
||||
}
|
||||
for(int dude = 0; dude < len_perm*(1-found); dude++) {
|
||||
if(dudes[perm[dude]].mat == rotation && edt[k+r%weeklen].allow_grps[grp-1] == true) {
|
||||
add_colle(edt, dudes, grp, k+r%weeklen, perm[dude]);
|
||||
if(math_dude > free_math_space(edt, len_edt, k+r%weeklen) || is_overlap(edt, len_edt, k+r%weeklen)) {
|
||||
remove_colle(edt, k+r%weeklen);
|
||||
} else {
|
||||
found = true;
|
||||
remaining_to_add--;
|
||||
}
|
||||
}
|
||||
}
|
||||
free(perm);
|
||||
}
|
||||
free(dudes);
|
||||
}
|
||||
if(!found && halt > weeks_len[week]) {
|
||||
remaining_to_add--;
|
||||
*skip_count += 1;
|
||||
}
|
||||
r++;
|
||||
halt++;
|
||||
}
|
||||
|
||||
k += weeks_len[week];
|
||||
remaining_to_add = 0;
|
||||
}
|
||||
}
|
||||
|
||||
void write_to_file(char* filename, creneau* edt, int len_edt) {
|
||||
FILE* ptr = fopen(filename, "w");
|
||||
fprintf(ptr, "hour,day,month,year,length,group,colleur,matiere\n");
|
||||
for(int i = 0; i < len_edt; i++) {
|
||||
fprintf(ptr, "%d,%d,%d,%d,%d,%d,%s,", edt[i].date.hour, edt[i].date.day, edt[i].date.month, edt[i].date.year, edt[i].length, edt[i].group, edt[i].name);
|
||||
if(edt[i].mat == NOTHING) {
|
||||
fprintf(ptr, "_");
|
||||
} else if(edt[i].mat == MATH) {
|
||||
fprintf(ptr, "Maths");
|
||||
} else if(edt[i].mat == PHYSICS) {
|
||||
fprintf(ptr, "Physique");
|
||||
} else if(edt[i].mat == ENGLISH) {
|
||||
fprintf(ptr, "Anglais");
|
||||
} else if(edt[i].mat == INFO) {
|
||||
fprintf(ptr, "Info");
|
||||
} else if(edt[i].mat == FRENCH) {
|
||||
fprintf(ptr, "Français");
|
||||
} else {
|
||||
fprintf(ptr, "Unknown");
|
||||
}
|
||||
fprintf(ptr, "\n");
|
||||
}
|
||||
fclose(ptr);
|
||||
}
|
||||
|
||||
int min(int x, int y) {
|
||||
if(x < y) {
|
||||
return x;
|
||||
}
|
||||
return y;
|
||||
}
|
||||
|
||||
int max(int x, int y) {
|
||||
if(x > y) {
|
||||
return x;
|
||||
}
|
||||
return y;
|
||||
}
|
||||
|
||||
int score(creneau* edt, int len_edt, int grp, int n_weeks) {
|
||||
int score = 100;
|
||||
|
||||
int dist = 0;
|
||||
for(int i = 0; i < len_edt; i++) {
|
||||
for(int j = i+1; j < len_edt; j++) {
|
||||
if(edt[i].group == grp && edt[j].group == grp) {
|
||||
dist = date_dist(edt[i].date, edt[j].date);
|
||||
if(dist == 0) {
|
||||
score -= 4;
|
||||
}
|
||||
/*if(str_equal(edt[i].name, edt[j].name)) {
|
||||
score -= max(0, 28-dist);
|
||||
}*/
|
||||
if(dist == 7 && edt[i].date.hour == edt[j].date.hour) {
|
||||
score -= 5;
|
||||
}
|
||||
if(dist < 5 && edt[i].date.hour == 18 && edt[j].date.hour == 18) {
|
||||
score -= 5;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
char** met = malloc(sizeof(char*)*3*n_weeks);
|
||||
int p = 0;
|
||||
for(int i = 0; i < len_edt; i++) {
|
||||
if(edt[i].group == grp) {
|
||||
met[p] = malloc(sizeof(char)*30);
|
||||
str_copy(edt[i].name, edt[i].namelen, met[p]);
|
||||
for(int k = p-1; k >= 0; k--) {
|
||||
if(str_equal(met[k], met[p])) {
|
||||
switch(edt[i].mat) {
|
||||
case MATH:
|
||||
score -= 12;
|
||||
break;
|
||||
case PHYSICS:
|
||||
score -= 12;
|
||||
break;
|
||||
case ENGLISH:
|
||||
score -= 12;
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
p++;
|
||||
}
|
||||
}
|
||||
|
||||
for(int f = 0; f < p; f++) {
|
||||
free(met[f]);
|
||||
}
|
||||
free(met);
|
||||
return score;
|
||||
}
|
||||
|
||||
int get_colleur_id(colleur* dudes, int n_dudes, char* target) {
|
||||
for(int i = 0; i < n_dudes; i++) {
|
||||
if(str_equal(dudes[i].name, target)) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
char* get_name_from_id(colleur* dudes, int n_dudes, int id) {
|
||||
for(int i = 0; i < n_dudes; i++) {
|
||||
if(id == dudes[i].id) {
|
||||
return dudes[i].name;
|
||||
}
|
||||
}
|
||||
return "none";
|
||||
}
|
||||
|
||||
topic get_mat_from_id(colleur* dudes, int n_dudes, int id) {
|
||||
for(int i = 0; i < n_dudes; i++) {
|
||||
if(id == dudes[i].id) {
|
||||
return dudes[i].mat;
|
||||
}
|
||||
}
|
||||
return NOTHING;
|
||||
}
|
||||
|
||||
int** generate_matrix(int lines, int columns, int def) {
|
||||
int** mat = malloc(sizeof(int*)*lines);
|
||||
for(int i = 0; i < lines; i++) {
|
||||
mat[i] = malloc(sizeof(int)*columns);
|
||||
for(int j = 0; j < columns; j++) {
|
||||
mat[i][j] = def;
|
||||
}
|
||||
}
|
||||
return mat;
|
||||
}
|
||||
|
||||
void destroy_matrix(int** m, int li) {
|
||||
for(int i = 0; i < li; i++) {
|
||||
free(m[i]);
|
||||
}
|
||||
free(m);
|
||||
}
|
||||
|
||||
bool retreive_indexes(creneau* edt, int len_edt, int* p1, int* p2, int g1, int g2, char* n1, char* n2, int n_weeks) {
|
||||
int* indexes_1 = malloc(sizeof(int)*n_weeks);
|
||||
int* indexes_2 = malloc(sizeof(int)*n_weeks);
|
||||
int ptr_1 = 0;
|
||||
int ptr_2 = 0;
|
||||
|
||||
for(int i = 0; i < len_edt; i++) {
|
||||
if(edt[i].group == g1 && str_equal(edt[i].name, n1)) {
|
||||
indexes_1[ptr_1] = i;
|
||||
ptr_1++;
|
||||
} else if(edt[i].group == g2 && str_equal(edt[i].name, n2)) {
|
||||
indexes_2[ptr_2] = i;
|
||||
ptr_2++;
|
||||
}
|
||||
}
|
||||
int j = 0;
|
||||
for(int i = 0; i < ptr_1; i++) {
|
||||
if(j >= ptr_2) {
|
||||
free(indexes_1);
|
||||
free(indexes_2);
|
||||
return false;
|
||||
} else {
|
||||
int friday_1 = get_next_friday(edt, len_edt, edt[indexes_1[i]].date);
|
||||
int friday_2 = get_next_friday(edt, len_edt, edt[indexes_2[j]].date);
|
||||
if(friday_1 == friday_2) {
|
||||
*p1 = indexes_1[i];
|
||||
*p2 = indexes_2[j];
|
||||
|
||||
free(indexes_1);
|
||||
free(indexes_2);
|
||||
return true;
|
||||
} else {
|
||||
if(friday_1 > friday_2) {
|
||||
i--;
|
||||
j++;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
free(indexes_1);
|
||||
free(indexes_2);
|
||||
return false;
|
||||
}
|
||||
|
||||
int** occurencies(creneau* edt, int len_edt, colleur* dudes, int n_groups, int n_colleurs, int n_weeks, bool is_debug) {
|
||||
int max_occ = 1;
|
||||
int** res = generate_matrix(n_groups, n_colleurs, 0);
|
||||
|
||||
for(int c = 0; c < len_edt; c++) {
|
||||
if(edt[c].group != 0) {
|
||||
res[edt[c].group-1][get_colleur_id(dudes, n_colleurs, edt[c].name)] += 1;
|
||||
}
|
||||
}
|
||||
|
||||
bool halt = false;
|
||||
for(int it = 0; it < 5*(1-is_debug); it++) {
|
||||
for(int grp = 0; grp < n_groups; grp++) {
|
||||
for(int dud = 0; dud < n_colleurs; dud++) {
|
||||
if(res[grp][dud] > max_occ && get_mat_from_id(dudes, n_colleurs, dud) != INFO) {
|
||||
for(int grp2 = 0; grp2 < n_groups*(1-halt); grp2++) {
|
||||
if(grp2 != grp) {
|
||||
for(int dud2 = 0; dud2 < n_colleurs*(1-halt); dud2++) {
|
||||
if(dud2 != dud && res[grp2][dud2] > max_occ && res[grp][dud2] < max_occ && res[grp2][dud] < max_occ && get_mat_from_id(dudes, n_colleurs, dud) == get_mat_from_id(dudes, n_colleurs, dud2)) {
|
||||
|
||||
int id_src;
|
||||
int id_dest;
|
||||
if(retreive_indexes(edt, len_edt, &id_src, &id_dest, grp+1, grp2+1, get_name_from_id(dudes, n_colleurs, dud), get_name_from_id(dudes, n_colleurs, dud2), n_weeks)) {;
|
||||
|
||||
if(id_src < 0 || id_dest < 0 || id_src >= len_edt || id_dest >= len_edt) {
|
||||
printf("Uh oh (%d %d)\n", id_src, id_dest);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
res[grp][dud] -= 1;
|
||||
res[grp2][dud2] -= 1;
|
||||
res[grp2][dud] += 1;
|
||||
res[grp][dud2] += 1;
|
||||
|
||||
edt[id_src].group += edt[id_dest].group;
|
||||
edt[id_dest].group = edt[id_src].group - edt[id_dest].group;
|
||||
edt[id_src].group -= edt[id_dest].group;
|
||||
|
||||
if(is_overlap_creneau(edt, len_edt, id_src, grp2+1)) {
|
||||
res[grp][dud] -= 1;
|
||||
res[grp2][dud2] -= 1;
|
||||
res[grp2][dud] += 1;
|
||||
res[grp][dud2] += 1;
|
||||
|
||||
edt[id_src].group += edt[id_dest].group;
|
||||
edt[id_dest].group = edt[id_src].group - edt[id_dest].group;
|
||||
edt[id_src].group -= edt[id_dest].group;
|
||||
} else if(is_overlap_creneau(edt, len_edt, id_dest, grp+1)) {
|
||||
res[grp][dud] -= 1;
|
||||
res[grp2][dud2] -= 1;
|
||||
res[grp2][dud] += 1;
|
||||
res[grp][dud2] += 1;
|
||||
|
||||
edt[id_src].group += edt[id_dest].group;
|
||||
edt[id_dest].group = edt[id_src].group - edt[id_dest].group;
|
||||
edt[id_src].group -= edt[id_dest].group;
|
||||
} else {
|
||||
halt = true;
|
||||
dud--;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
halt = false;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return res;
|
||||
}
|
||||
|
||||
void copy_matrix(int** src, int lines, int col, int** dest) {
|
||||
for(int i = 0; i < lines; i++) {
|
||||
for(int j = 0; j < col; j++) {
|
||||
dest[i][j] = src[i][j];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void aux_2(creneau* edt, int len_edt, colleur* chads, int len_chads, int n_groups, int n_weeks, int n_sim, char* outname, int math_halt, int info_app) {
|
||||
|
||||
int start = time(NULL);
|
||||
int* weeks_len = malloc(sizeof(int)*n_weeks);
|
||||
// this list is used to tell the above code what index of edt it has to go to search for a colle
|
||||
int ptr = 0;
|
||||
int current = 1;
|
||||
for(int k = 1; k < len_edt; k++) {
|
||||
if(date_dist(edt[k-1].date, edt[k].date) > 1 || k == len_edt-1) {
|
||||
weeks_len[ptr] = current + (k == len_edt - 1);
|
||||
current = 0;
|
||||
ptr++;
|
||||
}
|
||||
current++;
|
||||
}
|
||||
//printf("----------------------------\n");
|
||||
|
||||
int* group_stats = malloc(sizeof(int)*n_groups);
|
||||
int* group_temp = malloc(sizeof(int)*n_groups);
|
||||
|
||||
int max_score = -900000;
|
||||
int global_min = 0;
|
||||
int global_skipped = 0;
|
||||
int screwed_group = 0;
|
||||
int local_score = 0;
|
||||
int local_min = 0;
|
||||
int local_group = 0;
|
||||
int temp = 0;
|
||||
int skipped = 0;
|
||||
int a = 0;
|
||||
int** occ_data = generate_matrix(n_groups, len_chads, 0);;
|
||||
info("Testing %d combinations...", n_sim);
|
||||
printf("\n");
|
||||
for(int k = 0; k < n_sim*(1 - (max_score == n_groups*100)); k++) {
|
||||
if(k >= a) {
|
||||
printf("\x1b[1F");
|
||||
printf("\x1b[2K");
|
||||
info("%d%% Completed (current max is %d/%d)", 100*a/n_sim, max_score, 100*n_groups);
|
||||
a += n_sim/100;
|
||||
}
|
||||
local_score = 0;
|
||||
local_min = 100;
|
||||
skipped = 0;
|
||||
for(int i = 0; i < n_groups; i++) {
|
||||
add_colles_for_group_MP2I(weeks_len, edt, len_edt, chads, len_chads, n_weeks, i+1, (topic)(2+i%2), i%math_halt, i%info_app, &skipped, math_halt, info_app);
|
||||
}
|
||||
int** temp_data = occurencies(edt, len_edt, chads, n_groups, len_chads, n_weeks, false);
|
||||
for(int i = 0; i < n_groups; i++) {
|
||||
temp = score(edt, len_edt, i+1, n_weeks);
|
||||
local_score += temp;
|
||||
group_temp[i] = temp;
|
||||
if(local_min > temp) {
|
||||
local_min = temp;
|
||||
local_group = i+1;
|
||||
}
|
||||
}
|
||||
local_score -= skipped*30;
|
||||
if(local_score > max_score) {
|
||||
max_score = local_score;
|
||||
screwed_group = local_group;
|
||||
global_min = local_min;
|
||||
global_skipped = skipped;
|
||||
for(int p = 0; p < n_groups; p++) {
|
||||
group_stats[p] = group_temp[p];
|
||||
}
|
||||
copy_matrix(temp_data, n_groups, len_chads, occ_data);
|
||||
write_to_file(outname, edt, len_edt);
|
||||
}
|
||||
for(int r = 0; r < len_edt; r++) {
|
||||
remove_colle(edt, r);
|
||||
}
|
||||
destroy_matrix(temp_data, n_groups);
|
||||
}
|
||||
|
||||
printf("\x1b[1F");
|
||||
printf("\x1b[2K");
|
||||
if(max_score == 100*n_groups) {
|
||||
info("Interrupting early due to a perfect score achieved");
|
||||
} else {
|
||||
info("100%% Completed, best score is %d/%d (without skip penalty) with %d skipped colle(s)", max_score+global_skipped*30, 100*n_groups, global_skipped);
|
||||
info("Most screwed group is %d with a score of %d/100", screwed_group, global_min);
|
||||
debug("Stats for all groups are :");
|
||||
for(int i = 0; i < n_groups; i++) {
|
||||
debug("Group %d : %d/100", i+1, group_stats[i]);
|
||||
}
|
||||
}
|
||||
int end = time(NULL);
|
||||
printf("\n");
|
||||
info("Here is all data regarding colles occurencies :");
|
||||
for(int k = 0; k < n_groups; k++) {
|
||||
printf("Group %d : ", (k+1)%10);
|
||||
print_arr(occ_data[k], len_chads);
|
||||
}
|
||||
info("Took %ds to find", end-start);
|
||||
free(group_stats);
|
||||
free(group_temp);
|
||||
free(weeks_len);
|
||||
destroy_matrix(occ_data, n_groups);
|
||||
}
|
||||
|
|
@ -0,0 +1,81 @@
|
|||
/*
|
||||
* Colloscope - A program that generates a colloscope for French 'classes prépas'
|
||||
* Copyright (C) 2024 Alexandre Aboujaib
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef ALGORITHM_H_INCLUDED
|
||||
#define ALGORITHM_H_INCLUDED
|
||||
|
||||
#include "structure.h"
|
||||
|
||||
bool is_equal_date(date d1, date d2);
|
||||
|
||||
int get_date_index(creneau* edt, int len_creneau, date d);
|
||||
|
||||
array get_all_date_index(creneau* edt, int len_edt, date d);
|
||||
|
||||
int get_next_friday(creneau* edt, int len_creneau, date d);
|
||||
|
||||
int get_fst_offset(creneau* edt, date d);
|
||||
|
||||
//bool is_allowed_MP2I(creneau* edt, int len_edt, int grp, date end);
|
||||
|
||||
//int heuristique_MP2I(creneau* edt, int len_edt, int grp, date end);
|
||||
|
||||
colleur *get_colleurs(colleur *cl, int len_cl, date d, int *how_many);
|
||||
|
||||
void add_colle(creneau *edt, colleur *chads, int grp, int id_edt, int id_chad);
|
||||
|
||||
void remove_colle(creneau *edt, int id_edt);
|
||||
|
||||
void move_colle(creneau* edt, int len_edt, int id_src, int id_dest);
|
||||
|
||||
void swap_colle(creneau* edt, int len_edt, int id_src, int id_dest);
|
||||
|
||||
int mem_id(creneau* edt, int len_edt, int grp, char* colleur, int offset);
|
||||
|
||||
bool is_overlap(creneau *edt, int len_edt, int id);
|
||||
|
||||
bool is_overlap_creneau(creneau* edt, int len_edt, int id, int grp);
|
||||
|
||||
int free_math_space(creneau *edt, int len_edt, int id);
|
||||
|
||||
void add_colles_for_group_MP2I(int *weeks_len, creneau *edt, int len_edt, colleur *chads, int len_chads, int n_weeks, int grp, topic start_rotation, int mth, int inf, int *skip_count, int math_halt, int info_app);
|
||||
|
||||
void write_to_file(char *filename, creneau *edt, int len_edt);
|
||||
|
||||
int score(creneau *edt, int len_edt, int grp, int n_weeks);
|
||||
|
||||
int get_colleur_id(colleur* dudes, int n_dudes, char* target);
|
||||
|
||||
char* get_name_from_id(colleur* dudes, int n_dudes, int id);
|
||||
|
||||
topic get_mat_from_id(colleur* dudes, int n_dudes, int id);
|
||||
|
||||
int** generate_matrix(int lines, int columns, int def);
|
||||
|
||||
void destroy_matrix(int** m, int li);
|
||||
|
||||
bool retreive_indexes(creneau* edt, int len_edt, int* p1, int* p2, int g1, int g2, char* n1, char* n2, int n_weeks);
|
||||
|
||||
int** occurencies(creneau* edt, int len_edt, colleur* dudes, int n_groups, int n_colleurs, int n_weeks, bool is_debug);
|
||||
|
||||
void copy_matrix(int** src, int lines, int col, int** dest);
|
||||
|
||||
void aux_2(creneau *edt, int len_edt, colleur *chads, int len_chads, int n_groups, int n_weeks, int n_sim, char *outname, int math_halt, int info_app);
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,323 @@
|
|||
/*
|
||||
* Colloscope - A program that generates a colloscope for French 'classes prépas'
|
||||
* Copyright (C) 2024 Alexandre Aboujaib
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#include <stdio.h>
|
||||
|
||||
#include "logger.h"
|
||||
#include "structure.h"
|
||||
|
||||
/*
|
||||
void remove_lanes(int n) {
|
||||
for(int i = 0; i < n; i++) {
|
||||
printf("\x1b[1F");
|
||||
printf("\x1b[2K");
|
||||
}
|
||||
}
|
||||
|
||||
void updateRenderer(SDL_Renderer* renderer) {
|
||||
SDL_RenderPresent(renderer);
|
||||
}
|
||||
|
||||
void resetRenderer(SDL_Renderer* renderer) {
|
||||
SDL_SetRenderDrawColor(renderer, 0, 0, 0, 255);
|
||||
SDL_RenderClear(renderer);
|
||||
}
|
||||
|
||||
void refreshRenderer(SDL_Renderer* renderer) {
|
||||
resetRenderer(renderer);
|
||||
updateRenderer(renderer);
|
||||
}
|
||||
|
||||
void drawRectToRenderer(SDL_Renderer* renderer, SDL_Rect* rect, int R, int G, int B, int A) {
|
||||
SDL_SetRenderDrawColor(renderer, R, G, B, A);
|
||||
SDL_RenderFillRect(renderer, rect);
|
||||
}
|
||||
|
||||
void placeRectToRenderer(SDL_Renderer* renderer, int X, int Y, int W, int H, int R, int G, int B, int A) {
|
||||
SDL_Rect rect;
|
||||
rect.x = X;
|
||||
rect.y = Y;
|
||||
rect.w = W;
|
||||
rect.h = H;
|
||||
SDL_SetRenderDrawColor(renderer, R, G, B, A);
|
||||
SDL_RenderFillRect(renderer, &rect);
|
||||
}
|
||||
|
||||
int ln_baseN(int n, int b) {
|
||||
int r = 0;
|
||||
while(n != 0) {
|
||||
n = n / b;
|
||||
r++;
|
||||
}
|
||||
return r;
|
||||
}
|
||||
|
||||
int pw(int x, int n) {
|
||||
if(n == 1) {
|
||||
return x;
|
||||
}
|
||||
return x*pw(x, n-1);
|
||||
}
|
||||
|
||||
void drawCharToRenderer(SDL_Renderer* renderer, char c, int X, int Y, int W, int H) {
|
||||
SDL_Rect rect;
|
||||
rect.x = X;
|
||||
rect.y = Y;
|
||||
rect.w = W;
|
||||
rect.h = H;
|
||||
SDL_Surface* img;
|
||||
switch(c) {
|
||||
case 'a':
|
||||
img = SDL_LoadBMP("./letters/letter-a.bmp");
|
||||
break;
|
||||
case 'b':
|
||||
img = SDL_LoadBMP("./letters/letter-b.bmp");
|
||||
break;
|
||||
case 'c':
|
||||
img = SDL_LoadBMP("./letters/letter-c.bmp");
|
||||
break;
|
||||
case 'd':
|
||||
img = SDL_LoadBMP("./letters/letter-d.bmp");
|
||||
break;
|
||||
case 'e':
|
||||
img = SDL_LoadBMP("./letters/letter-e.bmp");
|
||||
break;
|
||||
case 'f':
|
||||
img = SDL_LoadBMP("./letters/letter-f.bmp");
|
||||
break;
|
||||
case 'g':
|
||||
img = SDL_LoadBMP("./letters/letter-g.bmp");
|
||||
break;
|
||||
case 'h':
|
||||
img = SDL_LoadBMP("./letters/letter-h.bmp");
|
||||
break;
|
||||
case 'i':
|
||||
img = SDL_LoadBMP("./letters/letter-i.bmp");
|
||||
break;
|
||||
case 'j':
|
||||
img = SDL_LoadBMP("./letters/letter-j.bmp");
|
||||
break;
|
||||
case 'k':
|
||||
img = SDL_LoadBMP("./letters/letter-k.bmp");
|
||||
break;
|
||||
case 'l':
|
||||
img = SDL_LoadBMP("./letters/letter-l.bmp");
|
||||
break;
|
||||
case 'm':
|
||||
img = SDL_LoadBMP("./letters/letter-m.bmp");
|
||||
break;
|
||||
case 'n':
|
||||
img = SDL_LoadBMP("./letters/letter-n.bmp");
|
||||
break;
|
||||
case 'o':
|
||||
img = SDL_LoadBMP("./letters/letter-o.bmp");
|
||||
break;
|
||||
case 'p':
|
||||
img = SDL_LoadBMP("./letters/letter-p.bmp");
|
||||
break;
|
||||
case 'q':
|
||||
img = SDL_LoadBMP("./letters/letter-q.bmp");
|
||||
break;
|
||||
case 'r':
|
||||
img = SDL_LoadBMP("./letters/letter-r.bmp");
|
||||
break;
|
||||
case 's':
|
||||
img = SDL_LoadBMP("./letters/letter-s.bmp");
|
||||
break;
|
||||
case 't':
|
||||
img = SDL_LoadBMP("./letters/letter-t.bmp");
|
||||
break;
|
||||
case 'u':
|
||||
img = SDL_LoadBMP("./letters/letter-u.bmp");
|
||||
break;
|
||||
case 'v':
|
||||
img = SDL_LoadBMP("./letters/letter-v.bmp");
|
||||
break;
|
||||
case 'w':
|
||||
img = SDL_LoadBMP("./letters/letter-w.bmp");
|
||||
break;
|
||||
case 'x':
|
||||
img = SDL_LoadBMP("./letters/letter-x.bmp");
|
||||
break;
|
||||
case 'y':
|
||||
img = SDL_LoadBMP("./letters/letter-y.bmp");
|
||||
break;
|
||||
case 'z':
|
||||
img = SDL_LoadBMP("./letters/letter-z.bmp");
|
||||
break;
|
||||
case '-':
|
||||
img = SDL_LoadBMP("./digits/sign-minus.bmp");
|
||||
break;
|
||||
default:
|
||||
printf("Wait, thats illegal (%c)\n", c);
|
||||
break;
|
||||
}
|
||||
SDL_Texture* texture = SDL_CreateTextureFromSurface(renderer, img);
|
||||
SDL_FreeSurface(img);
|
||||
SDL_RenderCopy(renderer, texture, NULL, &rect);
|
||||
}
|
||||
|
||||
void drawStringToRenderer(SDL_Renderer* renderer, char* str, int X, int Y, int W, int H) {
|
||||
char c = str[0];
|
||||
int i = 0;
|
||||
int cX = X;
|
||||
while((int)(c) != 0) {
|
||||
if(c != ' ') {
|
||||
drawCharToRenderer(renderer, c, cX, Y, W, H);
|
||||
}
|
||||
i++;
|
||||
cX += W;
|
||||
c = str[i];
|
||||
}
|
||||
}
|
||||
|
||||
void drawDigitToRenderer(SDL_Renderer* renderer, int digit, int X, int Y, int W, int H) {
|
||||
assert(digit - digit%10 == 0 && digit >= 0);
|
||||
SDL_Rect rect;
|
||||
rect.x = X;
|
||||
rect.y = Y;
|
||||
rect.w = W;
|
||||
rect.h = H;
|
||||
SDL_Surface* img;
|
||||
switch(digit) {
|
||||
case 0 :
|
||||
img = SDL_LoadBMP("./digits/digit-0.bmp");
|
||||
break;
|
||||
case 1 :
|
||||
img = SDL_LoadBMP("./digits/digit-1.bmp");
|
||||
break;
|
||||
case 2 :
|
||||
img = SDL_LoadBMP("./digits/digit-2.bmp");
|
||||
break;
|
||||
case 3 :
|
||||
img = SDL_LoadBMP("./digits/digit-3.bmp");
|
||||
break;
|
||||
case 4 :
|
||||
img = SDL_LoadBMP("./digits/digit-4.bmp");
|
||||
break;
|
||||
case 5 :
|
||||
img = SDL_LoadBMP("./digits/digit-5.bmp");
|
||||
break;
|
||||
case 6 :
|
||||
img = SDL_LoadBMP("./digits/digit-6.bmp");
|
||||
break;
|
||||
case 7 :
|
||||
img = SDL_LoadBMP("./digits/digit-7.bmp");
|
||||
break;
|
||||
case 8 :
|
||||
img = SDL_LoadBMP("./digits/digit-8.bmp");
|
||||
break;
|
||||
case 9 :
|
||||
img = SDL_LoadBMP("./digits/digit-9.bmp");
|
||||
break;
|
||||
default:
|
||||
printf("Wait, thats illegal\n");
|
||||
break;
|
||||
}
|
||||
|
||||
SDL_Texture* texture = SDL_CreateTextureFromSurface(renderer, img);
|
||||
SDL_FreeSurface(img);
|
||||
SDL_RenderCopy(renderer, texture, NULL, &rect);
|
||||
}
|
||||
|
||||
void drawNumberToRenderer(SDL_Renderer* renderer, int n, int X, int Y, int W, int H, int Woffset) {
|
||||
if(n == 0) {
|
||||
drawDigitToRenderer(renderer, 0, X + W, Y, W, H);
|
||||
} else {
|
||||
int toDraw = 0, remaining = n, nIter = ln_baseN(n, 10);
|
||||
while(nIter != 0) {
|
||||
toDraw = remaining%10;
|
||||
remaining = remaining / 10;
|
||||
drawDigitToRenderer(renderer, toDraw, X + (W-Woffset)*nIter, Y, W, H);
|
||||
nIter--;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void drawDateToRenderer(SDL_Renderer* renderer, date d, int X, int Y, int W, int H) {
|
||||
int cX = X;
|
||||
drawNumberToRenderer(renderer, d.day, cX, Y, W, H, 0);
|
||||
cX += (1+ln_baseN(d.day, 10))*W;
|
||||
drawCharToRenderer(renderer, '-', cX, Y, W, H);
|
||||
drawNumberToRenderer(renderer, d.month, cX, Y, W, H, 0);
|
||||
cX += (1+ln_baseN(d.day, 10))*W;
|
||||
drawCharToRenderer(renderer, '-', cX, Y, W, H);
|
||||
drawNumberToRenderer(renderer, d.year, cX, Y, W, H, 0);
|
||||
}*/
|
||||
|
||||
void print_one_week(creneau* edt, int len_creneau, date start) { /*
|
||||
1) print names
|
||||
2) print weeks
|
||||
3) print groups */
|
||||
//resetRenderer(renderer);
|
||||
|
||||
//int wd = 75/3;
|
||||
//int ht = 105/3;
|
||||
|
||||
int i = 0;
|
||||
|
||||
// locate the specified week in edt
|
||||
while(i < len_creneau && (date_dist(start, edt[i].date) == -1)) {
|
||||
i++;
|
||||
}
|
||||
|
||||
//drawStringToRenderer(renderer, "from", 10, 10, wd, ht);
|
||||
//drawDateToRenderer(renderer, edt[i].date, 10+5*wd, 10, wd, ht);
|
||||
|
||||
// print the corresponding week
|
||||
while(i < len_creneau && (date_dist(start, edt[i].date) < 7)) {
|
||||
printf("Colle at [%d-%d-%d] (%dh for %dh) with group ", edt[i].date.day, edt[i].date.month, edt[i].date.year, edt[i].date.hour, edt[i].length);
|
||||
if(edt[i].group == 0) {
|
||||
printf("NONE ");
|
||||
} else {
|
||||
printf("%d ", edt[i].group);
|
||||
}
|
||||
printf("and colleur ");
|
||||
if(str_equal(edt[i].name, "empty")) {
|
||||
printf("NONE");
|
||||
} else {
|
||||
printf("%s", edt[i].name);
|
||||
}
|
||||
printf("\n");
|
||||
i++;
|
||||
}
|
||||
|
||||
/*
|
||||
if(i < len_creneau) {
|
||||
drawStringToRenderer(renderer, "to", width/2+3*wd, 10, wd, ht);
|
||||
drawDateToRenderer(renderer, edt[i].date, width/2+5*wd, 10, wd, ht);
|
||||
} else {
|
||||
drawStringToRenderer(renderer, "to", width/2+3*wd, 10, wd, ht);
|
||||
drawDateToRenderer(renderer, edt[i-1].date, width/2+5*wd, 10, wd, ht);
|
||||
}
|
||||
updateRenderer(renderer);*/
|
||||
//usleep(3000000);
|
||||
}
|
||||
|
||||
void print_all_edt(creneau* edt, int len_edt, int n_weeks, int len_oneweek) {
|
||||
for(int k = 0; k < n_weeks; k++) {
|
||||
print_one_week(edt, len_edt, edt[k*len_oneweek].date);
|
||||
}
|
||||
}
|
||||
|
||||
void print_all_colleurs(colleur* chads, int n_chads) {
|
||||
for(int c = 0; c < n_chads; c++) {
|
||||
info("Colleur %s with %d available :\n", chads[c].name, chads[c].n_disp);
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,31 @@
|
|||
/*
|
||||
* Colloscope - A program that generates a colloscope for French 'classes prépas'
|
||||
* Copyright (C) 2024 Alexandre Aboujaib
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DISPLAY_H_INCLUDED
|
||||
#define DISPLAY_H_INCLUDED
|
||||
|
||||
#include "structure.h"
|
||||
|
||||
void print_one_week(creneau *edt, int len_creneau, date start);
|
||||
|
||||
void print_all_edt(creneau *edt, int len_edt, int n_weeks, int len_oneweek);
|
||||
|
||||
void print_all_colleurs(colleur *chads, int n_chads);
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,162 @@
|
|||
/*
|
||||
* logger - un loggeur
|
||||
* Copyright (C) 2024 Valentin Moguérou
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <time.h>
|
||||
#include <stdarg.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "logger.h"
|
||||
Logger logger;
|
||||
|
||||
void create_logger(char* logpath, LogLevel level) {
|
||||
logger = malloc(sizeof(*logger));
|
||||
|
||||
logger->t0 = clock();
|
||||
logger->level = level;
|
||||
|
||||
if (logpath[0] != '\0')
|
||||
{
|
||||
logger->logfile = fopen(logpath, "w");
|
||||
}
|
||||
else
|
||||
logger->logfile = NULL;
|
||||
}
|
||||
|
||||
void destroy_logger() {
|
||||
if (logger->logfile != NULL)
|
||||
fclose(logger->logfile);
|
||||
free(logger);
|
||||
}
|
||||
|
||||
void logprint(LogLevel level, char* str, va_list args)
|
||||
{
|
||||
clock_t t = clock();
|
||||
va_list args2;
|
||||
va_copy(args2, args);
|
||||
|
||||
char label[6];
|
||||
char ansi_code[12];
|
||||
|
||||
switch (level)
|
||||
{
|
||||
case (LOG_PANIC):
|
||||
strcpy(label, "PANIC");
|
||||
strcpy(ansi_code, "\x1b[31;49m");
|
||||
break;
|
||||
case (LOG_FATAL):
|
||||
strcpy(label, "FATAL");
|
||||
strcpy(ansi_code, "\x1b[31;49m");
|
||||
break;
|
||||
case (LOG_ERROR):
|
||||
strcpy(label, "ERROR");
|
||||
strcpy(ansi_code, "\x1b[31;49m");
|
||||
break;
|
||||
case (LOG_WARN):
|
||||
strcpy(label, "WARN");
|
||||
strcpy(ansi_code, "\x1b[93;49m");
|
||||
break;
|
||||
case (LOG_INFO):
|
||||
strcpy(label, "INFO");
|
||||
strcpy(ansi_code, "\x1b[33;49m");
|
||||
break;
|
||||
case (LOG_DEBUG):
|
||||
strcpy(label, "DEBUG");
|
||||
strcpy(ansi_code, "\x1b[96;49m");
|
||||
break;
|
||||
case (LOG_TRACE):
|
||||
strcpy(label, "TRACE");
|
||||
strcpy(ansi_code, "\x1b[36;49m");
|
||||
break;
|
||||
}
|
||||
|
||||
FILE* stream = (level >= LOG_WARN) ? stderr : stdout;
|
||||
|
||||
if (level < logger->level)
|
||||
return;
|
||||
|
||||
fprintf(stream, "%s[%s][%f]: \033[0m", ansi_code, label, (double)t / CLOCKS_PER_SEC);
|
||||
vfprintf(stream, str, args);
|
||||
fprintf(stream, "\n");
|
||||
|
||||
if (logger->logfile != NULL)
|
||||
{
|
||||
fprintf(logger->logfile, "[%s][%f]: ", label, (double)t / CLOCKS_PER_SEC);
|
||||
vfprintf(logger->logfile, str, args2);
|
||||
fprintf(logger->logfile, "\n");
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void panic(char *str, ...)
|
||||
{
|
||||
va_list args;
|
||||
va_start(args, str);
|
||||
logprint(LOG_PANIC, str, args);
|
||||
va_end(args);
|
||||
}
|
||||
|
||||
void fatal(char *str, ...)
|
||||
{
|
||||
va_list args;
|
||||
va_start(args, str);
|
||||
logprint(LOG_FATAL, str, args);
|
||||
va_end(args);
|
||||
}
|
||||
|
||||
void error(char *str, ...)
|
||||
{
|
||||
va_list args;
|
||||
va_start(args, str);
|
||||
logprint(LOG_ERROR, str, args);
|
||||
va_end(args);
|
||||
}
|
||||
|
||||
void warn(char *str, ...)
|
||||
{
|
||||
va_list args;
|
||||
va_start(args, str);
|
||||
logprint(LOG_WARN, str, args);
|
||||
va_end(args);
|
||||
}
|
||||
|
||||
void info(char *str, ...)
|
||||
{
|
||||
va_list args;
|
||||
va_start(args, str);
|
||||
logprint(LOG_INFO, str, args);
|
||||
va_end(args);
|
||||
}
|
||||
|
||||
void debug(char *str, ...)
|
||||
{
|
||||
va_list args;
|
||||
va_start(args, str);
|
||||
logprint(LOG_DEBUG, str, args);
|
||||
va_end(args);
|
||||
}
|
||||
|
||||
void trace(char *str, ...)
|
||||
{
|
||||
va_list args;
|
||||
va_start(args, str);
|
||||
logprint(LOG_TRACE, str, args);
|
||||
va_end(args);
|
||||
}
|
||||
|
|
@ -0,0 +1,61 @@
|
|||
/*
|
||||
* logger - un loggeur
|
||||
* Copyright (C) 2024 Valentin Moguérou
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef LOGGER_H_INCLUDED
|
||||
#define LOGGER_H_INCLUDED
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <time.h>
|
||||
|
||||
|
||||
enum LogLevel {
|
||||
LOG_PANIC=6,
|
||||
LOG_FATAL=5,
|
||||
LOG_ERROR=4,
|
||||
LOG_WARN=3,
|
||||
LOG_INFO=2,
|
||||
LOG_DEBUG=1,
|
||||
LOG_TRACE=0
|
||||
};
|
||||
typedef enum LogLevel LogLevel;
|
||||
|
||||
struct Logger {
|
||||
clock_t t0;
|
||||
LogLevel level;
|
||||
FILE* logfile;
|
||||
};
|
||||
typedef struct Logger* Logger;
|
||||
|
||||
extern Logger logger;
|
||||
|
||||
|
||||
void create_logger(char *logpath, LogLevel level);
|
||||
void destroy_logger();
|
||||
|
||||
|
||||
void panic(char *str, ...);
|
||||
void fatal(char *str, ...);
|
||||
void error(char *str, ...);
|
||||
void warn(char *str, ...);
|
||||
void info(char *str, ...);
|
||||
void debug(char *str, ...);
|
||||
void trace(char *str, ...);
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,147 @@
|
|||
/*
|
||||
* Colloscope - A program that generates a colloscope for French 'classes prépas'
|
||||
* Copyright (C) 2024 Alexandre Aboujaib
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdbool.h>
|
||||
#include <time.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "logger.h"
|
||||
#include "structure.h"
|
||||
#include "algorithm.h"
|
||||
|
||||
// gcc -g -Wall -Wextra -Wpedantic main.c -lSDL2 -lSDL2_image -lm -o main
|
||||
// ./main MP2I-creneaux.txt 33 MP2I-colleurs.txt 16 6 15 output.csv
|
||||
|
||||
void print_help()
|
||||
{
|
||||
printf("Colloscope - A program that generates a colloscope for French 'classe prépas'. By Alexandre Aboujaib\n");
|
||||
printf("Licensed under the terms of the GNU GPL version 3 or later.\n\n");
|
||||
printf("Usage: colloscope [-qvh] <creneaux> <n_creneaux> <colleurs> <n_colleurs> <n_weeks> <n_groups> <n_iter> <output>\n\n");
|
||||
printf("Available options :\n");
|
||||
printf(" -q Quiet mode\n");
|
||||
printf(" -v Verbose mode\n");
|
||||
printf(" -h Print this help\n");
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
int offset;
|
||||
bool quiet=false;
|
||||
bool verbose=false;
|
||||
|
||||
if (argc==2 && strcmp(argv[1], "-h")==0)
|
||||
{
|
||||
print_help();
|
||||
exit(0);
|
||||
}
|
||||
else if (argc==11 && argv[1][0]!='-')
|
||||
{
|
||||
offset=0;
|
||||
}
|
||||
else if (argc==12 && argv[1][0]=='-')
|
||||
{
|
||||
offset=1;
|
||||
|
||||
for (char *ch=&argv[1][1]; *ch != '\0'; ch++)
|
||||
{
|
||||
switch (*ch)
|
||||
{
|
||||
case 'q':
|
||||
quiet=true; break;
|
||||
case 'v':
|
||||
verbose=true; break;
|
||||
default:
|
||||
fprintf(stderr, "Unknown option '%c'. Available: [-qvh].\n", *ch);
|
||||
}
|
||||
}
|
||||
|
||||
if (quiet && verbose)
|
||||
{
|
||||
fprintf(stderr, "You can't be both quiet and verbose!\n");
|
||||
}
|
||||
}
|
||||
else {
|
||||
fprintf(stderr, "Usage: %s [-qvh] <creneaux> <n_creneaux> <colleurs> <n_colleurs> <n_weeks> <n_groups> <n_iters> <output> <math_rest> <info_occ>\n", argv[0]);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
|
||||
char* path_creneaux = argv[1+offset];
|
||||
int n_creneaux = str_to_int(argv[2+offset]);
|
||||
char* path_colleurs = argv[3+offset];
|
||||
int n_colleurs = str_to_int(argv[4+offset]);
|
||||
int n_weeks = str_to_int(argv[5+offset]);
|
||||
int n_groups = str_to_int(argv[6+offset]);
|
||||
int n_iter = str_to_int(argv[7+offset]);
|
||||
char* path_output = argv[8+offset];
|
||||
int math_i = str_to_int(argv[9+offset]);
|
||||
int info_i = str_to_int(argv[10+offset]);
|
||||
|
||||
if (quiet) {
|
||||
create_logger("colloscope.log", LOG_WARN);
|
||||
} else if (verbose) {
|
||||
create_logger("colloscope.log", LOG_DEBUG);
|
||||
} else {
|
||||
create_logger("colloscope.log", LOG_INFO);
|
||||
}
|
||||
|
||||
//info("%d %d %d %d", n_creneaux, n_colleurs, n_weeks, n_groups);
|
||||
|
||||
info("Starting");
|
||||
srand(time(NULL));
|
||||
|
||||
//creneau* edt = import_creneaux("file.txt", 76);
|
||||
creneau* edt = import_creneaux_oneweek(path_creneaux, n_creneaux, n_weeks, n_groups);
|
||||
int len_edt = n_creneaux*n_weeks;
|
||||
|
||||
//colleur* dudes = import_colleurs("some_data.txt", 13, len_creneau);
|
||||
colleur* dudes = import_colleurs_oneweek(path_colleurs, n_colleurs, n_weeks, n_creneaux);
|
||||
|
||||
import_tds(edt, len_edt, n_creneaux, "S3-tds.txt");
|
||||
|
||||
debug("Entries are : ");
|
||||
debug("Creneaux filename : %s", path_creneaux);
|
||||
debug("Number of creneaux (for one week) : %d", n_creneaux);
|
||||
debug("Colleurs filename : %s", path_colleurs);
|
||||
debug("Number of colleurs (for one week) : %d", n_colleurs);
|
||||
debug("Output filename : %s", path_output);
|
||||
debug("Number of weeks : %d", n_weeks);
|
||||
debug("Number of groups : %d", n_groups);
|
||||
debug("Number of rolls : %d", n_iter);
|
||||
debug("Proportion of math colles : %d/%d", math_i, math_i+1);
|
||||
debug("Proportion of info colles : 1/%d", info_i);
|
||||
|
||||
aux_2(edt, len_edt, dudes, n_colleurs, n_groups, n_weeks, n_iter, path_output, math_i, info_i);
|
||||
|
||||
for(int i = 0; i < len_edt; i++) {
|
||||
free(edt[i].name);
|
||||
free(edt[i].allow_grps);
|
||||
}
|
||||
free(edt);
|
||||
|
||||
for(int i = 0; i < n_colleurs; i++) {
|
||||
free(dudes[i].disp);
|
||||
free(dudes[i].name);
|
||||
}
|
||||
free(dudes);
|
||||
|
||||
destroy_logger();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -0,0 +1,585 @@
|
|||
/*
|
||||
* Colloscope - A program that generates a colloscope for French 'classes prépas'
|
||||
* Copyright (C) 2024 Alexandre Aboujaib
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <assert.h>
|
||||
#include <stdbool.h>
|
||||
#include <unistd.h>
|
||||
|
||||
#include "logger.h"
|
||||
#include "structure.h"
|
||||
|
||||
//static int width = 1200;
|
||||
//static int height = 900;
|
||||
int date_dist(date d1, date d2) { /* returns distance between d1 and d2 in days
|
||||
if d2 is sooner than d1, it will return -1 */
|
||||
if(d2.month == d1.month && d2.year == d1.year) {
|
||||
if(d2.day < d1.day) {
|
||||
return -1;
|
||||
}
|
||||
return d2.day - d1.day;
|
||||
} else {
|
||||
int is_31 = 0;
|
||||
if(d1.month == 1 || d1.month == 3 || d1.month == 5 || d1.month == 7 || d1.month == 8 || d1.month == 10 || d1.month == 12) {
|
||||
is_31 = 1;
|
||||
} else {
|
||||
is_31 = (d1.month == 2)*(-2) + (d1.month == 2 && d1.year%4 == 0 && d1.year%100 != 0);
|
||||
}
|
||||
if(d2.month - d1.month < 0 && d2.year <= d1.year) {
|
||||
return -1;
|
||||
} else if(d2.month - d1.month == 1 && d2.year == d1.year) {
|
||||
return d2.day + (30 + is_31 - d1.day);
|
||||
} else {
|
||||
date copy;
|
||||
copy.day = d1.day;
|
||||
copy.month = d1.month;
|
||||
copy.year = d1.year;
|
||||
copy.month = (copy.month + 1);
|
||||
if(copy.month == 13) {
|
||||
copy.month = 1;
|
||||
copy.year += 1;
|
||||
}
|
||||
return (30 + is_31 + date_dist(copy, d2));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
bool is_sorted(creneau* edt, int len) {
|
||||
for(int i = 1; i < len; i++) {
|
||||
if(date_dist(edt[i-1].date, edt[i].date) == -1) {
|
||||
warn("Anomaly detected at lane %d (dates are not sorted in ascending order) :", i);
|
||||
warn("%d %d %d %d", edt[i-1].date.hour, edt[i-1].date.day, edt[i-1].date.month, edt[i-1].date.year);
|
||||
warn("%d %d %d %d", edt[i].date.hour, edt[i].date.day, edt[i].date.month, edt[i].date.year);
|
||||
warn("%d %d %d %d", edt[i+1].date.hour, edt[i+1].date.day, edt[i+1].date.month, edt[i+1].date.year);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
info("No problem detected");
|
||||
return true;
|
||||
}
|
||||
|
||||
creneau* import_creneaux(char* filename, int size) {
|
||||
// import creneau data from a file
|
||||
// see file.txt for an example
|
||||
FILE* ptr = fopen(filename, "r");
|
||||
char c = fgetc(ptr);
|
||||
|
||||
creneau* edt = malloc(sizeof(creneau)*size);
|
||||
int i = 0;
|
||||
int to_fill = 0;
|
||||
|
||||
int buffer = 0;
|
||||
|
||||
while(c != EOF && c != '$') {
|
||||
if((int)(c) >= 48 && (int)(c) <= 57) {
|
||||
buffer *= 10;
|
||||
buffer += (int)(c) - 48;
|
||||
} else {
|
||||
if(to_fill == 0) {
|
||||
//printf("%d\n", i);
|
||||
edt[i].date.hour = buffer;
|
||||
edt[i].group = 0;
|
||||
edt[i].name = malloc(sizeof(char)*35);
|
||||
edt[i].name[0] = 'n';
|
||||
edt[i].name[1] = 'o';
|
||||
edt[i].name[2] = 'n';
|
||||
edt[i].name[3] = 'e';
|
||||
edt[i].name[4] = '\0';
|
||||
edt[i].namelen = 4;
|
||||
edt[i].mat = NOTHING;
|
||||
edt[i].salle.building = 'N';
|
||||
edt[i].salle.id = 0;
|
||||
edt[i].length = 1;
|
||||
} else if(to_fill == 1) {
|
||||
edt[i].date.day = buffer;
|
||||
} else if(to_fill == 2) {
|
||||
edt[i].date.month = buffer;
|
||||
} else if(to_fill == 3) {
|
||||
edt[i].date.year = buffer;
|
||||
} else {
|
||||
edt[i].length++;
|
||||
}
|
||||
to_fill++;
|
||||
buffer = 0;
|
||||
if(c == '\n') {
|
||||
i++;
|
||||
to_fill = 0;
|
||||
}
|
||||
}
|
||||
c = fgetc(ptr);
|
||||
}
|
||||
|
||||
fclose(ptr);
|
||||
|
||||
if(!is_sorted(edt, size)) {
|
||||
assert(0);
|
||||
}
|
||||
return edt;
|
||||
}
|
||||
|
||||
bool str_equal(char* s1, char* s2) {
|
||||
// note : s1 and s2 must be valid strings (aka have \0 at the end)
|
||||
if((int)(s1[0]) == 0 || (int)(s2[0]) == 0) {
|
||||
return ((int)(s1[0]) == 0 && (int)(s2[0]) == 0);
|
||||
} else if(s1[0] != s2[0]) {
|
||||
return false;
|
||||
}
|
||||
return str_equal(&s1[1], &s2[1]);
|
||||
}
|
||||
|
||||
void str_copy(char* src, int l1, char* dest) {
|
||||
/* put the word src with length l1, \0 NOT included, in dest */
|
||||
for(int i = 0; i <= l1; i++) {
|
||||
dest[i] = src[i];
|
||||
}
|
||||
dest[l1] = '\0';
|
||||
}
|
||||
|
||||
colleur* import_colleurs(char* filename, int n_colleurs, int max_available) {
|
||||
/*
|
||||
|
||||
file has the following format :
|
||||
name
|
||||
mat
|
||||
dates (date*)
|
||||
-
|
||||
name2
|
||||
mat2
|
||||
dates2
|
||||
-
|
||||
name3
|
||||
...
|
||||
$
|
||||
|
||||
*/
|
||||
FILE* ptr = fopen(filename, "r");
|
||||
char c = fgetc(ptr);
|
||||
// {char* name; int namelen; topic mat; date* disp; int n_disp;}
|
||||
colleur* res = malloc(sizeof(colleur)*n_colleurs);
|
||||
|
||||
char* word = malloc(sizeof(char)*30);
|
||||
int wordlen = 0;
|
||||
|
||||
int buffer = 0;
|
||||
|
||||
int date_ptr = 0;
|
||||
|
||||
int current = 0; // 0 = name, 1 = mat, 2+ = dates
|
||||
int colleur_ptr = 0;
|
||||
|
||||
while(c != EOF && c != '$') {
|
||||
if(c == '\n') {
|
||||
if(current == 0) {
|
||||
word[wordlen] = '\0';
|
||||
res[colleur_ptr].name = malloc(sizeof(char)*30);
|
||||
str_copy(word, wordlen, res[colleur_ptr].name);
|
||||
res[colleur_ptr].namelen = wordlen;
|
||||
res[colleur_ptr].id = colleur_ptr;
|
||||
} else if(current == 1) {
|
||||
if(word[0] == 'M') { // math
|
||||
res[colleur_ptr].mat = MATH;
|
||||
} else if(word[0] == 'P') { // physics
|
||||
res[colleur_ptr].mat = PHYSICS;
|
||||
} else if(word[0] == 'E') { // english
|
||||
res[colleur_ptr].mat = ENGLISH;
|
||||
} else if(word[0] == 'I') { // info
|
||||
res[colleur_ptr].mat = INFO;
|
||||
} else {
|
||||
word[wordlen] = '\0';
|
||||
fatal("Wait that's illegal (%s)", word);
|
||||
assert(0);
|
||||
}
|
||||
res[colleur_ptr].disp = malloc(sizeof(date)*max_available);
|
||||
} else {
|
||||
res[colleur_ptr].disp[current-2].year = buffer;
|
||||
}
|
||||
current++;
|
||||
wordlen = 0;
|
||||
buffer = 0;
|
||||
date_ptr = 0;
|
||||
} else if(c == '+') {
|
||||
res[colleur_ptr].n_disp = current-2;
|
||||
current = 0;
|
||||
colleur_ptr++;
|
||||
|
||||
c = fgetc(ptr); // always a '\n', this to avoid some seg fault
|
||||
} else {
|
||||
if(current <= 1) {
|
||||
word[wordlen] = c;
|
||||
wordlen++;
|
||||
} else {
|
||||
if((int)(c) >= 48 && (int)(c) <= 57) {
|
||||
buffer *= 10;
|
||||
buffer += (int)(c) - 48;
|
||||
} else {
|
||||
if(date_ptr == 0) {
|
||||
res[colleur_ptr].disp[current-2].hour = buffer;
|
||||
} else if(date_ptr == 1) {
|
||||
res[colleur_ptr].disp[current-2].day = buffer;
|
||||
} else if(date_ptr == 2) {
|
||||
res[colleur_ptr].disp[current-2].month = buffer;
|
||||
} else {
|
||||
fatal("Oh no (%d)", date_ptr);
|
||||
assert(0);
|
||||
}
|
||||
buffer = 0;
|
||||
date_ptr++;
|
||||
}
|
||||
}
|
||||
}
|
||||
//printf("%c", c);
|
||||
c = fgetc(ptr);
|
||||
}
|
||||
// {char* name; int namelen; topic mat; date* disp; int n_disp;}
|
||||
|
||||
info("Successfully imported colleurs");
|
||||
fclose(ptr);
|
||||
free(word);
|
||||
|
||||
return res;
|
||||
}
|
||||
|
||||
date increment_date(date d, int inc) {
|
||||
int remaining = inc;
|
||||
date res = d;
|
||||
int delta_day = 0;
|
||||
while(remaining > 0) {
|
||||
res.day++;
|
||||
delta_day = (res.month == 1 || res.month == 3 || res.month == 5 || res.month == 7 || res.month == 8 || res.month == 10 || res.month == 12) - 2*(res.month == 2) + (res.month == 2 && res.year%4 == 0 && res.year%100 != 0);
|
||||
// sweet jesus
|
||||
if(res.day > 30 + delta_day) {
|
||||
res.day = 1;
|
||||
if(res.month == 12) {
|
||||
res.month = 1;
|
||||
res.year++;
|
||||
} else {
|
||||
res.month++;
|
||||
}
|
||||
}
|
||||
remaining--;
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
creneau* import_creneaux_oneweek(char* filename, int len_file, int n_weeks, int n_groups) {
|
||||
// import creneau data from a file then copy paste it for specified amount of weeks
|
||||
FILE* ptr = fopen(filename, "r");
|
||||
char c = fgetc(ptr);
|
||||
|
||||
creneau* edt = malloc(sizeof(creneau)*len_file*n_weeks);
|
||||
int i = 0;
|
||||
int to_fill = 0;
|
||||
|
||||
int buffer = 0;
|
||||
|
||||
while(c != EOF && c != '$') {
|
||||
if((int)(c) >= 48 && (int)(c) <= 57) {
|
||||
buffer *= 10;
|
||||
buffer += (int)(c) - 48;
|
||||
} else {
|
||||
if(to_fill == 0) {
|
||||
//printf("%d\n", i);
|
||||
edt[i].date.hour = buffer;
|
||||
edt[i].group = 0;
|
||||
edt[i].name = malloc(sizeof(char)*35);
|
||||
edt[i].name[0] = 'n';
|
||||
edt[i].name[1] = 'o';
|
||||
edt[i].name[2] = 'n';
|
||||
edt[i].name[3] = 'e';
|
||||
edt[i].name[4] = '\0';
|
||||
edt[i].namelen = 4;
|
||||
edt[i].mat = NOTHING;
|
||||
edt[i].salle.building = 'N';
|
||||
edt[i].salle.id = 0;
|
||||
edt[i].length = 1;
|
||||
edt[i].allow_grps = malloc(sizeof(bool)*n_groups);
|
||||
for(int ii = 0; ii < n_groups; ii++) {
|
||||
edt[i].allow_grps[ii] = true;
|
||||
}
|
||||
} else if(to_fill == 1) {
|
||||
edt[i].date.day = buffer;
|
||||
} else if(to_fill == 2) {
|
||||
edt[i].date.month = buffer;
|
||||
} else if(to_fill == 3) {
|
||||
edt[i].date.year = buffer;
|
||||
} else {
|
||||
edt[i].length++;
|
||||
}
|
||||
to_fill++;
|
||||
buffer = 0;
|
||||
if(c == '\n') {
|
||||
i++;
|
||||
to_fill = 0;
|
||||
}
|
||||
}
|
||||
c = fgetc(ptr);
|
||||
}
|
||||
fclose(ptr);
|
||||
|
||||
for(int k = 1; k < n_weeks; k++) {
|
||||
for(int i = 0; i < len_file; i++) {
|
||||
edt[k*len_file+i].date = increment_date(edt[i].date, 7*k);
|
||||
edt[k*len_file+i].group = 0;
|
||||
edt[k*len_file+i].name = malloc(sizeof(char)*35);
|
||||
edt[k*len_file+i].name[0] = 'n';
|
||||
edt[k*len_file+i].name[1] = 'o';
|
||||
edt[k*len_file+i].name[2] = 'n';
|
||||
edt[k*len_file+i].name[3] = 'e';
|
||||
edt[k*len_file+i].name[4] = '\0';
|
||||
edt[k*len_file+i].namelen = 4;
|
||||
edt[k*len_file+i].mat = NOTHING;
|
||||
edt[k*len_file+i].salle.building = 'N';
|
||||
edt[k*len_file+i].salle.id = 0;
|
||||
edt[k*len_file+i].length = edt[i].length;
|
||||
edt[k*len_file+i].allow_grps = malloc(sizeof(bool)*n_groups);
|
||||
for(int ii = 0; ii < n_groups; ii++) {
|
||||
edt[k*len_file+i].allow_grps[ii] = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/*for(int k = 0; k < len_file*n_weeks; k++) {
|
||||
printf("%d %d %d %d %d %d\n", edt[k].date.hour, edt[k].date.day, edt[k].date.month, edt[k].date.year, edt[k].group, (int)(edt[k].mat));
|
||||
}*/
|
||||
|
||||
if(!is_sorted(edt, n_weeks*len_file)) {
|
||||
assert(0);
|
||||
}
|
||||
info("Imported creneaux successfully");
|
||||
return edt;
|
||||
}
|
||||
|
||||
void expand(colleur* guy, int id, int n_weeks) {
|
||||
int len_1st = guy[id].n_disp;
|
||||
date* new = malloc(sizeof(date)*len_1st*n_weeks);
|
||||
|
||||
for(int b = 0; b < len_1st; b++) {
|
||||
new[b] = guy[id].disp[b];
|
||||
}
|
||||
for(int week = 1; week < n_weeks; week++) {
|
||||
for(int i = 0; i < len_1st; i++) {
|
||||
new[week*len_1st+i] = increment_date(guy[id].disp[i], 7*week);
|
||||
}
|
||||
}
|
||||
|
||||
free(guy[id].disp);
|
||||
guy[id].n_disp *= n_weeks;
|
||||
guy[id].disp = new;
|
||||
}
|
||||
|
||||
colleur* import_colleurs_oneweek(char* filename, int n_colleurs, int n_weeks, int len_oneweek) {
|
||||
// same as before, but each colleur only set his/her creneaux for the 1st week
|
||||
FILE* ptr = fopen(filename, "r");
|
||||
char c = fgetc(ptr);
|
||||
// {char* name; int namelen; topic mat; date* disp; int n_disp;}
|
||||
colleur* res = malloc(sizeof(colleur)*n_colleurs);
|
||||
|
||||
char* word = malloc(sizeof(char)*30);
|
||||
int wordlen = 0;
|
||||
|
||||
int buffer = 0;
|
||||
|
||||
int date_ptr = 0;
|
||||
|
||||
int current = 0; // 0 = name, 1 = mat, 2+ = dates
|
||||
int colleur_ptr = 0;
|
||||
|
||||
while(c != EOF && c != '$') {
|
||||
if(c == '\n') {
|
||||
if(current == 0) {
|
||||
word[wordlen] = '\0';
|
||||
res[colleur_ptr].name = malloc(sizeof(char)*30);
|
||||
str_copy(word, wordlen, res[colleur_ptr].name);
|
||||
res[colleur_ptr].namelen = wordlen;
|
||||
} else if(current == 1) {
|
||||
if(word[0] == 'M') { // math
|
||||
res[colleur_ptr].mat = MATH;
|
||||
//printf("M");
|
||||
} else if(word[0] == 'P') { // physics
|
||||
res[colleur_ptr].mat = PHYSICS;
|
||||
//printf("P");
|
||||
} else if(word[0] == 'E') { // english
|
||||
res[colleur_ptr].mat = ENGLISH;
|
||||
//printf("E");
|
||||
} else if(word[0] == 'I') { // info
|
||||
res[colleur_ptr].mat = INFO;
|
||||
} else {
|
||||
word[wordlen] = '\0';
|
||||
fatal("Wait that's illegal (%s)", word);
|
||||
assert(0);
|
||||
}
|
||||
res[colleur_ptr].disp = malloc(sizeof(date)*len_oneweek);
|
||||
res[colleur_ptr].id = colleur_ptr;
|
||||
} else {
|
||||
res[colleur_ptr].disp[current-2].year = buffer;
|
||||
}
|
||||
current++;
|
||||
wordlen = 0;
|
||||
buffer = 0;
|
||||
date_ptr = 0;
|
||||
} else if(c == '+') {
|
||||
res[colleur_ptr].n_disp = current-2;
|
||||
current = 0;
|
||||
colleur_ptr++;
|
||||
|
||||
c = fgetc(ptr); // always a '\n', this to avoid some seg fault
|
||||
} else {
|
||||
if(current <= 1) {
|
||||
word[wordlen] = c;
|
||||
wordlen++;
|
||||
} else {
|
||||
if((int)(c) >= 48 && (int)(c) <= 57) {
|
||||
buffer *= 10;
|
||||
buffer += (int)(c) - 48;
|
||||
} else {
|
||||
if(date_ptr == 0) {
|
||||
res[colleur_ptr].disp[current-2].hour = buffer;
|
||||
} else if(date_ptr == 1) {
|
||||
res[colleur_ptr].disp[current-2].day = buffer;
|
||||
} else if(date_ptr == 2) {
|
||||
res[colleur_ptr].disp[current-2].month = buffer;
|
||||
} else {
|
||||
fatal("Oh no (%d)", date_ptr);
|
||||
assert(0);
|
||||
}
|
||||
buffer = 0;
|
||||
date_ptr++;
|
||||
}
|
||||
}
|
||||
}
|
||||
//printf("%c", c);
|
||||
c = fgetc(ptr);
|
||||
}
|
||||
// {char* name; int namelen; topic mat; date* disp; int n_disp;}
|
||||
|
||||
for(int c = 0; c < n_colleurs; c++) {
|
||||
expand(res, c, n_weeks);
|
||||
}
|
||||
|
||||
fclose(ptr);
|
||||
free(word);
|
||||
|
||||
info("Imported colleurs with no problems");
|
||||
return res;
|
||||
}
|
||||
|
||||
int str_to_int(char* s) {
|
||||
char c = 'e';
|
||||
int i = 0;
|
||||
int buffer = 0;
|
||||
while(c != '\0') {
|
||||
c = s[i];
|
||||
buffer *= 10;
|
||||
if((int)(c) >= 48 && (int)(c) <= 57) {
|
||||
buffer += (int)(c)-48;
|
||||
}
|
||||
i++;
|
||||
}
|
||||
return buffer/10;
|
||||
}
|
||||
|
||||
bool equal_d(date d1, date d2) {
|
||||
return (d1.hour == d2.hour && d2.day == d1.day && d1.month == d2.month && d1.year == d2.year);
|
||||
}
|
||||
|
||||
int locate_date(creneau* edt, int len_edt, date d) {
|
||||
int i = 0;
|
||||
while(i < len_edt && !equal_d(edt[i].date, d)) {
|
||||
i++;
|
||||
}
|
||||
|
||||
if(i == len_edt) {
|
||||
return -1;
|
||||
}
|
||||
return i;
|
||||
}
|
||||
|
||||
void import_tds(creneau* edt, int len_edt, int len_oneweek, char* filename) {
|
||||
FILE* ptr = fopen(filename, "r");
|
||||
char c = fgetc(ptr);
|
||||
int edtptr = 0;
|
||||
|
||||
int current = 0;
|
||||
int place = 0;
|
||||
|
||||
char method;
|
||||
|
||||
int buffer = 0;
|
||||
|
||||
date d;
|
||||
|
||||
while(c != EOF && c != '$') {
|
||||
//printf("%c", c);
|
||||
if(c == '+') {
|
||||
current = 0;
|
||||
place = 0;
|
||||
buffer = 0;
|
||||
c = fgetc(ptr); // always a \n
|
||||
} else if(c == '\n' && current != 0) {
|
||||
if(current == 1) {
|
||||
edtptr = locate_date(edt, len_edt, d);
|
||||
} else {
|
||||
if(method == 'A') {
|
||||
int k = 0;
|
||||
int os = 1;
|
||||
while(edtptr + k*len_oneweek >= 0 && edtptr + k*len_oneweek < len_edt) {
|
||||
//info("[%d, %d]", buffer, edtptr + k*len_oneweek);
|
||||
//usleep(1000000);
|
||||
edt[edtptr + k*len_oneweek].allow_grps[buffer-1] = false;
|
||||
while(equal_d(edt[edtptr + k*len_oneweek].date, edt[edtptr + k*len_oneweek + os].date)) {
|
||||
//info("[%d, %d]", buffer, edtptr + k*len_oneweek + os);
|
||||
edt[edtptr + k*len_oneweek + os].allow_grps[buffer-1] = false;
|
||||
os++;
|
||||
}
|
||||
k++;
|
||||
os = 1;
|
||||
}
|
||||
} else {
|
||||
fatal("Unknown method %d. Check if the method used is valid, or ask a dev to fix it ", method);
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
current++;
|
||||
buffer = 0;
|
||||
} else if((c == '\n' && current == 0) || c == ' ') {
|
||||
if(place == 0) {
|
||||
d.hour = buffer;
|
||||
} else if(place == 1) {
|
||||
d.day = buffer;
|
||||
} else if(place == 2) {
|
||||
d.month = buffer;
|
||||
} else {
|
||||
d.year = buffer;
|
||||
current = 1;
|
||||
}
|
||||
place++;
|
||||
buffer = 0;
|
||||
} else if((int)(c) >= 48 && (int)(c) <= 57) {
|
||||
buffer *= 10;
|
||||
buffer += (int)(c) - 48;
|
||||
} else if(current == 1) {
|
||||
method = c;
|
||||
}
|
||||
c = fgetc(ptr);
|
||||
}
|
||||
fclose(ptr);
|
||||
|
||||
info("Imported special creneaux successfully");
|
||||
}
|
||||
|
|
@ -0,0 +1,83 @@
|
|||
/*
|
||||
* Colloscope - A program that generates a colloscope for French 'classes prépas'
|
||||
* Copyright (C) 2024 Alexandre Aboujaib
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef STRUCTURE_H_INCLUDED
|
||||
#define STRUCTURE_H_INCLUDED
|
||||
|
||||
#include <stdbool.h>
|
||||
|
||||
|
||||
/* Feuilles mortes :
|
||||
|
||||
extern int* stats;
|
||||
extern int* n_colles;
|
||||
|
||||
*/
|
||||
|
||||
typedef enum topic {NOTHING, MATH, PHYSICS, ENGLISH, FRENCH, INFO} topic;
|
||||
// colles subjects
|
||||
|
||||
typedef struct date {int hour; int day; int month; int year;} date; /* format is {hour, day, month, year} */
|
||||
// nothing to say here
|
||||
|
||||
typedef struct room {char building; int id;} room;
|
||||
// rooms
|
||||
// building can be C, M, R or V
|
||||
|
||||
typedef struct creneau {int length; date date; int group; char* name; int namelen; topic mat; room salle; bool* allow_grps;} creneau;
|
||||
// one créneau de colle
|
||||
// /!\ creneau has to be sorted by ascending dates
|
||||
// with edt being a creneau*, it is required to have edt[0] be a Monday and edt[len(edt)-1] has to be a Friday
|
||||
|
||||
typedef struct colleur {char* name; int namelen; topic mat; date* disp; int n_disp; int id;} colleur;
|
||||
// available creneaux for the colleurs
|
||||
|
||||
typedef struct array {int* a; int len; int memlen;} array;
|
||||
// yes
|
||||
|
||||
|
||||
int date_dist(date d1, date d2);
|
||||
|
||||
bool is_sorted(creneau *edt, int len);
|
||||
|
||||
creneau *import_creneaux(char *filename, int size);
|
||||
|
||||
bool str_equal(char *s1, char *s2);
|
||||
|
||||
void str_copy(char *src, int l1, char *dest);
|
||||
|
||||
colleur *import_colleurs(char *filename, int n_colleurs, int max_available);
|
||||
|
||||
date increment_date(date d, int inc);
|
||||
|
||||
creneau *import_creneaux_oneweek(char *filename, int len_file, int n_weeks, int n_groups);
|
||||
|
||||
void expand(colleur *guy, int id, int n_weeks);
|
||||
|
||||
colleur *import_colleurs_oneweek(char *filename, int n_colleurs, int n_weeks, int len_oneweek);
|
||||
|
||||
int str_to_int(char *s);
|
||||
|
||||
bool equal_d(date d1, date d2);
|
||||
|
||||
int locate_date(creneau* edt, int len_edt, date d);
|
||||
|
||||
void import_tds(creneau* edt, int len_edt, int len_oneweek, char* filename);
|
||||
|
||||
#endif
|
||||
Loading…
Reference in New Issue