Merged
26 changes: 18 additions & 8 deletions src/executorlib/standalone/batched.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,27 +3,37 @@

def batched_futures(
lst: list[Future], nested_skip_lst: list[Future[list]], n: int
) -> list[list]:
) -> tuple[bool, list[Future]]:
"""
Batch n completed future objects. If the number of completed futures is smaller than n and the end of the batch is
not reached yet, then an empty list is returned. If n future objects are done, which are not included in the skip_set
then they are returned as batch.

Args:
lst (list): list of all future objects
nested_skip_lst (list): nest list of individual results already assigned to previous batches
nested_skip_lst (list): list of future objects, which contain the list of future objects ids which should be skipped for the batch
n (int): batch size

Returns:
list: results of the batched futures
"""
skip_set = {id(item) for f in nested_skip_lst for item in f.result()}
skip_set = {fid for f in nested_skip_lst for fid in f.result()}

done_lst = []
failed_lst = []
n_expected = min(n, len(lst) - len(skip_set))
for v in lst:
if v.done() and id(v.result()) not in skip_set:
done_lst.append(v.result())
if len(done_lst) == n_expected:
return done_lst
return []
if id(v) not in skip_set and v.done():
if v.exception() is not None:
failed_lst.append(v)
elif id(v) not in skip_set and v.done():
done_lst.append(v)
if len(done_lst) == n_expected:
return True, done_lst
if (len(lst) - len(skip_set)) == len(failed_lst):
return (
False,
failed_lst[:n_expected],
) # raise the exception only after all futures have failed
else:
return True, []
16 changes: 11 additions & 5 deletions src/executorlib/task_scheduler/interactive/dependency.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -177,17 +177,19 @@ def batched(
future_lst: list[Future] = []
for _ in range(len(iterable) // n + (1 if len(iterable) % n > 0 else 0)):
f: Future = Future()
f_skip: Future = Future()
if self._future_queue is not None:
self._future_queue.put(
{
"fn": "batched",
"args": (),
"kwargs": {"lst": iterable, "n": n, "skip_lst": skip_lst},
"future": f,
"future_skip": f_skip,
"resource_dict": {},
}
)
skip_lst = skip_lst.copy() + [f] # be careful
skip_lst = skip_lst.copy() + [f_skip] # be careful
future_lst.append(f)

return future_lst
Expand DownExpand Up@@ -330,7 +332,7 @@ def _update_waiting_task(
wait_tmp_lst = []
for task_wait_dict in wait_lst:
exception_lst = get_exception_lst(future_lst=task_wait_dict["future_lst"])
if len(exception_lst) > 0:
if len(exception_lst) > 0 and task_wait_dict["fn"] != "batched":
task_wait_dict["future"].set_exception(exception_lst[0])
elif task_wait_dict["fn"] != "batched" and all(
future.done() for future in task_wait_dict["future_lst"]
Expand All@@ -343,15 +345,19 @@ def _update_waiting_task(
elif task_wait_dict["fn"] == "batched" and all(
future.done() for future in task_wait_dict["kwargs"]["skip_lst"]
):
done_lst = batched_futures(
success, done_lst = batched_futures(
lst=task_wait_dict["kwargs"]["lst"],
n=task_wait_dict["kwargs"]["n"],
nested_skip_lst=task_wait_dict["kwargs"]["skip_lst"],
)
if len(done_lst) == 0:
if success and len(done_lst) == 0:
wait_tmp_lst.append(task_wait_dict)
elif success and len(done_lst) > 0:
task_wait_dict["future"].set_result([f.result() for f in done_lst])
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
task_wait_dict["future"].set_result(done_lst)
task_wait_dict["future"].set_exception(done_lst[0].exception())
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
wait_tmp_lst.append(task_wait_dict)
if len(wait_lst) == len(wait_tmp_lst):
Expand Down
24 changes: 24 additions & 0 deletions tests/unit/executor/test_single_dependencies.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -82,6 +82,30 @@ def test_batched(self):
self.assertEqual(len(result_lst), 4)
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error_future(self):
with SingleNodeExecutor() as exe:
t1 = time()
future_first_lst = []
for i in range(10):
if i % 3 == 0:
future_first_lst.append(exe.submit(raise_error, parameter=0))
else:
future_first_lst.append(exe.submit(return_input_dict, i))
future_second_lst = exe.batched(future_first_lst, n=3)

future_third_lst = []
for f in future_second_lst:
future_third_lst.append(exe.submit(sum, f))

t2 = time()
self.assertEqual(future_third_lst[0].result() + future_third_lst[1].result(), 27)
with self.assertRaises(RuntimeError):
future_third_lst[2].result()
with self.assertRaises(RuntimeError):
future_third_lst[3].result()
t3 = time()
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error(self):
with self.assertRaises(TypeError):
with SingleNodeExecutor() as exe:
Expand Down
79 changes: 67 additions & 12 deletions tests/unit/standalone/test_batched.py
Original file line numberDiff line numberDiff line change
@@ -1,27 +1,82 @@
from unittest import TestCase
import unittest
from concurrent.futures import Future
from executorlib.standalone.batched import batched_futures

from executorlib.task_scheduler.interactive.dependency import batched_futures

class TestBatched(TestCase):

class TestBatched(unittest.TestCase):
def test_batched_futures(self):
lst = []
for i in list(range(10)):
for i in range(10):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([0, 1, 2])
batched_lst[1].set_result([3, 4, 5])
batched_lst[2].set_result([6, 7, 8])
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [0, 1, 2])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3), [3, 4, 5])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3), [6, 7, 8])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3), [9])
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [0, 1, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 4, 5])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [6, 7, 8])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [9])

def test_batched_futures_duplicated(self):
lst = []
for i in range(1,4):
for _ in range(3):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 1, 1])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [2, 2, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 3, 3])

def test_batched_futures(self):
Comment thread
coderabbitai[bot] marked this conversation as resolved.
lst = []
for i in range(10):
f = Future()
if i % 3 == 0:
f.set_exception(ValueError(f"Error for {i}"))
else:
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future()]
batched_lst[0].set_result([id(lst[1]), id(lst[2]), id(lst[4])])
batched_lst[1].set_result([id(lst[5]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 2, 4])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [5, 7, 8])
succss, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertFalse(succss)
with self.assertRaises(ValueError):
raise done_lst[0].exception()

