dankwiki - recent changes [en]

Wordlist

Dank — Sat, 18 Apr 2026 05:28:57 GMT

← Older revision		Revision as of 05:28, 18 April 2026
Line 1:		Line 1:
	use these words in daily speech, and you too can be a big asshole!		use these words in daily speech, and you too can be a big asshole!

			* autothysis - suicidal altruism, when a eusocial animal explodes for the better of the hive
	* murmuration - the collective movement of flocks of starlings, particularly during twilight		* murmuration - the collective movement of flocks of starlings, particularly during twilight
	* psithurism - a soft, calming, and rustling noise caused by wind passing through leaves and branches		* psithurism - a soft, calming, and rustling noise caused by wind passing through leaves and branches

Dank — Tue, 14 Apr 2026 18:43:47 GMT

procfs support

@@ Line 3: / Line 3: @@
 NFS version 2 was specified in RFC 1094. Version 3 was RFC 1813, and version 4 was RFC 3530.
-This page discusses [[Linux|Linux's]] kernel NFS implementation circa 3.0.4. Relevant man pages include <tt>exports(5)</tt> and <tt>nfs(5)</tt>/<tt>nfs.conf(5)</tt>.
+Relevant man pages include <tt>exports(5)</tt> and <tt>nfs(5)</tt>/<tt>nfs.conf(5)</tt>.
 ==NFSv4-only==
 So long as you're only running NFSv4, you don't need <tt>rpc-statd</tt> nor <tt>rpcbind</tt>. Edit <tt>/etc/nfs.conf</tt>, and add <tt>vers3=n</tt> under the <tt>[nfsd]</tt> section. You can now disable the <tt>rpc-statd-notify</tt>, <tt>rpc-statd</tt>, <tt>rpcbind.socket</tt>, and <tt>rpcbind</tt> services.
 ==Sideband protocols==

Dank — Tue, 14 Apr 2026 03:49:06 GMT

← Older revision		Revision as of 03:49, 14 April 2026
Line 126:		Line 126:
	* Damerau-Levenshtein distance		* Damerau-Levenshtein distance
	* Damm Algorithm		* Damm Algorithm
	* Davis-Putnam Algorithm		* The <b>Davis-Putnam Algorithm</b> verifies formulas in first order logic using the resolution method from prepositional logic. It requires exponential space in the worst case, and only terminates for valid formulae.
	* Davis-Putnam-Logemann-Loveland Algorithm		* The <b>Davis-Putnam-Logemann-Loveland Algorithm</b> improves on the basic DP algorithm, requiring linear space in the worst case and terminating for all formulae.
	* De Bruijn presentation		* De Bruijn presentation
	* De Bruijn string		* De Bruijn string