The Tips Are Back (sort of)

The Delphi Tips section of the old site didn't survive the redesign and move to the new host. I moved the the tips onto GitHub to prevent them from being lost.

Well, now they're back, after a fashion. Not delphidabbler.com just yet, but as a GitHub pages micro-site. Check it out at https://delphidabbler.github.io/delphi-tips.


There's no search as yet, but all 234 tips are there.

I do intend to reintegrate the site into delphidabbler.com one day, but given how much needs doing with the new site, who knows when that'll be.

So if anyone wants to improve the micro site, please fork delphidabbler/delphi-tips and code away!

Comments

  1. Arnaud8:23 am

    I would have rather used markdown files for the tip files.

    pdf are binary, so are hard to diff/maintain with git, which favors text files.

    And .md files have good rendering on github.

    ReplyDelete
  2. Delphidabbler9:21 am

    Hi Armaud

    The PDFs were done in a hurry when I thought the site was closing - I agree they're far from ideal but very easy to generate 234 of them !!

    There are also HTML files which are more accessible and of course, editable.

    If I was starting now I would agree with you and would probably have gone down the markdown route when creating them, but the tip section was originally created well over 10 years ago when I'd never heard of markdown! Big job to convert everything now, so we're stuck with HTML I'm afraid.

    Unless anyone wants to give it a go that is!!

    Cheers!

    ReplyDelete
  3. Arnaud1:36 pm

    Makes perfectly sense.
    :)

    ReplyDelete

Post a Comment

Comments are very welcome, but please don't comment here if:

1) You have a query about, or a bug report for, one of my programs or libraries. Most of my posts contain a link to the relevant repository where there will be an issue tracker you can use.

2) You have a query about any 3rd party programs I feature, please address them to the developer(s) - there will be a link in the post.

3) You're one of the tiny, tiny minority who are aggressive or abusive - in the bin you go and reported you will be!

Thanks

Popular posts from this blog

Initialising dynamic arrays

When writing some unit tests a while ago I found myself needing to initialise some dynamic arrays with test data. It would be nice if we could do something like this: var A : array of Integer ; begin A := ( 1 , 2 , 3 , 4 ) ; // !! WRONG end ; but we can't. So I decided to write some functions to initialise dynamic arrays to the contents of another array, be it a constant, a literal or another dynamic array. The result was a set of overloaded routines, one for each data type I needed to handle, for example for Integer and string arrays I had: function CloneArray ( const A : array of Integer ) : TIntegerDynArray ; overload ; var Idx : Integer ; begin SetLength ( Result , Length ( A ) ) ; for Idx := Low ( A ) to High ( A ) do Result [ Idx - Low ( A ) ] := A [ Idx ] ; end ; function CloneArray ( const A : array of string ) : TStringDynArray ; overload ; var Idx : Integer ; begin SetLength ( Result , Len...
Read more

Deleting elements from a dynamic array

In my blog " Initialising Dynamic Arrays " I mentioned I have been writing some unit tests that needed numerous repetative array initialisation operations. Well, one of the other common operations I found myself writing was the deletion of items from dynamic arrays. So I decided to find a generic way of doing this. Assuming we know the index of the item to be deleted we need the equivalent of Delphi's built-in Delete procedure for strings. If you read the previous post you won't be surprised to learn that I decided to further extend the Generics.Collections.TArray class by adding to the TArrayEx class I introduced there. My first attempt emulates Delphi's Delete procedure by deleting the array element in-place: i.e. it updates the array passed as a parameter. Unsurprisingly the method is called DeleteInPlace . Here's how it goes: type TArrayEx = class ( TArray ) public .. . class procedure DeleteInPlace < T > ( var A : ...
Read more