Browse code

Typo fix, cleanup for github

Zoltan Puskas authored on 26/12/2013 22:48:35
Showing 3 changed files

1 1
deleted file mode 100644
... ...
@@ -1 +0,0 @@
1
-Zoltan Puskas <zoltan@sinustrom.info>
... ...
@@ -7,9 +7,6 @@
7 7
 # This program is free software and redistributred under the 3-clause BSD
8 8
 # license. For details see attached license file COPYING
9 9
 #
10
-# Maintainer: Zoltan Puskas <zoltan@sinustrom.info>
11
-# Created on: 2012.02.03.
12
-#
13 10
 
14 11
 import re
15 12
 from subprocess import *
... ...
@@ -29,16 +29,13 @@
29 29
  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 30
  * SUCH DAMAGE.
31 31
  *
32
- * Maintainer: Zoltan Puskas <zoltan@sinustrom.info>
33
- * Created on: 2011.10.10.
34
- *
35 32
  * The programs purpose is to calculate all possible valid Android unlock 
36
- * patterns. This is used for informational purposes (my intrest). Also this
33
+ * patterns. This is used for informational purposes (my interest). Also this
37 34
  * program can be used to generate a random pattern to use on the phone 
38 35
  * (something like `pwgen`).
39 36
  *
40 37
  * On the Android lock screen there are 9 dots arranged in a 3x3 matrix. A 
41
- * pattern of arbirtary length must be drawn on the screen in order to unlock
38
+ * pattern of arbitrary length must be drawn on the screen in order to unlock
42 39
  * the phone.
43 40
  * The following restrictions apply to the pattern drawing:
44 41
  *  - any point can be used only once
... ...
@@ -46,7 +43,7 @@
46 43
  *  - pattern can contain maximum 9 points
47 44
  *  - cannot jump over neighboring points (e.g. moving finger from point 1 to 3
48 45
  *    will automatically connect point 2 to form pattern 1-2-3, unless 2 is
49
- *    alreay used in which case ..-1-3-.. is possible).
46
+ *    already used in which case ..-1-3-.. is possible).
50 47
  *
51 48
  */
52 49
 
... ...
@@ -128,7 +125,7 @@ int main(int argc, char *argv[])
128 125
         }
129 126
     }
130 127
 
131
-    /* parse agrumenst */
128
+    /* parse arguments */
132 129
     while((opt = getopt(argc, argv, "sr:o:g:e:h")) != -1) {
133 130
         switch (opt) {
134 131
         case 's':
... ...
@@ -145,7 +142,7 @@ int main(int argc, char *argv[])
145 142
             pattern_file = fopen(optarg, "w");
146 143
             if (pattern_file == NULL) {
147 144
                 fprintf(stderr, 
148
-                "Could not open \"%s\" output file for writting",
145
+                "Could not open \"%s\" output file for writing",
149 146
                 optarg);
150 147
             }
151 148
             break;
... ...
@@ -228,7 +225,7 @@ void print_help(const char* argv0)
228 225
     fprintf(stderr,
229 226
             "Aupatterns. (c) 2011 Zoltan Puskas <zoltan@sinustrom.info>\n");
230 227
     fprintf(stderr,
231
-            "This software is provided under the 3-clause BSD licese.\n\n");
228
+            "This software is provided under the 3-clause BSD license.\n\n");
232 229
     fprintf(stderr,
233 230
             "Usage: %s [-s] [-r LENGTH] [-o FILE] [-g NODES] [-e EDGE] [-h]\n",
234 231
             argv0);
... ...
@@ -318,7 +315,7 @@ void add_subnodes(struct tree_node *parent_node,
318 315
 }
319 316
 
320 317
 /*
321
- * Delte entire subtree under the node
318
+ * Delete entire subtree under the node
322 319
  *
323 320
  * \param node The node under which the subtree must be deleted.
324 321
  */
... ...
@@ -338,7 +335,7 @@ void delete_subtree(struct tree_node *node)
338 335
 }
339 336
 
340 337
 /*
341
- * Function to decide whether it is an illegal transition on the 
338
+ * Function to decide whether it is an illegal transition on 
342 339
  * the current branch or not
343 340
  *
344 341
  * \param parent_id Node ID of the parent
... ...
@@ -496,7 +493,7 @@ void print_random_patterns(const struct tree_node * const root_node, int len)
496 493
  * Fill up the restricted transition matrix with the limited transitions
497 494
  *
498 495
  * \param nodelist node numbers
499
- * \param block_matrix the transion matrix to set up
496
+ * \param block_matrix the transition matrix to set up
500 497
  */
501 498
 void fill_guess_matrix(char* nodelist, int block_matrix[][10])
502 499
 {