Description:
Pascal in general and ungrouped Pascals.
|
|
|
Lidl blew pill and Taliban! : )
|
| |
Siis .. VAUDE! _____________________ 08.05.2008 jää historiaan hetkenä joka kiistatta osoitti miten maailmanennätysvauhtia suorastaan megaromahtanut ydinvoiman kannatus konkretisoi laajassa rintamassa myös Suomessa. Miten tällainen saavutus on edes teoriassa mahdolista maassa, jossa ydinvastustaminen rinnastetaan... more »
|
|
Is there a God?
|
| |
Uusiutuva energia [Tuomas Kangasniemi, 28.04.2008] Namibialaisesta aurinkovoimalasta maailman korkein rakennus? Saksalainen insinööriryhmä suunnittelee Namibiaan kilometrin korkuista aurinkotornia.
|
|
Comparing matched and Wiener filters
|
| |
Uusiutuva energia [Tuomas Kangasniemi, 28.04.2008] Namibialaisesta aurinkovoimalasta maailman korkein rakennus? Saksalainen insinööriryhmä suunnittelee Namibiaan kilometrin korkuista aurinkotornia.
|
|
Falcon - powering innovation
|
| |
If anybody is interesed in new technologies, you'll love this new language called Falcon [1], which has been open sourced ago little time. Falcon is a scripting engine ready to empower mission-critical multithreaded applications. It provides six integrated programming paradigms: procedural, object oriented, prototype oriented,... more »
|
|
Lazarus
|
| |
Hello everybody. Anyone here uses Lazarus? I tried this week and i think its a great IDE, quite easy to use... Greetings, Damian
|
|
FreePascal V 2.2.2 problems
|
| |
Hi, This is intended for the developers of the above, as their web-site is impossibly slow to use - I can't even get the home page up - and I know they look in on this newsgroup now and again. I'm having real problems with what I'm fairly sure is a compiler bug, and I'd love to know how I can get some help (without, obviously, using the... more »
|
|
How to resolve programaticaly
|
| |
Covering Design C(v,k,t,m,l,=b) is a pair (V,B), where V is a set of v elements (called points) and B is a collection of b k-subsets of V (called blocks), such that every m-subset of V intersects at least l members of B in at least t points. It is required that v >= k >= t and m >= t. The case m > k is also a valid case. B can be a multiset.... more »
|
|
Looking for an LOTTO code snippets
|
| |
Hello everybody, just to speed up my project, I am looking for a code snippets in Object Pascal for creating lotto wheels with guarantees. If somebody can give me some advice about the algorithm instead of a ready usable source code, it would be fine also. Regards Nigel
|
|
Call custom function in pascal
|
| |
Hey guys, I have a problem. I want call my functions in pascal by their names stored in an array for example.. (array[1..n] of string).. i want the same of PHP call_user_func function.. or something near that.. Is there any way to do this? thanks, Eureka
|
|
|