This file contains 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
require 'selenium-webdriver' | |
begin | |
driver = Selenium::WebDriver.for(:chrome) | |
driver.navigate.to 'http://localhost:3000' | |
# login | |
driver.find_element(css: '[href="http://localhost:3000/users/login"]').click | |
sleep 1 | |
driver.find_element(id: 'user_email').send_keys 'user' |
This file contains 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
In [10]: {**{‘x’: 2}, **{'a': 1}} | |
Out[10]: {'a': 1, 'x': 2} |
This file contains 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
[[source]] | |
name = "pypi" | |
url = "https://pypi.org/simple" | |
verify_ssl = true | |
[dev-packages] | |
pytest = "*" | |
pylint = "*" | |
pylint-quotes = "*" |
This file contains 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
(venv) Igors-MacBook-Pro:airflow igor_khrol$ ./breeze --db-reset test-target tests/task/task_runner/test_standard_task_runner.py -- --logging-level=DEBUG | |
Resetting the DB! | |
Fixing group permissions | |
Fixed group permissions | |
Use CI image. |
This file contains 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
from math import comb | |
def chance(k, n, K, N): | |
return comb(K, k) * comb(N - K, n - k) / comb(N, n) | |
def fits_in_delta_prob(lower, upper, n, K, N): | |
result = 0 | |
for x in range(n + 1): | |
ratio = x / n |
OlderNewer