| Package | Description |
|---|---|
| me.gosimple.nbvcxz.matching.match | |
| me.gosimple.nbvcxz.resources |
| Modifier and Type | Method and Description |
|---|---|
AdjacencyGraph |
SpacialMatch.getAdjacencyGraph() |
| Constructor and Description |
|---|
SpacialMatch(String match,
Configuration configuration,
int start_index,
int end_index,
AdjacencyGraph adjacencyGraph,
int turns,
int shiftedNumber)
Create a new
SpacialMatch which is a sequence of characters
following themselves on the keyboard/keypad |
| Modifier and Type | Method and Description |
|---|---|
List<AdjacencyGraph> |
Configuration.getAdjacencyGraphs() |
static List<AdjacencyGraph> |
ConfigurationBuilder.getDefaultAdjacencyGraphs() |
| Modifier and Type | Method and Description |
|---|---|
static Set<Character> |
AdjacencyGraphUtil.getNeighbors(AdjacencyGraph adjacencyGraph,
Character key)
Returns a set of neighbors for a specific character.
|
static int |
AdjacencyGraphUtil.getShifts(AdjacencyGraph adjacencyGraph,
String part)
Returns the number of shifts in case in the part passed in.
|
static int |
AdjacencyGraphUtil.getTurns(AdjacencyGraph adjacencyGraph,
String part)
Returns the number of turns in the part passed in based on the adjacency graph.
|
| Modifier and Type | Method and Description |
|---|---|
ConfigurationBuilder |
ConfigurationBuilder.setAdjacencyGraphs(List<AdjacencyGraph> adjacencyGraphs)
AdjacencyGraphs are used to find spacial patterns within passwords (e.g. |
| Constructor and Description |
|---|
Configuration(List<PasswordMatcher> passwordMatchers,
Map<String,Long> guessTypes,
List<Dictionary> dictionaries,
List<AdjacencyGraph> adjacencyGraphs,
Map<Character,Character> leetTable,
Pattern yearPattern,
Double minimumEntropy,
Locale locale,
boolean distanceCalc,
long combinationAlgorithmTimeout) |
Copyright © 2017. All rights reserved.