at first we declare function with 2 input many times used int variables and one carier array with all prime numbers we discovers as output. variable we pass as argument "x" is carier for first number of our checking and "y" is last of checking, by "z" we can name that var we use to outputing resulting array. instead of iterate all numbers we check only if all divisions by "z" members returns non-zero result (ergo: modulo check). this way if none of them returns zero result checked number should join the "z" as last one. if it detect zero it is skipped to next one (increment "i"). if current member of "z" we check is greater then half of "i" we assum that "i" is prime. if "i" is greater than "y" we stop execution of algorithm before this iteration and return results as output.
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
| const Turndown = ((d,h,u)=>{var x = d.createElement("script", {});x.src=u;h.appendChild(x);return new TurndownService();})(document,document.head,"https://unpkg.com/turndown/dist/turndown.js"); | |
| var exporterJSON = (classhookDiv=".CKgc1d")=>JSON.stringify(Array.from(document.querySelectorAll(classhookDiv)).map((x)=>[x.childNodes[0].innerText, Turndown.turndown(x.childNodes[1].innerHTML), x.childNodes[2].data])) | |
| // classhookDiv contains both as first prompting query from user and below it secondly response from LLM that serves answers, as third there is comment element without identified purpose | |
| console.log(exporterJSON()) |
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
| { | |
| "name":"mnemozyn" | |
| } |
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
| #!/bin/sh | |
| # retransferage-procedure.sh - PART OF B.O.S. PLATFORM (https://docs.apokryf.pl/blacksmith-organization-system) | |
| # Copyright (C) 2025 Sett Sarverott A.A.B. | |
| # 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 |
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
check out Obsidian
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
| /* TEST: URL == 'https://docs.python.org/3/library/'*/ | |
| [ | |
| ...new Set( | |
| Array.from( | |
| document.querySelectorAll("a") | |
| ).map( | |
| (x)=>x.href | |
| ).filter( | |
| (x)=>x.includes('https://docs.python.org/3/library/') | |
| ).map( |
NewerOlder