leetify: Leetify

In wrathematics/hackR: Tools for Leet Hackers in Search for a New Handle

Description

There is an element of random chance, so re-running the same code can produce different outputs. This is controlled to some degree by the leetness argument.

leetest() is just sugar for leetify(leetness=1).

Usage

leetify(handle, case.type = "alternating", sub.type = "simple",
  leetness = 0.4, include.unicode = FALSE)

leetest(handle, case.type = "alternating", sub.type = "simple",
  include.unicode = FALSE)

Arguments

handle	Input string to be l33tified.
case.type	String that determines the kind of casing to give the input handle. Choices are "lower", "upper", "unchanged", "random", and "alternating", and do basically exactly what they sound like.
sub.type	String that determines the kind of character substitutions
leetness	Heuristic between 0 and 1 (inclusive) that determines how often character substitutions (e.g., a to @) will take place.
include.unicode	Logical; determines if unicode substitutions should be allowed.

Details

Functions for converting boring handles into 133+ @cKeR handles.

Value

A leet hacker handle, for optimal gibson hacking.

See Also

rleet, caseify, replaceify

Examples

library(hackR, quietly=TRUE)
leetify("This is what the internet looked like 20 years ago")
leetest("This is what the internet looked like 20 years ago")

wrathematics/hackR documentation built on May 4, 2019, 9:49 a.m.