def test_batched_futures_not_finished(self):
lst = []
for _ in list(range(10)):
f = Future()
lst.append(f)
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual(done_lst, [])
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Add copy buttons to all \u003cpre\u003e\u003ccode\u003e blocks\n(function() {\n function addCopyButtons() {\n document.querySelectorAll('pre code').forEach(function(codeBlock) {\n if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;\n codeBlock.parentElement.setAttribute('data-copy-added', 'true');\n \n var btn = document.createElement('button');\n btn.textContent = 'Copy';\n btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';\n btn.onmouseover = function() { this.style.opacity = '1'; };\n btn.onmouseout = function() { this.style.opacity = '0.7'; };\n btn.onclick = function() {\n navigator.clipboard.writeText(codeBlock.textContent).then(function() {\n btn.textContent = 'Copied!';\n setTimeout(function() { btn.textContent = 'Copy'; }, 1500);\n });\n };\n codeBlock.parentElement.style.position = 'relative';\n codeBlock.parentElement.appendChild(btn);\n });\n }\n \n addCopyButtons();\n \n // Re-run on dynamic content\n var observer = new MutationObserver(addCopyButtons);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Add Copy Buttons to Code Blocks"); } } catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); } })(); (function(){ try { var __m = "github.com"; var __re = new RegExp('^' + "github\\.com" + '
Skip to content
Merged
26 changes: 18 additions & 8 deletions src/executorlib/standalone/batched.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,27 +3,37 @@

def batched_futures(
lst: list[Future], nested_skip_lst: list[Future[list]], n: int
) -> list[list]:
) -> tuple[bool, list[Future]]:
"""
Batch n completed future objects. If the number of completed futures is smaller than n and the end of the batch is
not reached yet, then an empty list is returned. If n future objects are done, which are not included in the skip_set
then they are returned as batch.

Args:
lst (list): list of all future objects
nested_skip_lst (list): nest list of individual results already assigned to previous batches
nested_skip_lst (list): list of future objects, which contain the list of future objects ids which should be skipped for the batch
n (int): batch size

Returns:
list: results of the batched futures
"""
skip_set = {id(item) for f in nested_skip_lst for item in f.result()}
skip_set = {fid for f in nested_skip_lst for fid in f.result()}

done_lst = []
failed_lst = []
n_expected = min(n, len(lst) - len(skip_set))
for v in lst:
if v.done() and id(v.result()) not in skip_set:
done_lst.append(v.result())
if len(done_lst) == n_expected:
return done_lst
return []
if id(v) not in skip_set and v.done():
if v.exception() is not None:
failed_lst.append(v)
elif id(v) not in skip_set and v.done():
done_lst.append(v)
if len(done_lst) == n_expected:
return True, done_lst
if (len(lst) - len(skip_set)) == len(failed_lst):
return (
False,
failed_lst[:n_expected],
) # raise the exception only after all futures have failed
else:
return True, []
16 changes: 11 additions & 5 deletions src/executorlib/task_scheduler/interactive/dependency.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -177,17 +177,19 @@ def batched(
future_lst: list[Future] = []
for _ in range(len(iterable) // n + (1 if len(iterable) % n > 0 else 0)):
f: Future = Future()
f_skip: Future = Future()
if self._future_queue is not None:
self._future_queue.put(
{
"fn": "batched",
"args": (),
"kwargs": {"lst": iterable, "n": n, "skip_lst": skip_lst},
"future": f,
"future_skip": f_skip,
"resource_dict": {},
}
)
skip_lst = skip_lst.copy() + [f] # be careful
skip_lst = skip_lst.copy() + [f_skip] # be careful
future_lst.append(f)

return future_lst
Expand DownExpand Up@@ -330,7 +332,7 @@ def _update_waiting_task(
wait_tmp_lst = []
for task_wait_dict in wait_lst:
exception_lst = get_exception_lst(future_lst=task_wait_dict["future_lst"])
if len(exception_lst) > 0:
if len(exception_lst) > 0 and task_wait_dict["fn"] != "batched":
task_wait_dict["future"].set_exception(exception_lst[0])
elif task_wait_dict["fn"] != "batched" and all(
future.done() for future in task_wait_dict["future_lst"]
Expand All@@ -343,15 +345,19 @@ def _update_waiting_task(
elif task_wait_dict["fn"] == "batched" and all(
future.done() for future in task_wait_dict["kwargs"]["skip_lst"]
):
done_lst = batched_futures(
success, done_lst = batched_futures(
lst=task_wait_dict["kwargs"]["lst"],
n=task_wait_dict["kwargs"]["n"],
nested_skip_lst=task_wait_dict["kwargs"]["skip_lst"],
)
if len(done_lst) == 0:
if success and len(done_lst) == 0:
wait_tmp_lst.append(task_wait_dict)
elif success and len(done_lst) > 0:
task_wait_dict["future"].set_result([f.result() for f in done_lst])
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
task_wait_dict["future"].set_result(done_lst)
task_wait_dict["future"].set_exception(done_lst[0].exception())
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
wait_tmp_lst.append(task_wait_dict)
if len(wait_lst) == len(wait_tmp_lst):
Expand Down
24 changes: 24 additions & 0 deletions tests/unit/executor/test_single_dependencies.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -82,6 +82,30 @@ def test_batched(self):
self.assertEqual(len(result_lst), 4)
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error_future(self):
with SingleNodeExecutor() as exe:
t1 = time()
future_first_lst = []
for i in range(10):
if i % 3 == 0:
future_first_lst.append(exe.submit(raise_error, parameter=0))
else:
future_first_lst.append(exe.submit(return_input_dict, i))
future_second_lst = exe.batched(future_first_lst, n=3)

future_third_lst = []
for f in future_second_lst:
future_third_lst.append(exe.submit(sum, f))

t2 = time()
self.assertEqual(future_third_lst[0].result() + future_third_lst[1].result(), 27)
with self.assertRaises(RuntimeError):
future_third_lst[2].result()
with self.assertRaises(RuntimeError):
future_third_lst[3].result()
t3 = time()
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error(self):
with self.assertRaises(TypeError):
with SingleNodeExecutor() as exe:
Expand Down
79 changes: 67 additions & 12 deletions tests/unit/standalone/test_batched.py
Original file line numberDiff line numberDiff line change
@@ -1,27 +1,82 @@
from unittest import TestCase
import unittest
from concurrent.futures import Future
from executorlib.standalone.batched import batched_futures

from executorlib.task_scheduler.interactive.dependency import batched_futures

class TestBatched(TestCase):

class TestBatched(unittest.TestCase):
def test_batched_futures(self):
lst = []
for i in list(range(10)):
for i in range(10):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([0, 1, 2])
batched_lst[1].set_result([3, 4, 5])
batched_lst[2].set_result([6, 7, 8])
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [0, 1, 2])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3), [3, 4, 5])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3), [6, 7, 8])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3), [9])
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [0, 1, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 4, 5])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [6, 7, 8])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [9])

def test_batched_futures_duplicated(self):
lst = []
for i in range(1,4):
for _ in range(3):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 1, 1])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [2, 2, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 3, 3])

def test_batched_futures(self):
Comment thread
coderabbitai[bot] marked this conversation as resolved.
lst = []
for i in range(10):
f = Future()
if i % 3 == 0:
f.set_exception(ValueError(f"Error for {i}"))
else:
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future()]
batched_lst[0].set_result([id(lst[1]), id(lst[2]), id(lst[4])])
batched_lst[1].set_result([id(lst[5]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 2, 4])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [5, 7, 8])
succss, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertFalse(succss)
with self.assertRaises(ValueError):
raise done_lst[0].exception()

def test_batched_futures_not_finished(self):
lst = []
for _ in list(range(10)):
f = Future()
lst.append(f)
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual(done_lst, [])
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Force GitHub README to respect dark mode\n(function() {\n var style = document.createElement('style');\n style.textContent = '\n .markdown-body {\n color-scheme: dark light;\n }\n .markdown-body pre { background: #161b22 !important; }\n .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }\n .markdown-body table th, .markdown-body table td { border-color: #30363d !important; }\n .markdown-body img { background: #0d1117; }\n .markdown-body blockquote { border-left-color: #8b949e; }\n .markdown-body hr { border-color: #30363d; }\n ';\n document.head.appendChild(style);\n})();", "GitHub Dark Mode README Fix"); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content
Merged
26 changes: 18 additions & 8 deletions src/executorlib/standalone/batched.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,27 +3,37 @@

def batched_futures(
lst: list[Future], nested_skip_lst: list[Future[list]], n: int
) -> list[list]:
) -> tuple[bool, list[Future]]:
"""
Batch n completed future objects. If the number of completed futures is smaller than n and the end of the batch is
not reached yet, then an empty list is returned. If n future objects are done, which are not included in the skip_set
then they are returned as batch.

Args:
lst (list): list of all future objects
nested_skip_lst (list): nest list of individual results already assigned to previous batches
nested_skip_lst (list): list of future objects, which contain the list of future objects ids which should be skipped for the batch
n (int): batch size

Returns:
list: results of the batched futures
"""
skip_set = {id(item) for f in nested_skip_lst for item in f.result()}
skip_set = {fid for f in nested_skip_lst for fid in f.result()}

