Source:NetHack 3.4.3/src/hacklib.c - Revision history

Furey: Fix instructions for linking to a particular line. Current instructions incorrectly link to a different version of NetHack.

2024-06-25T18:18:20Z

Fix instructions for linking to a particular line. Current instructions incorrectly link to a different version of NetHack.

Furey: /* xcrypt */ Send rot13 reference to wikipedia. Fixes a redlink.

2024-06-17T18:41:09Z

‎xcrypt: Send rot13 reference to wikipedia. Fixes a redlink.

Furey: /* upstart */ delinkify "noun". Fixes a redlink.

2024-06-17T06:46:50Z

‎upstart: delinkify "noun". Fixes a redlink.

Furey: Delinkify "moves". It's not used in some technical nethack sense here. Just king-move distance utility function. Fixes a redlink.

2024-06-17T06:23:49Z

Delinkify "moves". It's not used in some technical nethack sense here. Just king-move distance utility function. Fixes a redlink.

Furey: /* pmatch */ send goto over to wikipedia:goto. fixes a redlink.

2024-06-16T23:53:29Z

‎pmatch: send goto over to wikipedia:goto. fixes a redlink.

Furey: Fix redlinks.

2024-06-16T22:36:45Z

Fix redlinks.

Furey: Delinkify "string" (as in C string). Fixes a redlink.

2024-06-16T19:47:45Z

Delinkify "string" (as in C string). Fixes a redlink.

Qazmlpok: /* pmatch */ Fixing ref of TRUE/FALSE definition, see talk.

2011-03-17T01:59:48Z

‎pmatch: Fixing ref of TRUE/FALSE definition, see talk.

Paxedbot: moved Source:Hacklib.c to Source:NetHack 3.4.3/src/hacklib.c: Moving src to subdirs

2011-01-31T19:21:56Z

moved Source:Hacklib.c to Source:NetHack 3.4.3/src/hacklib.c: Moving src to subdirs

Paxedbot: Adding MIXEDSYNTAXHIGHLIGHT

2010-11-20T18:28:57Z

Adding __MIXEDSYNTAXHIGHLIGHT__

@@ Line 1: / Line 1: @@
 __MIXEDSYNTAXHIGHLIGHT__
