Jaseem Abid jaseemabid

Safe

A safe storage for your personal data like photos, documents and notes for life. Privacy and safety over anything else.

A dead simple folder you can drag and drop files into and forget about. As simple as dropbox but something you can trust.

	/*! Top K elements of an unordered list

	There are 3 ways to get the top k elements from an unsorted list.

	1. Build a heap with all the elements and pop k times
	2. Sort the whole list and return a slice from the end
	3. Quick select k elements

	Naively, I would expect 1 to be slowest, 2 to be faster and 3 the fastest.

	//! Leveshtein distance
	//!
	//! Leveshtein distance considers the 3 possibilities strings can differ -
	//! addition, subtraction and deletion at each state of iteration and tries all
	//! the cases to find the minimum distance.

	use std::{collections::HashMap, convert::TryInto};

	pub fn levenshtein(a: &str, b: &str) -> i32 {
	cached(a, b, &mut HashMap::new())

	#include <stdio.h>
	#include <stdlib.h>
	#include <stdint.h>
	#ifdef _MSC_VER
	#include <intrin.h> /* for rdtscp and clflush */
	#pragma optimize("gt",on)
	#else
	#include <x86intrin.h> /* for rdtscp and clflush */
	#endif

	# /etc/NetworkManager/conf.d/30-randomize-mac-address.conf

	# REQUIRES NETWORK MANAGER >= 1.4.1 (Ubuntu Zesty and above)

	# Thanks to https://blogs.gnome.org/thaller/2016/08/26/mac-address-spoofing-in-networkmanager-1-4-0/

	# This randomize your MAC address for new connections

	# Be sure to change your existing (saved) connections in
	# /etc/NetworkManager/system-connections/*