done_lst = []
failed_lst = []
n_expected = min(n, len(lst) - len(skip_set))
for v in lst:
if v.done() and id(v.result()) not in skip_set:
done_lst.append(v.result())
if len(done_lst) == n_expected:
return done_lst
return []
if id(v) not in skip_set and v.done():
if v.exception() is not None:
failed_lst.append(v)
elif id(v) not in skip_set and v.done():
done_lst.append(v)
if len(done_lst) == n_expected:
return True, done_lst
if (len(lst) - len(skip_set)) == len(failed_lst):
return (
False,
failed_lst[:n_expected],
) # raise the exception only after all futures have failed
else:
return True, []
16 changes: 11 additions & 5 deletions src/executorlib/task_scheduler/interactive/dependency.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -177,17 +177,19 @@ def batched(
future_lst: list[Future] = []
for _ in range(len(iterable) // n + (1 if len(iterable) % n > 0 else 0)):
f: Future = Future()
f_skip: Future = Future()
if self._future_queue is not None:
self._future_queue.put(
{
"fn": "batched",
"args": (),
"kwargs": {"lst": iterable, "n": n, "skip_lst": skip_lst},
"future": f,
"future_skip": f_skip,
"resource_dict": {},
}
)
skip_lst = skip_lst.copy() + [f] # be careful
skip_lst = skip_lst.copy() + [f_skip] # be careful
future_lst.append(f)

return future_lst
Expand DownExpand Up@@ -330,7 +332,7 @@ def _update_waiting_task(
wait_tmp_lst = []
for task_wait_dict in wait_lst:
exception_lst = get_exception_lst(future_lst=task_wait_dict["future_lst"])
if len(exception_lst) > 0:
if len(exception_lst) > 0 and task_wait_dict["fn"] != "batched":
task_wait_dict["future"].set_exception(exception_lst[0])
elif task_wait_dict["fn"] != "batched" and all(
future.done() for future in task_wait_dict["future_lst"]
Expand All@@ -343,15 +345,19 @@ def _update_waiting_task(
elif task_wait_dict["fn"] == "batched" and all(
future.done() for future in task_wait_dict["kwargs"]["skip_lst"]
):
done_lst = batched_futures(
success, done_lst = batched_futures(
lst=task_wait_dict["kwargs"]["lst"],
n=task_wait_dict["kwargs"]["n"],
nested_skip_lst=task_wait_dict["kwargs"]["skip_lst"],
)
if len(done_lst) == 0:
if success and len(done_lst) == 0:
wait_tmp_lst.append(task_wait_dict)
elif success and len(done_lst) > 0:
task_wait_dict["future"].set_result([f.result() for f in done_lst])
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
task_wait_dict["future"].set_result(done_lst)
task_wait_dict["future"].set_exception(done_lst[0].exception())
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
wait_tmp_lst.append(task_wait_dict)
if len(wait_lst) == len(wait_tmp_lst):
Expand Down
24 changes: 24 additions & 0 deletions tests/unit/executor/test_single_dependencies.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -82,6 +82,30 @@ def test_batched(self):
self.assertEqual(len(result_lst), 4)
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error_future(self):
with SingleNodeExecutor() as exe:
t1 = time()
future_first_lst = []
for i in range(10):
if i % 3 == 0:
future_first_lst.append(exe.submit(raise_error, parameter=0))
else:
future_first_lst.append(exe.submit(return_input_dict, i))
future_second_lst = exe.batched(future_first_lst, n=3)

future_third_lst = []
for f in future_second_lst:
future_third_lst.append(exe.submit(sum, f))

t2 = time()
self.assertEqual(future_third_lst[0].result() + future_third_lst[1].result(), 27)
with self.assertRaises(RuntimeError):
future_third_lst[2].result()
with self.assertRaises(RuntimeError):
future_third_lst[3].result()
t3 = time()
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error(self):
with self.assertRaises(TypeError):
with SingleNodeExecutor() as exe:
Expand Down
79 changes: 67 additions & 12 deletions tests/unit/standalone/test_batched.py
Original file line numberDiff line numberDiff line change
@@ -1,27 +1,82 @@
from unittest import TestCase
import unittest
from concurrent.futures import Future
from executorlib.standalone.batched import batched_futures

from executorlib.task_scheduler.interactive.dependency import batched_futures

class TestBatched(TestCase):

class TestBatched(unittest.TestCase):
def test_batched_futures(self):
lst = []
for i in list(range(10)):
for i in range(10):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([0, 1, 2])
batched_lst[1].set_result([3, 4, 5])
batched_lst[2].set_result([6, 7, 8])
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [0, 1, 2])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3), [3, 4, 5])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3), [6, 7, 8])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3), [9])
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [0, 1, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 4, 5])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [6, 7, 8])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [9])

def test_batched_futures_duplicated(self):
lst = []
for i in range(1,4):
for _ in range(3):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 1, 1])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [2, 2, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 3, 3])

def test_batched_futures(self):
Comment thread
coderabbitai[bot] marked this conversation as resolved.
lst = []
for i in range(10):
f = Future()
if i % 3 == 0:
f.set_exception(ValueError(f"Error for {i}"))
else:
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future()]
batched_lst[0].set_result([id(lst[1]), id(lst[2]), id(lst[4])])
batched_lst[1].set_result([id(lst[5]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 2, 4])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [5, 7, 8])
succss, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertFalse(succss)
with self.assertRaises(ValueError):
raise done_lst[0].exception()

def test_batched_futures_not_finished(self):
lst = []
for _ in list(range(10)):
f = Future()
lst.append(f)
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual(done_lst, [])
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Highlight search terms from Google/DuckDuckGo/Bing referrer\n(function() {\n var ref = document.referrer;\n var terms = [];\n \n if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {\n var url = new URL(ref);\n var q = url.searchParams.get('q') || url.searchParams.get('p');\n if (q) {\n terms = q.split(/\\s+/).filter(function(t) { return t.length \u003e 2; });\n }\n }\n \n if (terms.length === 0) return;\n \n var style = document.createElement('style');\n style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';\n document.head.appendChild(style);\n \n function highlight(node) {\n if (node.nodeType === 3) { // text node\n var text = node.textContent;\n var found = false;\n terms.forEach(function(term) {\n var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\') + ')', 'gi');\n if (regex.test(text)) {\n found = true;\n var frag = document.createDocumentFragment();\n var parts = text.split(regex);\n parts.forEach(function(part, i) {\n if (i % 2 === 0) {\n frag.appendChild(document.createTextNode(part));\n } else {\n var span = document.createElement('span');\n span.className = 'userscript-highlight';\n span.textContent = part;\n frag.appendChild(span);\n }\n });\n node.parentNode.replaceChild(frag, node);\n }\n });\n } else if (node.nodeType === 1 && node.childNodes) { // element\n var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];\n if (!skipTags.includes(node.tagName)) {\n Array.from(node.childNodes).forEach(highlight);\n }\n }\n }\n \n highlight(document.body);\n \n // Re-highlight on dynamic content\n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1 || node.nodeType === 3) highlight(node);\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Highlight Search Terms"); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content
Merged
26 changes: 18 additions & 8 deletions src/executorlib/standalone/batched.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,27 +3,37 @@

def batched_futures(
lst: list[Future], nested_skip_lst: list[Future[list]], n: int
) -> list[list]:
) -> tuple[bool, list[Future]]:
"""
Batch n completed future objects. If the number of completed futures is smaller than n and the end of the batch is
not reached yet, then an empty list is returned. If n future objects are done, which are not included in the skip_set
then they are returned as batch.

Args:
lst (list): list of all future objects
nested_skip_lst (list): nest list of individual results already assigned to previous batches
nested_skip_lst (list): list of future objects, which contain the list of future objects ids which should be skipped for the batch
n (int): batch size

Returns:
list: results of the batched futures
"""
skip_set = {id(item) for f in nested_skip_lst for item in f.result()}
skip_set = {fid for f in nested_skip_lst for fid in f.result()}

