Bart Aelterman bartaelterman
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| license: gpl-3.0 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import intake | |
| class WritableTextFilesSource(intake.source.TextFilesSource): | |
| container = 'python' | |
| name = 'writabletext' | |
| partition_access = True | |
| version = '0.0.1dev' |
bartaelterman
/ Christmas names with constraint programming random.ipynb
Last active
November 27, 2019 20:15
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
bartaelterman
/ Christmas names with constraint programming.ipynb
Created
November 27, 2019 20:21
Draw Christmas names with Constraint Programming
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
bartaelterman
/ main.py
Created
March 2, 2020 14:20
Simulate the number of out of order counts with varying list sizes and varying number of item delayed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import random | |
| import pprint | |
| def get_ooo_count(l): | |
| count = 0 | |
| for i, el in enumerate(l[1:]): | |
| if el != l[i] + 1: | |
| count += 1 | |
| return count |
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
OlderNewer