XProfan

English

freenet.thorsten_friedrichs means:

Hello people,

I teste straight some Codes of me, one Großteil of it not Profan.

i want with TCP works and the Perhaps too moreover under Profan, on

jedenfall should for Profaner there what fall off

with Tcp etc. teste I yet, coming but not yet plenty to program, because

I over ands over again everything verworfen have.

now create I first fundamental routines.

momentarily be I thereby a data base to create The in the RAM /

main memory stored is.

this serves for many items, first thing but circa z.B. TCP-connections and

data To manage.

I have now mehrer Split in the Database and say we time a number

1 Mio. Datensätzen (Lines) to that testing. now must I naturally too to

data search (circa ne link to find).

I use a AMD 1800XP processor. How long might it ca. last circa

these 1 Mio. Datensätze once To go through and accordingly whom Datensatz too

on jedenfall to find? So I have here naturally already The recent

(!) tatsächlichen values, but the fallen me not at all because it To

long lasts.

what value your means would there a good Zeitwert?

circa so less Datensätze (connections) there are, circa so faster goes it

naturally, but the data base should too for others items serve.

alas Yes, The method to the sought becomes is FindExact.

Greeting

Thorsten

02/19/06 ▲

Vollständiges Quote

Absatzweise Quote Zeilenweise Quote

Ragnar
Rehbein

the depends in first line from the length the datensätze ex (if one not indiziert)
Compile Mark Separation

cls
declare b#,pos&
dim b#,32000000
declare z&
z& = &gettickcount
pos& = 999995
string b#,pos& * 32 =chr$(0)+"1234567890"   suchstring
string b#,pos& * 32 + 16 ="ich bin hier"   inhalt
pos& = mempos(b#,0,chr$(0)+"1234567890")
print pos&
print string$(b#,pos&+16)
print "vergangen : ",&gettickcount-z&,"ms"
w