Package: libjudy-dev Version: 1.0.1-5 Severity: minor Tags: patch When I see Judy's man pages using 'man' command (xterm or mrxvt) I don't see some important lines in them.
The patch follows diff -Nurb judy-1.0.1.orig/doc/man/man3/Judy1 judy-1.0.1/doc/man/man3/Judy1 --- judy-1.0.1.orig/doc/man/man3/Judy1 2005-05-27 17:03:41.000000000 +0300 +++ judy-1.0.1/doc/man/man3/Judy1 2005-10-04 21:29:48.000000000 +0300 @@ -91,7 +91,7 @@ they are the preferred way of calling the Judy1 functions. .PP .TP 15 -.C \fBJ1S(Rc_int, PJ1Array, Index);\fP // \fBJudy1Set()\fP +\fBJ1S(Rc_int, PJ1Array, Index);\fP // \fBJudy1Set()\fP Set \fBIndex\fP's bit in the Judy1 array \fBPJ1Array\fP. .IP Return \fBRc_int\fP set to 1 if \fBIndex\fP's bit was previously unset @@ -99,7 +99,7 @@ if the bit was already set (unsuccessful). .IP .TP 15 -.C \fBJ1U(Rc_int, PJ1Array, Index);\fP // \fBJudy1Unset()\fP +\fBJ1U(Rc_int, PJ1Array, Index);\fP // \fBJudy1Unset()\fP Unset \fBIndex\fP's bit in the Judy1 array \fBPJ1Array\fP; that is, remove \fBIndex\fP from the Judy1 array. .IP @@ -108,7 +108,7 @@ if the bit was already unset (unsuccessful). .IP .TP 15 -.C \fBJ1T(Rc_int, PJ1Array, Index);\fP // \fBJudy1Test()\fP +\fBJ1T(Rc_int, PJ1Array, Index);\fP // \fBJudy1Test()\fP Test if \fBIndex\fP's bit is set in the Judy1 array \fBPJ1Array\fP. .IP @@ -117,7 +117,7 @@ 0 if it is unset (\fBIndex\fP is absent). .IP .TP 15 -.C \fBJ1C(Rc_word, PJ1Array, Index1, Index2);\fP // \fBJudy1Count()\fP +\fBJ1C(Rc_word, PJ1Array, Index1, Index2);\fP // \fBJudy1Count()\fP Count the number of indexes present in the Judy1 array \fBPJ1Array\fP between \fBIndex1\fP and \fBIndex2\fP (inclusive). @@ -139,7 +139,7 @@ \fBNote:\fP The -1 promotes to the maximum index, that is, all ones. .IP .TP 15 -.C \fBJ1BC(Rc_int, PJ1Array, Nth, Index);\fP // \fBJudy1ByCount()\fP +\fBJ1BC(Rc_int, PJ1Array, Nth, Index);\fP // \fBJudy1ByCount()\fP Locate the \fBNth\fP index that is present in the Judy1 array \fBPJ1Array\fP (\fBNth\fP = 1 returns the first index present). To refer to the last index in a fully populated array (all indexes @@ -151,7 +151,7 @@ useful information). .IP .TP 15 -.C \fBJ1FA(Rc_word, PJ1Array);\fP // \fBJudy1FreeArray()\fP +\fBJ1FA(Rc_word, PJ1Array);\fP // \fBJudy1FreeArray()\fP Free the entire Judy1 array \fBPJ1Array\fP (much faster than using a \fBJ1N()\fP, \fBJ1U()\fP loop). .IP @@ -159,13 +159,13 @@ and \fBPJ1Array\fP set to \fBNULL\fP. .IP .TP 15 -.C \fBJ1MU(Rc_word, PJ1Array);\fP // \fBJudy1MemUsed()\fP +\fBJ1MU(Rc_word, PJ1Array);\fP // \fBJudy1MemUsed()\fP Return \fBRc_word\fP set to the number of bytes of memory currently in use by Judy1 array \fBPJ1Array\fP. This is a very fast routine, and may be used after a \fBJ1S()\fP or \fBJ1U()\fP call with little performance impact. .IP .TP 15 -.C \fBJudy1 Search Functions\fP +\fBJudy1 Search Functions\fP The Judy1 search functions allow you to search for set or unset bits in the array. You may search inclusively or exclusively, in either forward or reverse directions. @@ -177,7 +177,7 @@ since a search failure is possible. .IP .TP 15 -.C \fBJ1F(Rc_int, PJ1Array, Index);\fP // \fBJudy1First()\fP +\fBJ1F(Rc_int, PJ1Array, Index);\fP // \fBJudy1First()\fP Search (inclusive) for the first index present that is equal to or greater than the passed \fBIndex\fP. (Start with \fBIndex\fP = 0 to find the first index in the @@ -185,7 +185,7 @@ sorted-order scan of the indexes present in a Judy1 array. .IP .TP 15 -.C \fBJ1N(Rc_int, PJ1Array, Index);\fP // \fBJudy1Next()\fP +\fBJ1N(Rc_int, PJ1Array, Index);\fP // \fBJudy1Next()\fP Search (exclusive) for the next index present that is greater than the passed \fBIndex\fP. \fBJ1N()\fP is typically used to \fIcontinue\fP a @@ -193,7 +193,7 @@ in a Judy1 array, or to locate a "neighbor" of a given index. .IP .TP 15 -.C \fBJ1L(Rc_int, PJ1Array, Index);\fP // \fBJudy1Last()\fP +\fBJ1L(Rc_int, PJ1Array, Index);\fP // \fBJudy1Last()\fP Search (inclusive) for the last index present that is equal to or less than the passed \fBIndex\fP. (Start with \fBIndex\fP = -1, that is, all ones, to find the last index @@ -202,32 +202,32 @@ of the indexes present in a Judy1 array. .IP .TP 15 -.C \fBJ1P(Rc_int, PJ1Array, Index);\fP // \fBJudy1Prev()\fP +\fBJ1P(Rc_int, PJ1Array, Index);\fP // \fBJudy1Prev()\fP Search (exclusive) for the previous index present that is less than the passed \fBIndex\fP. \fBJ1P()\fP is typically used to \fIcontinue\fP a reverse-sorted-order scan of the indexes present in a Judy1 array, or to locate a "neighbor" of a given index. .IP .TP 15 -.C \fBJ1FE(Rc_int, PJ1Array, Index);\fP // \fBJudy1FirstEmpty()\fP +\fBJ1FE(Rc_int, PJ1Array, Index);\fP // \fBJudy1FirstEmpty()\fP Search (inclusive) for the first absent index that is equal to or greater than the passed \fBIndex\fP. (Start with \fBIndex\fP = 0 to find the first index absent in the array.) .IP .TP 15 -.C \fBJ1NE(Rc_int, PJ1Array, Index);\fP // \fBJudy1NextEmpty()\fP +\fBJ1NE(Rc_int, PJ1Array, Index);\fP // \fBJudy1NextEmpty()\fP Search (exclusive) for the next absent index that is greater than the passed \fBIndex\fP. .IP .TP 15 -.C \fBJ1LE(Rc_int, PJ1Array, Index);\fP // \fBJudy1LastEmpty()\fP +\fBJ1LE(Rc_int, PJ1Array, Index);\fP // \fBJudy1LastEmpty()\fP Search (inclusive) for the last absent index that is equal to or less than the passed \fBIndex\fP. (Start with \fBIndex\fP = -1 to find the last index absent in the array.) .IP .TP 15 -.C \fBJ1PE(Rc_int, PJ1Array, Index);\fP // \fBJudy1PrevEmpty()\fP +\fBJ1PE(Rc_int, PJ1Array, Index);\fP // \fBJudy1PrevEmpty()\fP Search (exclusive) for the previous absent index that is less than the passed \fBIndex\fP. .PP diff -Nurb judy-1.0.1.orig/doc/man/man3/Judy1_funcs judy-1.0.1/doc/man/man3/Judy1_funcs --- judy-1.0.1.orig/doc/man/man3/Judy1_funcs 2005-05-27 17:03:41.000000000 +0300 +++ judy-1.0.1/doc/man/man3/Judy1_funcs 2005-10-04 21:30:01.000000000 +0300 @@ -68,7 +68,7 @@ Notice the placement of the \fB&\fP in the different functions. .PP .TP 15 -.C \fBJudy1Set(&PJ1Array, Index, &JError)\fP +\fBJudy1Set(&PJ1Array, Index, &JError)\fP .IP .nf .ps +1 @@ -79,7 +79,7 @@ .fi .IP .TP 15 -.C \fBJudy1Unset(&PJ1Array, Index, &JError)\fP +\fBJudy1Unset(&PJ1Array, Index, &JError)\fP .IP .nf .ps +1 @@ -90,7 +90,7 @@ .fi .IP .TP 15 -.C \fBJudy1Test(PJ1Array, Index, &JError)\fP +\fBJudy1Test(PJ1Array, Index, &JError)\fP .IP .nf .ps +1 @@ -101,7 +101,7 @@ .fi .IP .TP 15 -.C \fBJudy1Count(PJ1Array, Index1, Index2, &JError)\fP +\fBJudy1Count(PJ1Array, Index1, Index2, &JError)\fP .IP .nf .ps +1 @@ -134,7 +134,7 @@ .fi .IP .TP 15 -.C \fBJudy1ByCount(PJ1Array, Nth, &Index, &JError)\fP +\fBJudy1ByCount(PJ1Array, Nth, &Index, &JError)\fP .IP .nf .ps +1 @@ -145,7 +145,7 @@ .fi .IP .TP 15 -.C \fBJudy1FreeArray(&PJ1Array, &JError)\fP +\fBJudy1FreeArray(&PJ1Array, &JError)\fP .IP .nf .ps +1 @@ -156,7 +156,7 @@ .fi .IP .TP 15 -.C \fBJudy1MemUsed(PJ1Array)\fP +\fBJudy1MemUsed(PJ1Array)\fP .IP .nf .ps +1 @@ -167,7 +167,7 @@ .fi .IP .TP 15 -.C \fBJudy1First(PJ1Array, &Index, &JError)\fP +\fBJudy1First(PJ1Array, &Index, &JError)\fP .IP .nf .ps +1 @@ -178,7 +178,7 @@ .fi .IP .TP 15 -.C \fBJudy1Next(PJ1Array, &Index, &JError)\fP +\fBJudy1Next(PJ1Array, &Index, &JError)\fP .IP .nf .ps +1 @@ -189,7 +189,7 @@ .fi .IP .TP 15 -.C \fBJudy1Last(PJ1Array, &Index, &JError)\fP +\fBJudy1Last(PJ1Array, &Index, &JError)\fP .IP .nf .ps +1 @@ -200,7 +200,7 @@ .fi .IP .TP 15 -.C \fBJudy1Prev(PJ1Array, &Index, &JError)\fP +\fBJudy1Prev(PJ1Array, &Index, &JError)\fP .IP .nf .ps +1 @@ -211,7 +211,7 @@ .fi .IP .TP 15 -.C \fBJudy1FirstEmpty(PJ1Array, &Index, &JError)\fP +\fBJudy1FirstEmpty(PJ1Array, &Index, &JError)\fP .IP .nf .ps +1 @@ -222,7 +222,7 @@ .fi .IP .TP 15 -.C \fBJudy1NextEmpty(PJ1Array, &Index, &JError)\fP +\fBJudy1NextEmpty(PJ1Array, &Index, &JError)\fP .IP .nf .ps +1 @@ -233,7 +233,7 @@ .fi .IP .TP 15 -.C \fBJudy1LastEmpty(PJ1Array, &Index, &JError)\fP +\fBJudy1LastEmpty(PJ1Array, &Index, &JError)\fP .IP .nf .ps +1 @@ -244,7 +244,7 @@ .fi .IP .TP 15 -.C \fBJudy1PrevEmpty(PJ1Array, &Index, &JError)\fP +\fBJudy1PrevEmpty(PJ1Array, &Index, &JError)\fP .IP .nf .ps +1 diff -Nurb judy-1.0.1.orig/doc/man/man3/JudyHS_funcs judy-1.0.1/doc/man/man3/JudyHS_funcs --- judy-1.0.1.orig/doc/man/man3/JudyHS_funcs 2005-05-27 17:03:43.000000000 +0300 +++ judy-1.0.1/doc/man/man3/JudyHS_funcs 2005-10-04 21:30:12.000000000 +0300 @@ -58,7 +58,7 @@ Notice the placement of the \fB&\fP in the different functions. .PP .TP 15 -.C \fBJudyHSIns(&PJHS, Index, Length, &JError)\fP +\fBJudyHSIns(&PJHS, Index, Length, &JError)\fP .IP .nf .ps +1 @@ -69,7 +69,7 @@ .fi .IP .TP 15 -.C \fBJudyHSDel(&PJHS, Index, Length, &JError)\fP +\fBJudyHSDel(&PJHS, Index, Length, &JError)\fP .IP .nf .ps +1 @@ -80,7 +80,7 @@ .fi .IP .TP 15 -.C \fBJudyHSGet(PJHS, Index, Length)\fP +\fBJudyHSGet(PJHS, Index, Length)\fP .IP .nf .ps +1 @@ -91,7 +91,7 @@ .fi .IP .TP 15 -.C \fBJudyHSFreeArray(&PJHS, &JError)\fP +\fBJudyHSFreeArray(&PJHS, &JError)\fP .IP .nf .ps +1 diff -Nurb judy-1.0.1.orig/doc/man/man3/JudyL judy-1.0.1/doc/man/man3/JudyL --- judy-1.0.1.orig/doc/man/man3/JudyL 2005-05-27 17:03:41.000000000 +0300 +++ judy-1.0.1/doc/man/man3/JudyL 2005-10-04 21:30:22.000000000 +0300 @@ -82,7 +82,7 @@ they are the preferred way of calling the JudyL functions. .PP .TP 15 -.C \fBJLI(PValue, PJLArray, Index)\fP // \fBJudyLIns()\fP +\fBJLI(PValue, PJLArray, Index)\fP // \fBJudyLIns()\fP Insert an \fBIndex\fP and \fBValue\fP into the JudyL array \fBPJLArray\fP. If the \fBIndex\fP is successfully inserted, the \fBValue\fP is initialized to 0. If the \fBIndex\fP was already present, @@ -107,7 +107,7 @@ invalid and must be re-acquired. .IP .TP 15 -.C \fBJLD(Rc_int, PJLArray, Index)\fP // \fBJudyLDel()\fP +\fBJLD(Rc_int, PJLArray, Index)\fP // \fBJudyLDel()\fP Delete the \fBIndex\fP/\fBValue\fP pair from the JudyL array. .IP Return \fBRc_int\fP set to 1 if successful. @@ -115,7 +115,7 @@ Return \fBRc_int\fP set to \fBJERR\fP if a \fImalloc()\fP fail occured. .IP .TP 15 -.C \fBJLG(PValue, PJLArray, Index)\fP // \fBJudyLGet()\fP +\fBJLG(PValue, PJLArray, Index)\fP // \fBJudyLGet()\fP Get the pointer \fBPValue\fP associated with \fBIndex\fP in the \fBPJLArray\fP Judy array. .IP Return \fBPValue\fP pointing to \fBValue\fP. @@ -123,7 +123,7 @@ Return \fBPValue\fP set to \fBPJERR\fP if a \fImalloc()\fP fail occured. .IP .TP 15 -.C \fBJLC(Rc_word, PJLArray, Index1, Index2)\fP // \fBJudyLCount()\fP +\fBJLC(Rc_word, PJLArray, Index1, Index2)\fP // \fBJudyLCount()\fP Count the number of indexes present in the JudyL array \fBPJLArray\fP between \fBIndex1\fP and \fBIndex2\fP (inclusive). .IP @@ -139,7 +139,7 @@ .fi .IP .TP 15 -.C \fBJLBC(PValue, PJLArray, Nth, Index)\fP // \fBJudyLByCount()\fP +\fBJLBC(PValue, PJLArray, Nth, Index)\fP // \fBJudyLByCount()\fP Locate the \fBNth\fP index that is present in the JudyL array \fBPJLArray\fP (\fBNth\fP = 1 returns the first index present). .IP @@ -149,7 +149,7 @@ is undefined). .IP .TP 15 -.C \fBJLFA(Rc_word, PJLArray)\fP // \fBJudyLFreeArray()\fP +\fBJLFA(Rc_word, PJLArray)\fP // \fBJudyLFreeArray()\fP Given a pointer to a JudyL array, free the entire array (much faster than using a \fBJLN()\fP, \fBJLD()\fP loop). @@ -158,14 +158,14 @@ set to \fBNULL\fP. .IP .TP 15 -.C \fBJLMU(Rc_word, PJLArray)\fP // \fBJudyLMemUsed()\fP +\fBJLMU(Rc_word, PJLArray)\fP // \fBJudyLMemUsed()\fP Return \fBRc_word\fP set to the number of bytes of memory \fImalloc()\fP'ed by \fBPJLArray\fP. This is a very fast routine, and may be used before and after a \fBJLI()\fP or \fBJLD()\fP call with little performance impact. .IP .TP 15 -.C \fBJudyL Search Functions\fP +\fBJudyL Search Functions\fP \fBJLF()\fP, \fBJLN()\fP, \fBJLL()\fP, \fBJLP()\fP allow you to search for indexes in the array. @@ -191,7 +191,7 @@ \fBRc_int\fP must be checked prior to using \fBIndex\fP, since a search failure is possible. .IP .TP 15 -.C \fBJLF(PValue, PJLArray, Index)\fP // \fBJudyLFirst()\fP +\fBJLF(PValue, PJLArray, Index)\fP // \fBJudyLFirst()\fP Search (inclusive) for the first index present that is equal to or greater than the passed \fBIndex\fP. (Start with \fBIndex\fP = 0 to find the first index in the array.) @@ -199,21 +199,21 @@ the indexes present in a JudyL array. .IP .TP 15 -.C \fBJLN(PValue, PJLArray, Index)\fP // \fBJudyLNext()\fP +\fBJLN(PValue, PJLArray, Index)\fP // \fBJudyLNext()\fP Search (exclusive) for the next index present that is greater than the passed \fBIndex\fP. \fBJLN()\fP is typically used to \fIcontinue\fP a sorted-order scan of the indexes present in a JudyL array, or to locate a "neighbor" of a given index. .IP .TP 15 -.C \fBJLL(PValue, PJLArray, Index)\fP // \fBJudyLLast()\fP +\fBJLL(PValue, PJLArray, Index)\fP // \fBJudyLLast()\fP Search (inclusive) for the last index present that is equal to or less than the passed \fBIndex\fP. (Start with \fBIndex\fP = -1, that is, all ones, to find the last index in the array.) \fBJLL()\fP is typically used to \fIbegin\fP a reverse-sorted-order scan of the indexes present in a JudyL array. .IP .TP 15 -.C \fBJLP(PValue, PJLArray, Index)\fP // \fBJudyLPrev()\fP +\fBJLP(PValue, PJLArray, Index)\fP // \fBJudyLPrev()\fP Search (exclusive) for the previous index present that is less than the passed \fBIndex\fP. \fBJLP()\fP is typically used to \fIcontinue\fP a reverse-sorted-order @@ -221,23 +221,23 @@ a given index. .IP .TP 15 -.C \fBJLFE(Rc_int, PJLArray, Index)\fP // \fBJudyLFirstEmpty()\fP +\fBJLFE(Rc_int, PJLArray, Index)\fP // \fBJudyLFirstEmpty()\fP Search (inclusive) for the first index absent that is equal to or greater than the passed \fBIndex\fP. (Start with \fBIndex\fP = 0 to find the first index absent in the array.) .IP .TP 15 -.C \fBJLNE(Rc_int, PJLArray, Index)\fP // \fBJudyLNextEmpty()\fP +\fBJLNE(Rc_int, PJLArray, Index)\fP // \fBJudyLNextEmpty()\fP Search (exclusive) for the next index absent that is greater than the passed \fBIndex\fP. .IP .TP 15 -.C \fBJLLE(Rc_int, PJLArray, Index)\fP // \fBJudyLLastEmpty()\fP +\fBJLLE(Rc_int, PJLArray, Index)\fP // \fBJudyLLastEmpty()\fP Search (inclusive) for the last index absent that is equal to or less than the passed \fBIndex\fP. (Start with \fBIndex\fP = -1, that is, all ones, to find the last index absent in the array.) .IP .TP 15 -.C \fBJLPE(Rc_int, PJLArray, Index)\fP // \fBJudyLPrevEmpty()\fP +\fBJLPE(Rc_int, PJLArray, Index)\fP // \fBJudyLPrevEmpty()\fP Search (exclusive) for the previous index absent that is less than the passed \fBIndex\fP. .PP diff -Nurb judy-1.0.1.orig/doc/man/man3/JudyL_funcs judy-1.0.1/doc/man/man3/JudyL_funcs --- judy-1.0.1.orig/doc/man/man3/JudyL_funcs 2005-05-27 17:03:42.000000000 +0300 +++ judy-1.0.1/doc/man/man3/JudyL_funcs 2005-10-04 21:30:55.000000000 +0300 @@ -68,7 +68,7 @@ Notice the placement of the \fB&\fP in the different functions. .PP .TP 15 -.C \fBJudyLIns(&PJLArray, Index, &JError)\fP +\fBJudyLIns(&PJLArray, Index, &JError)\fP .IP .nf .ps +1 @@ -79,7 +79,7 @@ .fi .IP .TP 15 -.C \fBJudyLDel(&PJLArray, Index, &JError)\fP +\fBJudyLDel(&PJLArray, Index, &JError)\fP .IP .nf .ps +1 @@ -90,7 +90,7 @@ .fi .IP .TP 15 -.C \fBJudyLGet(PJLArray, Index, &JError)\fP +\fBJudyLGet(PJLArray, Index, &JError)\fP .IP .nf .ps +1 @@ -101,7 +101,7 @@ .fi .IP .TP 15 -.C \fBJudyLCount(PJLArray, Index1, Index2, &JError)\fP +\fBJudyLCount(PJLArray, Index1, Index2, &JError)\fP .IP .nf .ps +1 @@ -112,7 +112,7 @@ .fi .IP .TP 15 -.C \fBJudyLByCount(PJLArray, Nth, &Index, &JError)\fP +\fBJudyLByCount(PJLArray, Nth, &Index, &JError)\fP .IP .nf .ps +1 @@ -123,7 +123,7 @@ .fi .IP .TP 15 -.C \fBJudyLFreeArray(&PJLArray, &JError)\fP +\fBJudyLFreeArray(&PJLArray, &JError)\fP .IP .nf .ps +1 @@ -134,7 +134,7 @@ .fi .IP .TP 15 -.C \fBJudyLMemUsed(PJLArray)\fP +\fBJudyLMemUsed(PJLArray)\fP .IP .nf .ps +1 @@ -145,7 +145,7 @@ .fi .IP .TP 15 -.C \fBJudyLFirst(PJLArray, &Index, &JError)\fP +\fBJudyLFirst(PJLArray, &Index, &JError)\fP .IP .nf .ps +1 @@ -156,7 +156,7 @@ .fi .IP .TP 15 -.C \fBJudyLNext(PJLArray, &Index, &JError)\fP +\fBJudyLNext(PJLArray, &Index, &JError)\fP .IP .nf .ps +1 @@ -167,7 +167,7 @@ .fi .IP .TP 15 -.C \fBJudyLLast(PJLArray, &Index, &JError)\fP +\fBJudyLLast(PJLArray, &Index, &JError)\fP .IP .nf .ps +1 @@ -178,7 +178,7 @@ .fi .IP .TP 15 -.C \fBJudyLPrev(PJLArray, &Index, &JError)\fP +\fBJudyLPrev(PJLArray, &Index, &JError)\fP .IP .nf .ps +1 @@ -189,7 +189,7 @@ .fi .IP .TP 15 -.C \fBJudyLFirstEmpty(PJLArray, &Index, &JError)\fP +\fBJudyLFirstEmpty(PJLArray, &Index, &JError)\fP .IP .nf .ps +1 @@ -200,7 +200,7 @@ .fi .IP .TP 15 -.C \fBJudyLNextEmpty(PJLArray, &Index, &JError)\fP +\fBJudyLNextEmpty(PJLArray, &Index, &JError)\fP .IP .nf .ps +1 @@ -211,7 +211,7 @@ .fi .IP .TP 15 -.C \fBJudyLLastEmpty(PJLArray, &Index, &JError)\fP +\fBJudyLLastEmpty(PJLArray, &Index, &JError)\fP .IP .nf .ps +1 @@ -222,7 +222,7 @@ .fi .IP .TP 15 -.C \fBJudyLPrevEmpty(PJLArray, &Index, &JError)\fP +\fBJudyLPrevEmpty(PJLArray, &Index, &JError)\fP .IP .nf .ps +1 diff -Nurb judy-1.0.1.orig/doc/man/man3/JudySL_funcs judy-1.0.1/doc/man/man3/JudySL_funcs --- judy-1.0.1.orig/doc/man/man3/JudySL_funcs 2005-05-27 17:03:43.000000000 +0300 +++ judy-1.0.1/doc/man/man3/JudySL_funcs 2005-10-04 21:31:11.000000000 +0300 @@ -61,7 +61,7 @@ Notice the placement of the \fB&\fP in the different functions. .PP .TP 15 -.C \fBJudySLIns(&PJSLArray, Index, &JError)\fP +\fBJudySLIns(&PJSLArray, Index, &JError)\fP .IP .nf .ps +1 @@ -72,7 +72,7 @@ .fi .IP .TP 15 -.C \fBJudySLDel(&PJSLArray, Index, &JError)\fP +\fBJudySLDel(&PJSLArray, Index, &JError)\fP .IP .nf .ps +1 @@ -83,7 +83,7 @@ .fi .IP .TP 15 -.C \fBJudySLGet(PJSLArray, Index, &JError)\fP +\fBJudySLGet(PJSLArray, Index, &JError)\fP .IP .nf .ps +1 @@ -94,7 +94,7 @@ .fi .IP .TP 15 -.C \fBJudySLFreeArray(&PJSLArray, &JError)\fP +\fBJudySLFreeArray(&PJSLArray, &JError)\fP .IP .nf .ps +1 @@ -105,7 +105,7 @@ .fi .IP .TP 15 -.C \fBJudySLFirst(PJSLArray, Index, &JError)\fP +\fBJudySLFirst(PJSLArray, Index, &JError)\fP .IP .nf .ps +1 @@ -116,7 +116,7 @@ .fi .IP .TP 15 -.C \fBJudySLNext(PJSLArray, Index, &JError)\fP +\fBJudySLNext(PJSLArray, Index, &JError)\fP .IP .nf .ps +1 @@ -127,7 +127,7 @@ .fi .IP .TP 15 -.C \fBJudySLLast(PJSLArray, Index, &JError)\fP +\fBJudySLLast(PJSLArray, Index, &JError)\fP .IP .nf .ps +1 @@ -138,7 +138,7 @@ .fi .IP .TP 15 -.C \fBJudySLPrev(PJSLArray, Index, &JError)\fP +\fBJudySLPrev(PJSLArray, Index, &JError)\fP .IP .nf .ps +1 -- System Information: Debian Release: testing/unstable APT prefers testing APT policy: (500, 'testing') Architecture: i386 (i686) Shell: /bin/sh linked to /bin/dash Kernel: Linux 2.6.11-1-686 Locale: LANG=ru_RU.CP1251, LC_CTYPE=ru_RU.CP1251 (charmap=CP1251) Versions of packages libjudy-dev depends on: ii libjudydebian1 1.0.1-5 C library for creating and accessi libjudy-dev recommends no packages. -- no debconf information -- To UNSUBSCRIBE, email to [EMAIL PROTECTED] with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