-Below is the full text to src/hacklib.c from NetHack 3.4.3. To link to a particular line, write [[hacklib.c#line123|<nowiki>[[hacklib.c#line123]]</nowiki>]], for example.
+Below is the full text to src/hacklib.c from NetHack 3.4.3. To link to a particular line, write [[Source:NetHack 3.4.3/src/hacklib.c#line123]], for example.
 The C functions in hacklib.c are old but still work. (Today's standard C libraries provide better replacements for some of them.) They provide miscellaneous features such as handling character strings and finding the phase of the [[moon]]. The [[#setrandom|<tt>setrandom</tt>]] code to seed the [[random number generator]] is also here.

@@ Line 298: / Line 298: @@
   <span id="line181">181.  </span>
-As do some other symmetric ciphers, the <tt>xcrypt</tt> generates a stream of data, then exclusive-ors the generated stream with the ciphertext to decode it (or with the plaintext to encode it). Because <tt>xcrypt</tt> does not use a secret key to seed a secure [[random number generator]], <tt>xcrypt</tt> provides only trivial security, though <tt>xcrypt</tt> does better than [[ROT13]].
+As do some other symmetric ciphers, the <tt>xcrypt</tt> generates a stream of data, then exclusive-ors the generated stream with the ciphertext to decode it (or with the plaintext to encode it). Because <tt>xcrypt</tt> does not use a secret key to seed a secure [[random number generator]], <tt>xcrypt</tt> provides only trivial security, though <tt>xcrypt</tt> does better than [[wikipedia:ROT13|ROT13]].
 == onlyspace ==

@@ Line 142: / Line 142: @@
 == upstart ==
-The <tt>upstart</tt> function uppercases the first letter of a string buffer in place (by overwriting and not copying). We need this when placing [[noun]]s for [[monster]]s like "it" and "the newt" at the beginning of a sentence.
+The <tt>upstart</tt> function uppercases the first letter of a string buffer in place (by overwriting and not copying). We need this when placing nouns for [[monster]]s like "it" and "the newt" at the beginning of a sentence.
   <span id="line97">97.   char *</span>

@@ Line 508: / Line 508: @@
 == distmin ==
-The <tt>distmin</tt> function computes the number of [[move]]s in the shortest path between two points in the [[dungeon]], using the formula:
+The <tt>distmin</tt> function computes the number of moves in the shortest path between two points in the [[dungeon]], using the formula:
   ''distmin[(x0,y0),(x1,y1)] = max[ |x0-x1|, |y0-y1| ]''

@@ Line 603: / Line 603: @@
   <span id="line353">353.  </span>
-The comments in the source explain how it works. The function returns either TRUE or FALSE, those constants having been defined in [[global.h]]. The [[goto]] statement of line 350, along with the ++ operators of 341, "optimize tail recursion" into iteration, though some compilers can also do this. A while loop or for loop might have made an easier read.
+The comments in the source explain how it works. The function returns either TRUE or FALSE, those constants having been defined in [[global.h]]. The [[wikipedia:goto|goto]] statement of line 350, along with the ++ operators of 341, "optimize tail recursion" into iteration, though some compilers can also do this. A while loop or for loop might have made an easier read.
 We could rewrite this function with the [http://www.freebsd.org/cgi/man.cgi?query=fnmatch&sektion=3 <tt>fnmatch</tt>] function in the C libraries of [[Unix]] systems:

@@ Line 268: / Line 268: @@
 Unlike [http://www.freebsd.org/cgi/man.cgi?query=strcpy&sektion=3 <tt>strcpy</tt>], this <tt>s_suffix</tt> function does not take a buffer for the new string as a parameter. Instead, <tt>s_suffix</tt> places the posessive string in its own static buffer. This has two consequences:
-* String longer than [[BUFSZ]]-1 would overflow, so we must not use very long names.
+* String longer than <code>BUFSZ-1</code> would overflow, so we must not use very long names.
 * We can have only one possessive noun at each time. This translates the rule that whenever we call [[pline.c#pline|<tt>pline</tt>]] or any of its variants in [[pline.c]], we can use <tt>s_suffix</tt> only once, for example ''"You eat the gnome's brain!"'' ([[uhitm.c#line1537]]) Using a second possessive from a different function like [[pline.c#Your|<tt>Your</tt>]] or <tt>mhis</tt> (a macro in [[you.h]]) does not count, for example ''"The gnome's helmet blocks your attack to her head!"''
@@ Line 318: / Line 318: @@
 The <tt>tabexpand</tt> function replaces tabs with spaces, as if the tab advanced to the next column and the colums were 8 characters wide. It does this expansion in place. (Actually, it does the expansion in its internal buffer, then copies the result overwriting the input buffer.)
-The input buffer <tt>sbuf</tt> needs to be at least [[BUFSZ]] large to keep room for the expansion. The internal buffer <tt>char buf[BUFSZ]</tt> prevents <tt>tabexpand</tt> from handling longer expansions.
+The input buffer <tt>sbuf</tt> needs to be at least <code>BUFSZ</code> large to keep room for the expansion. The internal buffer <tt>char buf[BUFSZ]</tt> prevents <tt>tabexpand</tt> from handling longer expansions.
   <span id="line193">193.  #ifdef OVLB</span>
@@ Line 344: / Line 344: @@
   <span id="line215">215.  </span>
-The <tt>tabexpand</tt> function overflows if the expansion is larger than [[BUFSZ]]-1 characters. A string containing only 32 tabs would overflow the buffer when BUFSZ is 256. The comment upon line 204 warns that the function will not check against overflow, even though the programmer knew that <tt>buf</tt> holds only BUFSZ bytes.
+The <tt>tabexpand</tt> function overflows if the expansion is larger than <code>BUFSZ-1</code> characters. A string containing only 32 tabs would overflow the buffer when BUFSZ is 256. The comment upon line 204 warns that the function will not check against overflow, even though the programmer knew that <tt>buf</tt> holds only BUFSZ bytes.
 NetHack uses <tt>tabexpand</tt> when displaying from files that contain tabs.
@@ Line 542: / Line 542: @@
   <span id="line316">316.  </span>
-The returned distance is in square squares! We take the unit to be "squares", because each [[dungeon square]] has sides of length 1. Take the distance between two dungeon squares in squares, and multiply it by itself, squaring it, yielding square squares. This leads to the important corollary,
+The returned distance is in square squares! We take the unit to be "squares", because each dungeon [[square]] has sides of length 1. Take the distance between two dungeon squares in squares, and multiply it by itself, squaring it, yielding square squares. This leads to the important corollary,
 : ''Some squares are not square.''

@@ Line 2: / Line 2: @@
 Below is the full text to src/hacklib.c from NetHack 3.4.3. To link to a particular line, write [[hacklib.c#line123|<nowiki>[[hacklib.c#line123]]</nowiki>]], for example.
-The C functions in hacklib.c are old but still work. (Today's standard C libraries provide better replacements for some of them.) They provide miscellaneous features such as handling character [[string]]s and finding the phase of the [[moon]]. The [[#setrandom|<tt>setrandom</tt>]] code to seed the [[random number generator]] is also here.
+The C functions in hacklib.c are old but still work. (Today's standard C libraries provide better replacements for some of them.) They provide miscellaneous features such as handling character strings and finding the phase of the [[moon]]. The [[#setrandom|<tt>setrandom</tt>]] code to seed the [[random number generator]] is also here.
 == Top of file ==

← Older revision	Revision as of 19:21, 31 January 2011
(No difference)

← Older revision		Revision as of 18:28, 20 November 2010
Line 1:		Line 1:
		+	__MIXEDSYNTAXHIGHLIGHT__
	Below is the full text to src/hacklib.c from NetHack 3.4.3. To link to a particular line, write [[hacklib.c#line123\|<nowiki>[[hacklib.c#line123]]</nowiki>]], for example.		Below is the full text to src/hacklib.c from NetHack 3.4.3. To link to a particular line, write [[hacklib.c#line123\|<nowiki>[[hacklib.c#line123]]</nowiki>]], for example.