done_lst = []
failed_lst = []
n_expected = min(n, len(lst) - len(skip_set))
for v in lst:
if v.done() and id(v.result()) not in skip_set:
done_lst.append(v.result())
if len(done_lst) == n_expected:
return done_lst
return []
if id(v) not in skip_set and v.done():
if v.exception() is not None:
failed_lst.append(v)
elif id(v) not in skip_set and v.done():
done_lst.append(v)
if len(done_lst) == n_expected:
return True, done_lst
if (len(lst) - len(skip_set)) == len(failed_lst):
return (
False,
failed_lst[:n_expected],
) # raise the exception only after all futures have failed
else:
return True, []
16 changes: 11 additions & 5 deletions src/executorlib/task_scheduler/interactive/dependency.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -177,17 +177,19 @@ def batched(
future_lst: list[Future] = []
for _ in range(len(iterable) // n + (1 if len(iterable) % n > 0 else 0)):
f: Future = Future()
f_skip: Future = Future()
if self._future_queue is not None:
self._future_queue.put(
{
"fn": "batched",
"args": (),
"kwargs": {"lst": iterable, "n": n, "skip_lst": skip_lst},
"future": f,
"future_skip": f_skip,
"resource_dict": {},
}
)
skip_lst = skip_lst.copy() + [f] # be careful
skip_lst = skip_lst.copy() + [f_skip] # be careful
future_lst.append(f)

return future_lst
Expand DownExpand Up@@ -330,7 +332,7 @@ def _update_waiting_task(
wait_tmp_lst = []
for task_wait_dict in wait_lst:
exception_lst = get_exception_lst(future_lst=task_wait_dict["future_lst"])
if len(exception_lst) > 0:
if len(exception_lst) > 0 and task_wait_dict["fn"] != "batched":
task_wait_dict["future"].set_exception(exception_lst[0])
elif task_wait_dict["fn"] != "batched" and all(
future.done() for future in task_wait_dict["future_lst"]
Expand All@@ -343,15 +345,19 @@ def _update_waiting_task(
elif task_wait_dict["fn"] == "batched" and all(
future.done() for future in task_wait_dict["kwargs"]["skip_lst"]
):
done_lst = batched_futures(
success, done_lst = batched_futures(
lst=task_wait_dict["kwargs"]["lst"],
n=task_wait_dict["kwargs"]["n"],
nested_skip_lst=task_wait_dict["kwargs"]["skip_lst"],
)
if len(done_lst) == 0:
if success and len(done_lst) == 0:
wait_tmp_lst.append(task_wait_dict)
elif success and len(done_lst) > 0:
task_wait_dict["future"].set_result([f.result() for f in done_lst])
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
task_wait_dict["future"].set_result(done_lst)
task_wait_dict["future"].set_exception(done_lst[0].exception())
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
wait_tmp_lst.append(task_wait_dict)
if len(wait_lst) == len(wait_tmp_lst):
Expand Down
24 changes: 24 additions & 0 deletions tests/unit/executor/test_single_dependencies.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -82,6 +82,30 @@ def test_batched(self):
self.assertEqual(len(result_lst), 4)
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error_future(self):
with SingleNodeExecutor() as exe:
t1 = time()
future_first_lst = []
for i in range(10):
if i % 3 == 0:
future_first_lst.append(exe.submit(raise_error, parameter=0))
else:
future_first_lst.append(exe.submit(return_input_dict, i))
future_second_lst = exe.batched(future_first_lst, n=3)

future_third_lst = []
for f in future_second_lst:
future_third_lst.append(exe.submit(sum, f))

t2 = time()
self.assertEqual(future_third_lst[0].result() + future_third_lst[1].result(), 27)
with self.assertRaises(RuntimeError):
future_third_lst[2].result()
with self.assertRaises(RuntimeError):
future_third_lst[3].result()
t3 = time()
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error(self):
with self.assertRaises(TypeError):
with SingleNodeExecutor() as exe:
Expand Down
79 changes: 67 additions & 12 deletions tests/unit/standalone/test_batched.py
Original file line numberDiff line numberDiff line change
@@ -1,27 +1,82 @@
from unittest import TestCase
import unittest
from concurrent.futures import Future
from executorlib.standalone.batched import batched_futures

from executorlib.task_scheduler.interactive.dependency import batched_futures

class TestBatched(TestCase):

class TestBatched(unittest.TestCase):
def test_batched_futures(self):
lst = []
for i in list(range(10)):
for i in range(10):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([0, 1, 2])
batched_lst[1].set_result([3, 4, 5])
batched_lst[2].set_result([6, 7, 8])
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [0, 1, 2])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3), [3, 4, 5])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3), [6, 7, 8])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3), [9])
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [0, 1, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 4, 5])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [6, 7, 8])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [9])

def test_batched_futures_duplicated(self):
lst = []
for i in range(1,4):
for _ in range(3):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 1, 1])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [2, 2, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 3, 3])

def test_batched_futures(self):
Comment thread
coderabbitai[bot] marked this conversation as resolved.
lst = []
for i in range(10):
f = Future()
if i % 3 == 0:
f.set_exception(ValueError(f"Error for {i}"))
else:
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future()]
batched_lst[0].set_result([id(lst[1]), id(lst[2]), id(lst[4])])
batched_lst[1].set_result([id(lst[5]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 2, 4])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [5, 7, 8])
succss, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertFalse(succss)
with self.assertRaises(ValueError):
raise done_lst[0].exception()

