gem-graph/gem-graph-server
gem-graph
/
gem-graph-server
3
0
Fork 0
Code Issues 14 Pull Requests 1 Packages Projects Releases Wiki Activity

Merge branch 'master' of ssh://gitlab.os-k.eu:222/gem-graph-team/gem-graph-server

This commit is contained in:
Adrien Bourmault 2021-04-10 21:25:59 +02:00
parent 156d7ccc49 950ebd6237
commit 2f9cedb857
No known key found for this signature in database
GPG Key ID: 6EB408FE0ACEC664
4 changed files with 45 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
AUTHORS.md Normal file
View File

@ -0,0 +1,37 @@
#=----------------------------------------------------------------------------=#
# Project authors file #
# #
# Copyright © 2021 The Gem-graph Project #
# #
# This file is part of gem-graph. #
# #
# This program is free software: you can redistribute it and/or modify #
# it under the terms of the GNU Affero 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 Affero General Public License for more details. #
# #
# You should have received a copy of the GNU Affero General Public License #
# along with this program. If not, see <https://www.gnu.org/licenses/>. #
#=----------------------------------------------------------------------------=#
The gem-graph development team (named in the sources The Gem-graph Project) is
composed of all core contributors of the project. Its representatives are the
owners of the gem-graph project repository, and own the copyright in it.
Founders and owner of the gem-graph project repository
Jean Sirmai (jean)
Adrien Bourmault (neox)
Main contributors
Jean Sirmai (jean)
Adrien Bourmault (neox)
Contact : -

BIN
src/gem-graph-server
View File

Binary file not shown.

14
src/main.c
View File

@ -1182,7 +1182,7 @@ static PyObject *__pyx_int_1;
static PyObject *__pyx_int_10; static PyObject *__pyx_int_10;
static PyObject *__pyx_int_150; static PyObject *__pyx_int_150;
static PyObject *__pyx_int_10000; static PyObject *__pyx_int_10000;
static PyObject *__pyx_int_20000; static PyObject *__pyx_int_40000;
/* Late includes */ /* Late includes */
static PyMethodDef __pyx_methods[] = { static PyMethodDef __pyx_methods[] = {
@ -1277,7 +1277,7 @@ static CYTHON_SMALL_CODE int __Pyx_InitGlobals(void) {
__pyx_int_10 = PyInt_FromLong(10); if (unlikely(!__pyx_int_10)) __PYX_ERR(0, 1, __pyx_L1_error) __pyx_int_10 = PyInt_FromLong(10); if (unlikely(!__pyx_int_10)) __PYX_ERR(0, 1, __pyx_L1_error)
__pyx_int_150 = PyInt_FromLong(150); if (unlikely(!__pyx_int_150)) __PYX_ERR(0, 1, __pyx_L1_error) __pyx_int_150 = PyInt_FromLong(150); if (unlikely(!__pyx_int_150)) __PYX_ERR(0, 1, __pyx_L1_error)
__pyx_int_10000 = PyInt_FromLong(10000L); if (unlikely(!__pyx_int_10000)) __PYX_ERR(0, 1, __pyx_L1_error) __pyx_int_10000 = PyInt_FromLong(10000L); if (unlikely(!__pyx_int_10000)) __PYX_ERR(0, 1, __pyx_L1_error)
__pyx_int_20000 = PyInt_FromLong(20000L); if (unlikely(!__pyx_int_20000)) __PYX_ERR(0, 1, __pyx_L1_error) __pyx_int_40000 = PyInt_FromLong(40000L); if (unlikely(!__pyx_int_40000)) __PYX_ERR(0, 1, __pyx_L1_error)
return 0; return 0;
__pyx_L1_error:; __pyx_L1_error:;
return -1; return -1;
@ -1598,7 +1598,7 @@ if (!__Pyx_RefNanny) {
* import random * import random
* *
* ARROW_NUMBER = 150 # <<<<<<<<<<<<<< * ARROW_NUMBER = 150 # <<<<<<<<<<<<<<
* MAX_CYCLES = 20000 * MAX_CYCLES = 40000
* SPACE_SIZE = 10000 * SPACE_SIZE = 10000
*/ */
if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARROW_NUMBER, __pyx_int_150) < 0) __PYX_ERR(0, 26, __pyx_L1_error) if (PyDict_SetItem(__pyx_d, __pyx_n_s_ARROW_NUMBER, __pyx_int_150) < 0) __PYX_ERR(0, 26, __pyx_L1_error)
@ -1606,15 +1606,15 @@ if (!__Pyx_RefNanny) {
/* "main.py":27 /* "main.py":27
* *
* ARROW_NUMBER = 150 * ARROW_NUMBER = 150
* MAX_CYCLES = 20000 # <<<<<<<<<<<<<< * MAX_CYCLES = 40000 # <<<<<<<<<<<<<<
* SPACE_SIZE = 10000 * SPACE_SIZE = 10000
* PREEMPTION_GLOBAL_SPACE = [True] * SPACE_SIZE * PREEMPTION_GLOBAL_SPACE = [True] * SPACE_SIZE
*/ */
if (PyDict_SetItem(__pyx_d, __pyx_n_s_MAX_CYCLES, __pyx_int_20000) < 0) __PYX_ERR(0, 27, __pyx_L1_error) if (PyDict_SetItem(__pyx_d, __pyx_n_s_MAX_CYCLES, __pyx_int_40000) < 0) __PYX_ERR(0, 27, __pyx_L1_error)
/* "main.py":28 /* "main.py":28
* ARROW_NUMBER = 150 * ARROW_NUMBER = 150
* MAX_CYCLES = 20000 * MAX_CYCLES = 40000
* SPACE_SIZE = 10000 # <<<<<<<<<<<<<< * SPACE_SIZE = 10000 # <<<<<<<<<<<<<<
* PREEMPTION_GLOBAL_SPACE = [True] * SPACE_SIZE * PREEMPTION_GLOBAL_SPACE = [True] * SPACE_SIZE
* DRAWING_GLOBAL_SPACE = [] * DRAWING_GLOBAL_SPACE = []
@ -1622,7 +1622,7 @@ if (!__Pyx_RefNanny) {
if (PyDict_SetItem(__pyx_d, __pyx_n_s_SPACE_SIZE, __pyx_int_10000) < 0) __PYX_ERR(0, 28, __pyx_L1_error) if (PyDict_SetItem(__pyx_d, __pyx_n_s_SPACE_SIZE, __pyx_int_10000) < 0) __PYX_ERR(0, 28, __pyx_L1_error)
/* "main.py":29 /* "main.py":29
* MAX_CYCLES = 20000 * MAX_CYCLES = 40000
* SPACE_SIZE = 10000 * SPACE_SIZE = 10000
* PREEMPTION_GLOBAL_SPACE = [True] * SPACE_SIZE # <<<<<<<<<<<<<< * PREEMPTION_GLOBAL_SPACE = [True] * SPACE_SIZE # <<<<<<<<<<<<<<
* DRAWING_GLOBAL_SPACE = [] * DRAWING_GLOBAL_SPACE = []

2
src/main.py
View File

@ -24,7 +24,7 @@ import scheduler
import random import random
ARROW_NUMBER = 150 ARROW_NUMBER = 150
MAX_CYCLES = 20000 MAX_CYCLES = 40000
SPACE_SIZE = 10000 SPACE_SIZE = 10000
PREEMPTION_GLOBAL_SPACE = [True] * SPACE_SIZE PREEMPTION_GLOBAL_SPACE = [True] * SPACE_SIZE
DRAWING_GLOBAL_SPACE = [] DRAWING_GLOBAL_SPACE = []