Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.pascal.delphi.misc > #668
| From | "LuigiPaolo" <venus444@alice.it> |
|---|---|
| Newsgroups | comp.lang.pascal.delphi.misc |
| References | <547b7f64$0$44198$4fafbaef@reader2.news.tin.it> <ce1k9tFtjcuU1@mid.individual.net> |
| Subject | Re: Help ranking chess football |
| Date | 2014-12-03 02:07 +0100 |
| Message-ID | <547e624c$0$44201$4fafbaef@reader2.news.tin.it> (permalink) |
| Organization | TIN.IT (http://www.tin.it) |
You can use TBits for more than 255 members. Some functions: Contains := MyBits[index]; MyBits[index] := Value; //Include/Exclude ? ? Sorry for my bad english Thanks for your response. how can I adapt your suggestion to my code under which and if you can how can I replace the sets with arrays? I no I did Thanks again. ? ? ? ? ? ////// Set1, Set2: set of 1..255; ? Player with [ColumnA] do begin if (ColumnB in Set1) then begin Include (Set2, ColumnB) end; if not (ColumnB in Set1) then begin Include (Set1, ColumnB); end; .... Player with [ColumnB] do begin if (ColumnA in Set1) then begin Include (Set2, ColumnA) end; if not (ColumnA in Set1) then begin Include (Set1, ColumnA); end;
Back to comp.lang.pascal.delphi.misc | Previous | Next — Previous in thread | Find similar
Help ranking chess football "LuigiPaolo" <venus444@alice.it> - 2014-11-30 21:34 +0100
Re: Help ranking chess football Hans-Peter Diettrich <DrDiettrich1@aol.com> - 2014-11-30 22:14 +0100
Re: Help ranking chess football "LuigiPaolo" <venus444@alice.it> - 2014-12-03 02:07 +0100
csiph-web