def test_batched_futures_not_finished(self):
lst = []
for _ in list(range(10)):
f = Future()
lst.append(f)
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual(done_lst, [])
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Strip utm_, fbclid, gclid, etc. from all links on page\n(function() {\n var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',\n 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',\n 'ref', 'ref_src', 'source', 'medium', 'campaign'];\n \n function cleanUrl(url) {\n try {\n var u = new URL(url, window.location.origin);\n var changed = false;\n trackingParams.forEach(function(p) {\n if (u.searchParams.has(p)) {\n u.searchParams.delete(p);\n changed = true;\n }\n });\n return changed ? u.toString() : url;\n } catch (e) {\n return url;\n }\n }\n \n function cleanLinks() {\n document.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n \n cleanLinks();\n \n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1) {\n if (node.tagName === 'A') cleanLinks();\n node.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Remove Tracking Parameters from Links"); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + '
Skip to content
Merged
26 changes: 18 additions & 8 deletions src/executorlib/standalone/batched.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,27 +3,37 @@

def batched_futures(
lst: list[Future], nested_skip_lst: list[Future[list]], n: int
) -> list[list]:
) -> tuple[bool, list[Future]]:
"""
Batch n completed future objects. If the number of completed futures is smaller than n and the end of the batch is
not reached yet, then an empty list is returned. If n future objects are done, which are not included in the skip_set
then they are returned as batch.

Args:
lst (list): list of all future objects
nested_skip_lst (list): nest list of individual results already assigned to previous batches
nested_skip_lst (list): list of future objects, which contain the list of future objects ids which should be skipped for the batch
n (int): batch size

Returns:
list: results of the batched futures
"""
skip_set = {id(item) for f in nested_skip_lst for item in f.result()}
skip_set = {fid for f in nested_skip_lst for fid in f.result()}

done_lst = []
failed_lst = []
n_expected = min(n, len(lst) - len(skip_set))
for v in lst:
if v.done() and id(v.result()) not in skip_set:
done_lst.append(v.result())
if len(done_lst) == n_expected:
return done_lst
return []
if id(v) not in skip_set and v.done():
if v.exception() is not None:
failed_lst.append(v)
elif id(v) not in skip_set and v.done():
done_lst.append(v)
if len(done_lst) == n_expected:
return True, done_lst
if (len(lst) - len(skip_set)) == len(failed_lst):
return (
False,
failed_lst[:n_expected],
) # raise the exception only after all futures have failed
else:
return True, []
16 changes: 11 additions & 5 deletions src/executorlib/task_scheduler/interactive/dependency.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -177,17 +177,19 @@ def batched(
future_lst: list[Future] = []
for _ in range(len(iterable) // n + (1 if len(iterable) % n > 0 else 0)):
f: Future = Future()
f_skip: Future = Future()
if self._future_queue is not None:
self._future_queue.put(
{
"fn": "batched",
"args": (),
"kwargs": {"lst": iterable, "n": n, "skip_lst": skip_lst},
"future": f,
"future_skip": f_skip,
"resource_dict": {},
}
)
skip_lst = skip_lst.copy() + [f] # be careful
skip_lst = skip_lst.copy() + [f_skip] # be careful
future_lst.append(f)

return future_lst
Expand DownExpand Up@@ -330,7 +332,7 @@ def _update_waiting_task(
wait_tmp_lst = []
for task_wait_dict in wait_lst:
exception_lst = get_exception_lst(future_lst=task_wait_dict["future_lst"])
if len(exception_lst) > 0:
if len(exception_lst) > 0 and task_wait_dict["fn"] != "batched":
task_wait_dict["future"].set_exception(exception_lst[0])
elif task_wait_dict["fn"] != "batched" and all(
future.done() for future in task_wait_dict["future_lst"]
Expand All@@ -343,15 +345,19 @@ def _update_waiting_task(
elif task_wait_dict["fn"] == "batched" and all(
future.done() for future in task_wait_dict["kwargs"]["skip_lst"]
):
done_lst = batched_futures(
success, done_lst = batched_futures(
lst=task_wait_dict["kwargs"]["lst"],
n=task_wait_dict["kwargs"]["n"],
nested_skip_lst=task_wait_dict["kwargs"]["skip_lst"],
)
if len(done_lst) == 0:
if success and len(done_lst) == 0:
wait_tmp_lst.append(task_wait_dict)
elif success and len(done_lst) > 0:
task_wait_dict["future"].set_result([f.result() for f in done_lst])
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
task_wait_dict["future"].set_result(done_lst)
task_wait_dict["future"].set_exception(done_lst[0].exception())
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
wait_tmp_lst.append(task_wait_dict)
if len(wait_lst) == len(wait_tmp_lst):
Expand Down
24 changes: 24 additions & 0 deletions tests/unit/executor/test_single_dependencies.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -82,6 +82,30 @@ def test_batched(self):
self.assertEqual(len(result_lst), 4)
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error_future(self):
with SingleNodeExecutor() as exe:
t1 = time()
future_first_lst = []
for i in range(10):
if i % 3 == 0:
future_first_lst.append(exe.submit(raise_error, parameter=0))
else:
future_first_lst.append(exe.submit(return_input_dict, i))
future_second_lst = exe.batched(future_first_lst, n=3)

future_third_lst = []
for f in future_second_lst:
future_third_lst.append(exe.submit(sum, f))

t2 = time()
self.assertEqual(future_third_lst[0].result() + future_third_lst[1].result(), 27)
with self.assertRaises(RuntimeError):
future_third_lst[2].result()
with self.assertRaises(RuntimeError):
future_third_lst[3].result()
t3 = time()
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error(self):
with self.assertRaises(TypeError):
with SingleNodeExecutor() as exe:
Expand Down
79 changes: 67 additions & 12 deletions tests/unit/standalone/test_batched.py
Original file line numberDiff line numberDiff line change
@@ -1,27 +1,82 @@
from unittest import TestCase
import unittest
from concurrent.futures import Future
from executorlib.standalone.batched import batched_futures

from executorlib.task_scheduler.interactive.dependency import batched_futures

class TestBatched(TestCase):

class TestBatched(unittest.TestCase):
def test_batched_futures(self):
lst = []
for i in list(range(10)):
for i in range(10):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([0, 1, 2])
batched_lst[1].set_result([3, 4, 5])
batched_lst[2].set_result([6, 7, 8])
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [0, 1, 2])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3), [3, 4, 5])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3), [6, 7, 8])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3), [9])
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [0, 1, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 4, 5])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [6, 7, 8])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [9])

def test_batched_futures_duplicated(self):
lst = []
for i in range(1,4):
for _ in range(3):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 1, 1])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [2, 2, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 3, 3])

def test_batched_futures(self):
Comment thread
coderabbitai[bot] marked this conversation as resolved.
lst = []
for i in range(10):
f = Future()
if i % 3 == 0:
f.set_exception(ValueError(f"Error for {i}"))
else:
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future()]
batched_lst[0].set_result([id(lst[1]), id(lst[2]), id(lst[4])])
batched_lst[1].set_result([id(lst[5]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 2, 4])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [5, 7, 8])
succss, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertFalse(succss)
with self.assertRaises(ValueError):
raise done_lst[0].exception()

