On Thu, 27 Jan 2011, Sven Barth wrote:
Am 27.01.2011 10:14, schrieb Mark Morgan Lloyd:
michael.vancann...@wisa.be wrote:
On Thu, 27 Jan 2011, Sven Barth wrote:
Am 26.01.2011 13:06, schrieb michael.vancann...@wisa.be:
That said, I am still looking for a good search engine *written in
Objec
Am 27.01.2011 10:14, schrieb Mark Morgan Lloyd:
michael.vancann...@wisa.be wrote:
On Thu, 27 Jan 2011, Sven Barth wrote:
Am 26.01.2011 13:06, schrieb michael.vancann...@wisa.be:
That said, I am still looking for a good search engine *written in
Object
pascal* for the FPC html docs. Any hints/
michael.vancann...@wisa.be wrote:
On Thu, 27 Jan 2011, Sven Barth wrote:
Am 26.01.2011 13:06, schrieb michael.vancann...@wisa.be:
That said, I am still looking for a good search engine *written in
Object
pascal* for the FPC html docs. Any hints/tips are appreciated.
I have never tested it,
On Thu, 27 Jan 2011, Sven Barth wrote:
Am 26.01.2011 13:06, schrieb michael.vancann...@wisa.be:
That said, I am still looking for a good search engine *written in Object
pascal* for the FPC html docs. Any hints/tips are appreciated.
I have never tested it, but I once stumpled upon the Ioda
On Thu, 27 Jan 2011, Max Vlasov wrote:
On Wed, Jan 26, 2011 at 3:06 PM, wrote:
For example, can I rapidly get all function descriptions with "space" as
part of the description, which could subsequently be filtered (e.g. if I
were interested in text operations I could quickly ignore an
Am 26.01.2011 13:06, schrieb michael.vancann...@wisa.be:
That said, I am still looking for a good search engine *written in Object
pascal* for the FPC html docs. Any hints/tips are appreciated.
I have never tested it, but I once stumpled upon the Ioda search engine
( http://ioda.sourceforge.ne
On Wed, Jan 26, 2011 at 3:06 PM, wrote:
>
>
>
>
>
>> For example, can I rapidly get all function descriptions with "space" as
>> part of the description, which could subsequently be filtered (e.g. if I
>> were interested in text operations I could quickly ignore anything with
>> "file" in the des
On 01/26/11 07:41, Marco van de Voort wrote:
> CHM has a basic phrase indexer, and it operates on the html. The search part
> is maybe part of the viewer, and one would have to see how complex it is.
> (Iow if the complexity is in index or search, if the search is relative
> simple one could look
Marco van de Voort wrote:
In our previous episode, michael.vancann...@wisa.be said:
Categorizing routines, with subcategs if need be will be trouble enough,
specially if you want to do it future proof (and also be able to flag the static
method approach that Delphi current favours)
OK, that wa
In our previous episode, michael.vancann...@wisa.be said:
> > Categorizing routines, with subcategs if need be will be trouble enough,
> > specially if you want to do it future proof (and also be able to flag the
> > static
> > method approach that Delphi current favours)
>
> OK, that was totall
On Wed, 26 Jan 2011, Marco van de Voort wrote:
In our previous episode, michael.vancann...@wisa.be said:
I'm sure that somebody familiar with XML (which I'm afraid doesn't include
me) could knock out something half-way decent in a few minutes.
Or is the problem actually XML in this case, i.e
In our previous episode, michael.vancann...@wisa.be said:
> > I'm sure that somebody familiar with XML (which I'm afraid doesn't include
> > me) could knock out something half-way decent in a few minutes.
> >
> > Or is the problem actually XML in this case, i.e. it's obvious that we want
> > to e
On Wed, Jan 26, 2011 at 10:32 AM, Marco van de Voort wrote:
> In our previous episode, Mark Morgan Lloyd said:
>> > simple one could look at kchmviewer)
>>
>> I used something called Perlfect Search for a while- which might fulfil
>> Michael's criterion if Lazarus could handle Perl plugins :-)
>
>
On Wed, 26 Jan 2011, Mark Morgan Lloyd wrote:
michael.vancann...@wisa.be wrote:
On Wed, 26 Jan 2011, Mark Morgan Lloyd wrote:
As a comparative beginner, I still find myself stumbling across RTL
functions that I've previously hand-coded.
Is there an easy way of generating a complete permut
michael.vancann...@wisa.be wrote:
On Wed, 26 Jan 2011, Mark Morgan Lloyd wrote:
As a comparative beginner, I still find myself stumbling across RTL
functions that I've previously hand-coded.
Is there an easy way of generating a complete permuted index from the
one-line descriptions of the fu
In our previous episode, michael.vancann...@wisa.be said:
> > I used something called Perlfect Search for a while- which might fulfil
> > Michael's criterion if Lazarus could handle Perl plugins :-)
>
> The criterion is: *written* in object pascal.
> Not 'callable from Object pascal' :-)
>
> An
In our previous episode, Mark Morgan Lloyd said:
> > simple one could look at kchmviewer)
>
> I used something called Perlfect Search for a while- which might fulfil
> Michael's criterion if Lazarus could handle Perl plugins :-)
Pascal, and pascal only. We might make exceptions for extremely com
On Wed, 26 Jan 2011, Mark Morgan Lloyd wrote:
Marco van de Voort wrote:
In our previous episode, michael.vancann...@wisa.be said:
IntToBin Converts inserting spaces at
IsEmptyStr Check disregaring whitespace characters
That's somewhat abbreviated so that it's not screw
On Wed, 26 Jan 2011, Marco van de Voort wrote:
In our previous episode, michael.vancann...@wisa.be said:
IntToBin Converts inserting spaces at
IsEmptyStr Check disregaring whitespace characters
That's somewhat abbreviated so that it's not screwed too badly by wrap.
Cr
Marco van de Voort wrote:
In our previous episode, michael.vancann...@wisa.be said:
IntToBin Converts inserting spaces at
IsEmptyStr Check disregaring whitespace characters
That's somewhat abbreviated so that it's not screwed too badly by wrap.
Creating such an index requ
In our previous episode, michael.vancann...@wisa.be said:
> > IntToBin Converts inserting spaces at
> > IsEmptyStr Check disregaring whitespace characters
> >
> > That's somewhat abbreviated so that it's not screwed too badly by wrap.
>
> Creating such an index requires addit
On Wed, 26 Jan 2011, Mark Morgan Lloyd wrote:
As a comparative beginner, I still find myself stumbling across RTL functions
that I've previously hand-coded.
Is there an easy way of generating a complete permuted index from the
one-line descriptions of the functions in the RTL (and optionall
As a comparative beginner, I still find myself stumbling across RTL
functions that I've previously hand-coded.
Is there an easy way of generating a complete permuted index from the
one-line descriptions of the functions in the RTL (and optionally FCL
and LCL)?
For example, can I rapidly get
23 matches
Mail list logo
