Discover gists

Building on Ubuntu 23.04

You have 2 options, use the script descrived bellow or follow the instrutions

script in this gist if you want the source code

wget https://gist.githubusercontent.com/Vertecedoc4545/6e54487f07a1888b656b656c0cdd9764/raw/2c5e8ccb428fc331307e2f653cab88174c051310/build-ubuntu-23.sh
chmod +x build-ubuntu-23.sh
./build-ubuntu-23.sh

Disable:

sudo launchctl unload -w /System/Library/LaunchDaemons/com.apple.metadata.mds.plist

Enable:

sudo launchctl load -w /System/Library/LaunchDaemons/com.apple.metadata.mds.plist

	const title_text = "𝗜'𝗺 𝗜𝘇𝘂𝗺𝗶...!!";
	const body_text = "𝐄𝐘𝐏𝐙";
	const source_url = "https://github.com/sataniceypz/Izumi-v2";
	large_thumb = false; // use true for larger thumbnail
	const logo = "https://i.imgur.com/4AKWozV.jpeg";
	var audios = ["https://i.imgur.com/tceIGIW.mp4","https://i.imgur.com/v1bYXlb.mp4","https://i.imgur.com/cGJ1Gyi.mp4","https://i.imgur.com/6HXfyVr.mp4","https://i.imgur.com/dPjoh3s.mp4","https://i.imgur.com/pbtSy0M.mp4","https://i.imgur.com/sDwfg29.mp4","https://i.imgur.com/8vhaz82.mp4"];

	// ===================================================================================
	// EZRA-XD MENTION AUDIO SENDER
	//

	// https://github.com/arhs/iban.js
	(function (root, factory) {
	if (typeof define === 'function' && define.amd) {
	// AMD. Register as an anonymous module.
	define(['exports'], factory);
	} else if (typeof exports === 'object' && typeof exports.nodeName !== 'string') {
	// CommonJS
	factory(exports);
	} else {
	// Browser globals

	function isBalancedTree(node) {
	if (node) {
	const keepSearch = h(node.right) - h(node.left) <= 1
	if (keepSearch) {
	return balancedTree(node.right) && balancedTree(node.left)
	}
	else return false
	}
	}

	function flatten(ary, ret = []) {
	return ary.reduce((ret, entry) => {
	(Array.isArray(entry))? flatten(entry, ret) : ret.push(entry)
	return ret
	}, ret)
	}

	console.log(flatten([[[0], [1]], [[2], [3]], [[4], [5]]]))

	const memo = {}
	function fibonacci(n, memo){
	if(n<2)
	return n
	if(!memo[n-1])
	memo[n-1] = fibonacci(n-1, memo)
	if(!memo[n-2])
	memo[n-2] = fibonacci(n-2, memo)
	return memo[n-1] + memo[n-2]
	}

	function reverseString(str) {
	return str.split('').reverse().join('');
	}

	const isParenthesisMatching = (str) => {
	const stack = []

	const open = {
	'{': '}',
	'[': ']',
	'(': ')'
	}

	const closed = {

	function add(x) {
	return (y) => x + y;
	}