def test_batched_futures_not_finished(self):
lst = []
for _ in list(range(10)):
f = Future()
lst.append(f)
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual(done_lst, [])
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Auto-enable theater mode on YouTube\n(function() {\n function tryTheater() {\n var btn = document.querySelector('button[aria-label=\"Theater mode\"], ytd-player #player button[title=\"Theater mode\"]');\n if (btn && !btn.classList.contains('activated')) {\n btn.click();\n }\n }\n \n // Try immediately\n tryTheater();\n \n // Try after navigation (SPA)\n var lastUrl = location.href;\n setInterval(function() {\n if (location.href !== lastUrl) {\n lastUrl = location.href;\n setTimeout(tryTheater, 500);\n }\n }, 1000);\n \n // Also try on player load\n var observer = new MutationObserver(tryTheater);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "YouTube Theater Mode Default"); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content
Merged
26 changes: 18 additions & 8 deletions src/executorlib/standalone/batched.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,27 +3,37 @@

def batched_futures(
lst: list[Future], nested_skip_lst: list[Future[list]], n: int
) -> list[list]:
) -> tuple[bool, list[Future]]:
"""
Batch n completed future objects. If the number of completed futures is smaller than n and the end of the batch is
not reached yet, then an empty list is returned. If n future objects are done, which are not included in the skip_set
then they are returned as batch.

Args:
lst (list): list of all future objects
nested_skip_lst (list): nest list of individual results already assigned to previous batches
nested_skip_lst (list): list of future objects, which contain the list of future objects ids which should be skipped for the batch
n (int): batch size

Returns:
list: results of the batched futures
"""
skip_set = {id(item) for f in nested_skip_lst for item in f.result()}
skip_set = {fid for f in nested_skip_lst for fid in f.result()}

done_lst = []
failed_lst = []
n_expected = min(n, len(lst) - len(skip_set))
for v in lst:
if v.done() and id(v.result()) not in skip_set:
done_lst.append(v.result())
if len(done_lst) == n_expected:
return done_lst
return []
if id(v) not in skip_set and v.done():
if v.exception() is not None:
failed_lst.append(v)
elif id(v) not in skip_set and v.done():
done_lst.append(v)
if len(done_lst) == n_expected:
return True, done_lst
if (len(lst) - len(skip_set)) == len(failed_lst):
return (
False,
failed_lst[:n_expected],
) # raise the exception only after all futures have failed
else:
return True, []
16 changes: 11 additions & 5 deletions src/executorlib/task_scheduler/interactive/dependency.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -177,17 +177,19 @@ def batched(
future_lst: list[Future] = []
for _ in range(len(iterable) // n + (1 if len(iterable) % n > 0 else 0)):
f: Future = Future()
f_skip: Future = Future()
if self._future_queue is not None:
self._future_queue.put(
{
"fn": "batched",
"args": (),
"kwargs": {"lst": iterable, "n": n, "skip_lst": skip_lst},
"future": f,
"future_skip": f_skip,
"resource_dict": {},
}
)
skip_lst = skip_lst.copy() + [f] # be careful
skip_lst = skip_lst.copy() + [f_skip] # be careful
future_lst.append(f)

return future_lst
Expand DownExpand Up@@ -330,7 +332,7 @@ def _update_waiting_task(
wait_tmp_lst = []
for task_wait_dict in wait_lst:
exception_lst = get_exception_lst(future_lst=task_wait_dict["future_lst"])
if len(exception_lst) > 0:
if len(exception_lst) > 0 and task_wait_dict["fn"] != "batched":
task_wait_dict["future"].set_exception(exception_lst[0])
elif task_wait_dict["fn"] != "batched" and all(
future.done() for future in task_wait_dict["future_lst"]
Expand All@@ -343,15 +345,19 @@ def _update_waiting_task(
elif task_wait_dict["fn"] == "batched" and all(
future.done() for future in task_wait_dict["kwargs"]["skip_lst"]
):
done_lst = batched_futures(
success, done_lst = batched_futures(
lst=task_wait_dict["kwargs"]["lst"],
n=task_wait_dict["kwargs"]["n"],
nested_skip_lst=task_wait_dict["kwargs"]["skip_lst"],
)
if len(done_lst) == 0:
if success and len(done_lst) == 0:
wait_tmp_lst.append(task_wait_dict)
elif success and len(done_lst) > 0:
task_wait_dict["future"].set_result([f.result() for f in done_lst])
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
task_wait_dict["future"].set_result(done_lst)
task_wait_dict["future"].set_exception(done_lst[0].exception())
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
wait_tmp_lst.append(task_wait_dict)
if len(wait_lst) == len(wait_tmp_lst):
Expand Down
24 changes: 24 additions & 0 deletions tests/unit/executor/test_single_dependencies.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -82,6 +82,30 @@ def test_batched(self):
self.assertEqual(len(result_lst), 4)
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error_future(self):
with SingleNodeExecutor() as exe:
t1 = time()
future_first_lst = []
for i in range(10):
if i % 3 == 0:
future_first_lst.append(exe.submit(raise_error, parameter=0))
else:
future_first_lst.append(exe.submit(return_input_dict, i))
future_second_lst = exe.batched(future_first_lst, n=3)

future_third_lst = []
for f in future_second_lst:
future_third_lst.append(exe.submit(sum, f))

t2 = time()
self.assertEqual(future_third_lst[0].result() + future_third_lst[1].result(), 27)
with self.assertRaises(RuntimeError):
future_third_lst[2].result()
with self.assertRaises(RuntimeError):
future_third_lst[3].result()
t3 = time()
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error(self):
with self.assertRaises(TypeError):
with SingleNodeExecutor() as exe:
Expand Down
79 changes: 67 additions & 12 deletions tests/unit/standalone/test_batched.py
Original file line numberDiff line numberDiff line change
@@ -1,27 +1,82 @@
from unittest import TestCase
import unittest
from concurrent.futures import Future
from executorlib.standalone.batched import batched_futures

from executorlib.task_scheduler.interactive.dependency import batched_futures

class TestBatched(TestCase):

class TestBatched(unittest.TestCase):
def test_batched_futures(self):
lst = []
for i in list(range(10)):
for i in range(10):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([0, 1, 2])
batched_lst[1].set_result([3, 4, 5])
batched_lst[2].set_result([6, 7, 8])
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [0, 1, 2])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3), [3, 4, 5])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3), [6, 7, 8])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3), [9])
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [0, 1, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 4, 5])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [6, 7, 8])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [9])

def test_batched_futures_duplicated(self):
lst = []
for i in range(1,4):
for _ in range(3):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 1, 1])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [2, 2, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 3, 3])

def test_batched_futures(self):
Comment thread
coderabbitai[bot] marked this conversation as resolved.
lst = []
for i in range(10):
f = Future()
if i % 3 == 0:
f.set_exception(ValueError(f"Error for {i}"))
else:
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future()]
batched_lst[0].set_result([id(lst[1]), id(lst[2]), id(lst[4])])
batched_lst[1].set_result([id(lst[5]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 2, 4])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [5, 7, 8])
succss, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertFalse(succss)
with self.assertRaises(ValueError):
raise done_lst[0].exception()

def test_batched_futures_not_finished(self):
lst = []
for _ in list(range(10)):
f = Future()
lst.append(f)
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual(done_lst, [])
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Remove or un-stick sticky/fixed headers that block content\n(function() {\n function unstick() {\n document.querySelectorAll('header, nav, [role=\"banner\"], .header, .navbar, .sticky, .fixed-top, [style*=\"position: fixed\"], [style*=\"position:sticky\"]').forEach(function(el) {\n if (el.style.position === 'fixed' || el.style.position === 'sticky' || \n getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {\n el.style.position = 'static';\n el.style.top = 'auto';\n el.style.zIndex = 'auto';\n }\n });\n }\n \n unstick();\n \n var observer = new MutationObserver(unstick);\n observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });\n})();", "Kill Sticky Headers"); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
Skip to content
Merged
26 changes: 18 additions & 8 deletions src/executorlib/standalone/batched.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,27 +3,37 @@

def batched_futures(
lst: list[Future], nested_skip_lst: list[Future[list]], n: int
) -> list[list]:
) -> tuple[bool, list[Future]]:
"""
Batch n completed future objects. If the number of completed futures is smaller than n and the end of the batch is
not reached yet, then an empty list is returned. If n future objects are done, which are not included in the skip_set
then they are returned as batch.

Args:
lst (list): list of all future objects
nested_skip_lst (list): nest list of individual results already assigned to previous batches
nested_skip_lst (list): list of future objects, which contain the list of future objects ids which should be skipped for the batch
n (int): batch size

Returns:
list: results of the batched futures
"""
skip_set = {id(item) for f in nested_skip_lst for item in f.result()}
skip_set = {fid for f in nested_skip_lst for fid in f.result()}

done_lst = []
failed_lst = []
n_expected = min(n, len(lst) - len(skip_set))
for v in lst:
if v.done() and id(v.result()) not in skip_set:
done_lst.append(v.result())
if len(done_lst) == n_expected:
return done_lst
return []
if id(v) not in skip_set and v.done():
if v.exception() is not None:
failed_lst.append(v)
elif id(v) not in skip_set and v.done():
done_lst.append(v)
if len(done_lst) == n_expected:
return True, done_lst
if (len(lst) - len(skip_set)) == len(failed_lst):
return (
False,
failed_lst[:n_expected],
) # raise the exception only after all futures have failed
else:
return True, []
16 changes: 11 additions & 5 deletions src/executorlib/task_scheduler/interactive/dependency.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -177,17 +177,19 @@ def batched(
future_lst: list[Future] = []
for _ in range(len(iterable) // n + (1 if len(iterable) % n > 0 else 0)):
f: Future = Future()
f_skip: Future = Future()
if self._future_queue is not None:
self._future_queue.put(
{
"fn": "batched",
"args": (),
"kwargs": {"lst": iterable, "n": n, "skip_lst": skip_lst},
"future": f,
"future_skip": f_skip,
"resource_dict": {},
}
)
skip_lst = skip_lst.copy() + [f] # be careful
skip_lst = skip_lst.copy() + [f_skip] # be careful
future_lst.append(f)

return future_lst
Expand DownExpand Up@@ -330,7 +332,7 @@ def _update_waiting_task(
wait_tmp_lst = []
for task_wait_dict in wait_lst:
exception_lst = get_exception_lst(future_lst=task_wait_dict["future_lst"])
if len(exception_lst) > 0:
if len(exception_lst) > 0 and task_wait_dict["fn"] != "batched":
task_wait_dict["future"].set_exception(exception_lst[0])
elif task_wait_dict["fn"] != "batched" and all(
future.done() for future in task_wait_dict["future_lst"]
Expand All@@ -343,15 +345,19 @@ def _update_waiting_task(
elif task_wait_dict["fn"] == "batched" and all(
future.done() for future in task_wait_dict["kwargs"]["skip_lst"]
):
done_lst = batched_futures(
success, done_lst = batched_futures(
lst=task_wait_dict["kwargs"]["lst"],
n=task_wait_dict["kwargs"]["n"],
nested_skip_lst=task_wait_dict["kwargs"]["skip_lst"],
)
if len(done_lst) == 0:
if success and len(done_lst) == 0:
wait_tmp_lst.append(task_wait_dict)
elif success and len(done_lst) > 0:
task_wait_dict["future"].set_result([f.result() for f in done_lst])
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
task_wait_dict["future"].set_result(done_lst)
task_wait_dict["future"].set_exception(done_lst[0].exception())
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
wait_tmp_lst.append(task_wait_dict)
if len(wait_lst) == len(wait_tmp_lst):
Expand Down
24 changes: 24 additions & 0 deletions tests/unit/executor/test_single_dependencies.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -82,6 +82,30 @@ def test_batched(self):
self.assertEqual(len(result_lst), 4)
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error_future(self):
with SingleNodeExecutor() as exe:
t1 = time()
future_first_lst = []
for i in range(10):
if i % 3 == 0:
future_first_lst.append(exe.submit(raise_error, parameter=0))
else:
future_first_lst.append(exe.submit(return_input_dict, i))
future_second_lst = exe.batched(future_first_lst, n=3)

future_third_lst = []
for f in future_second_lst:
future_third_lst.append(exe.submit(sum, f))

t2 = time()
self.assertEqual(future_third_lst[0].result() + future_third_lst[1].result(), 27)
with self.assertRaises(RuntimeError):
future_third_lst[2].result()
with self.assertRaises(RuntimeError):
future_third_lst[3].result()
t3 = time()
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error(self):
with self.assertRaises(TypeError):
with SingleNodeExecutor() as exe:
Expand Down
79 changes: 67 additions & 12 deletions tests/unit/standalone/test_batched.py
Original file line numberDiff line numberDiff line change
@@ -1,27 +1,82 @@
from unittest import TestCase
import unittest
from concurrent.futures import Future
from executorlib.standalone.batched import batched_futures

from executorlib.task_scheduler.interactive.dependency import batched_futures

class TestBatched(TestCase):

class TestBatched(unittest.TestCase):
def test_batched_futures(self):
lst = []
for i in list(range(10)):
for i in range(10):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([0, 1, 2])
batched_lst[1].set_result([3, 4, 5])
batched_lst[2].set_result([6, 7, 8])
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [0, 1, 2])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3), [3, 4, 5])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3), [6, 7, 8])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3), [9])
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [0, 1, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 4, 5])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [6, 7, 8])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [9])

def test_batched_futures_duplicated(self):
lst = []
for i in range(1,4):
for _ in range(3):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 1, 1])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [2, 2, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 3, 3])

def test_batched_futures(self):
Comment thread
coderabbitai[bot] marked this conversation as resolved.
lst = []
for i in range(10):
f = Future()
if i % 3 == 0:
f.set_exception(ValueError(f"Error for {i}"))
else:
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future()]
batched_lst[0].set_result([id(lst[1]), id(lst[2]), id(lst[4])])
batched_lst[1].set_result([id(lst[5]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 2, 4])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [5, 7, 8])
succss, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertFalse(succss)
with self.assertRaises(ValueError):
raise done_lst[0].exception()

def test_batched_futures_not_finished(self):
lst = []
for _ in list(range(10)):
f = Future()
lst.append(f)
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual(done_lst, [])
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Universal Dark Mode - works on any site\n(function() {\n var enabled = true;\n \n function applyDarkMode() {\n if (!enabled) return;\n \n // Create style element if it doesn't exist\n var style = document.getElementById('universal-dark-mode-style');\n if (!style) {\n style = document.createElement('style');\n style.id = 'universal-dark-mode-style';\n document.head.appendChild(style);\n }\n \n // Dark mode CSS - inverts colors but preserves images/video\n style.textContent = '\n /* Invert everything except media */\n html {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #1a1a2e !important;\n }\n \n /* Restore images, videos, iframes, canvas */\n img, video, iframe, canvas, svg, picture, [style*=\"background-image\"] {\n filter: invert(1) hue-rotate(180deg) !important;\n }\n \n /* Preserve specific elements that should not be inverted */\n .no-dark-mode, .no-dark-mode *,\n [data-theme=\"light\"], [data-theme=\"light\"],\n .ace_editor, .ace_editor *,\n .CodeMirror, .CodeMirror *,\n .monaco-editor, .monaco-editor *,\n .markdown-body pre, .markdown-body pre *,\n .highlight, .highlight *,\n pre code, pre code * {\n filter: none !important;\n }\n \n /* Fix common UI elements */\n .modal, .popup, .dropdown-menu, .tooltip, .popover {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #2d2d44 !important;\n border-color: #444 !important;\n }\n \n /* Scrollbars */\n ::-webkit-scrollbar { background: #1a1a2e !important; }\n ::-webkit-scrollbar-thumb { background: #444 !important; }\n ::-webkit-scrollbar-thumb:hover { background: #555 !important; }\n \n /* Selection */\n ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ';\n }\n \n function removeDarkMode() {\n var style = document.getElementById('universal-dark-mode-style');\n if (style) style.remove();\n }\n \n // Toggle with Alt+Shift+D\n document.addEventListener('keydown', function(e) {\n if (e.altKey && e.shiftKey && e.key === 'D') {\n e.preventDefault();\n enabled = !enabled;\n if (enabled) {\n applyDarkMode();\n console.log('[Universal Dark Mode] Enabled');\n } else {\n removeDarkMode();\n console.log('[Universal Dark Mode] Disabled');\n }\n }\n });\n \n // Apply on load\n applyDarkMode();\n \n // Re-apply on dynamic content\n var observer = new MutationObserver(function(mutations) {\n if (enabled && !document.getElementById('universal-dark-mode-style')) {\n applyDarkMode();\n }\n });\n observer.observe(document.head, { childList: true });\n \n console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');\n})();", "Universal Dark Mode"); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })();
Skip to content
Merged
26 changes: 18 additions & 8 deletions src/executorlib/standalone/batched.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -3,27 +3,37 @@

def batched_futures(
lst: list[Future], nested_skip_lst: list[Future[list]], n: int
) -> list[list]:
) -> tuple[bool, list[Future]]:
"""
Batch n completed future objects. If the number of completed futures is smaller than n and the end of the batch is
not reached yet, then an empty list is returned. If n future objects are done, which are not included in the skip_set
then they are returned as batch.

Args:
lst (list): list of all future objects
nested_skip_lst (list): nest list of individual results already assigned to previous batches
nested_skip_lst (list): list of future objects, which contain the list of future objects ids which should be skipped for the batch
n (int): batch size

Returns:
list: results of the batched futures
"""
skip_set = {id(item) for f in nested_skip_lst for item in f.result()}
skip_set = {fid for f in nested_skip_lst for fid in f.result()}

done_lst = []
failed_lst = []
n_expected = min(n, len(lst) - len(skip_set))
for v in lst:
if v.done() and id(v.result()) not in skip_set:
done_lst.append(v.result())
if len(done_lst) == n_expected:
return done_lst
return []
if id(v) not in skip_set and v.done():
if v.exception() is not None:
failed_lst.append(v)
elif id(v) not in skip_set and v.done():
done_lst.append(v)
if len(done_lst) == n_expected:
return True, done_lst
if (len(lst) - len(skip_set)) == len(failed_lst):
return (
False,
failed_lst[:n_expected],
) # raise the exception only after all futures have failed
else:
return True, []
16 changes: 11 additions & 5 deletions src/executorlib/task_scheduler/interactive/dependency.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -177,17 +177,19 @@ def batched(
future_lst: list[Future] = []
for _ in range(len(iterable) // n + (1 if len(iterable) % n > 0 else 0)):
f: Future = Future()
f_skip: Future = Future()
if self._future_queue is not None:
self._future_queue.put(
{
"fn": "batched",
"args": (),
"kwargs": {"lst": iterable, "n": n, "skip_lst": skip_lst},
"future": f,
"future_skip": f_skip,
"resource_dict": {},
}
)
skip_lst = skip_lst.copy() + [f] # be careful
skip_lst = skip_lst.copy() + [f_skip] # be careful
future_lst.append(f)

return future_lst
Expand DownExpand Up@@ -330,7 +332,7 @@ def _update_waiting_task(
wait_tmp_lst = []
for task_wait_dict in wait_lst:
exception_lst = get_exception_lst(future_lst=task_wait_dict["future_lst"])
if len(exception_lst) > 0:
if len(exception_lst) > 0 and task_wait_dict["fn"] != "batched":
task_wait_dict["future"].set_exception(exception_lst[0])
elif task_wait_dict["fn"] != "batched" and all(
future.done() for future in task_wait_dict["future_lst"]
Expand All@@ -343,15 +345,19 @@ def _update_waiting_task(
elif task_wait_dict["fn"] == "batched" and all(
future.done() for future in task_wait_dict["kwargs"]["skip_lst"]
):
done_lst = batched_futures(
success, done_lst = batched_futures(
lst=task_wait_dict["kwargs"]["lst"],
n=task_wait_dict["kwargs"]["n"],
nested_skip_lst=task_wait_dict["kwargs"]["skip_lst"],
)
if len(done_lst) == 0:
if success and len(done_lst) == 0:
wait_tmp_lst.append(task_wait_dict)
elif success and len(done_lst) > 0:
task_wait_dict["future"].set_result([f.result() for f in done_lst])
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
task_wait_dict["future"].set_result(done_lst)
task_wait_dict["future"].set_exception(done_lst[0].exception())
task_wait_dict["future_skip"].set_result([id(f) for f in done_lst])
else:
wait_tmp_lst.append(task_wait_dict)
if len(wait_lst) == len(wait_tmp_lst):
Expand Down
24 changes: 24 additions & 0 deletions tests/unit/executor/test_single_dependencies.py
Original file line numberDiff line numberDiff line change
Expand Up@@ -82,6 +82,30 @@ def test_batched(self):
self.assertEqual(len(result_lst), 4)
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error_future(self):
with SingleNodeExecutor() as exe:
t1 = time()
future_first_lst = []
for i in range(10):
if i % 3 == 0:
future_first_lst.append(exe.submit(raise_error, parameter=0))
else:
future_first_lst.append(exe.submit(return_input_dict, i))
future_second_lst = exe.batched(future_first_lst, n=3)

future_third_lst = []
for f in future_second_lst:
future_third_lst.append(exe.submit(sum, f))

t2 = time()
self.assertEqual(future_third_lst[0].result() + future_third_lst[1].result(), 27)
with self.assertRaises(RuntimeError):
future_third_lst[2].result()
with self.assertRaises(RuntimeError):
future_third_lst[3].result()
t3 = time()
self.assertTrue(t3-t2 > t2-t1)

def test_batched_error(self):
with self.assertRaises(TypeError):
with SingleNodeExecutor() as exe:
Expand Down
79 changes: 67 additions & 12 deletions tests/unit/standalone/test_batched.py
Original file line numberDiff line numberDiff line change
@@ -1,27 +1,82 @@
from unittest import TestCase
import unittest
from concurrent.futures import Future
from executorlib.standalone.batched import batched_futures

from executorlib.task_scheduler.interactive.dependency import batched_futures

class TestBatched(TestCase):

class TestBatched(unittest.TestCase):
def test_batched_futures(self):
lst = []
for i in list(range(10)):
for i in range(10):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([0, 1, 2])
batched_lst[1].set_result([3, 4, 5])
batched_lst[2].set_result([6, 7, 8])
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [0, 1, 2])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3), [3, 4, 5])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3), [6, 7, 8])
self.assertEqual(batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3), [9])
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [0, 1, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 4, 5])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [6, 7, 8])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [9])

def test_batched_futures_duplicated(self):
lst = []
for i in range(1,4):
for _ in range(3):
f = Future()
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future(), Future()]
batched_lst[0].set_result([id(lst[0]), id(lst[1]), id(lst[2])])
batched_lst[1].set_result([id(lst[3]), id(lst[4]), id(lst[5])])
batched_lst[2].set_result([id(lst[6]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 1, 1])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [2, 2, 2])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:2], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [3, 3, 3])

def test_batched_futures(self):
Comment thread
coderabbitai[bot] marked this conversation as resolved.
lst = []
for i in range(10):
f = Future()
if i % 3 == 0:
f.set_exception(ValueError(f"Error for {i}"))
else:
f.set_result(i)
lst.append(f)
batched_lst = [Future(), Future()]
batched_lst[0].set_result([id(lst[1]), id(lst[2]), id(lst[4])])
batched_lst[1].set_result([id(lst[5]), id(lst[7]), id(lst[8])])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [1, 2, 4])
success, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst[:1], n=3)
self.assertTrue(success)
self.assertEqual([f.result() for f in done_lst], [5, 7, 8])
succss, done_lst = batched_futures(lst=lst, nested_skip_lst=batched_lst, n=3)
self.assertFalse(succss)
with self.assertRaises(ValueError):
raise done_lst[0].exception()

def test_batched_futures_not_finished(self):
lst = []
for _ in list(range(10)):
f = Future()
lst.append(f)
self.assertEqual(batched_futures(lst=lst, n=3, nested_skip_lst=set()), [])
success, done_lst = batched_futures(lst=lst, n=3, nested_skip_lst=set())
self.assertTrue(success)
self.assertEqual(done_lst, [])
Loading