/usr/src/castle-game-engine-4.1.1/base/castleutils_primitive_lists.inc is in castle-game-engine-src 4.1.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 | {
Copyright 2002-2013 Michalis Kamburelis.
This file is part of "Castle Game Engine".
"Castle Game Engine" is free software; see the file COPYING.txt,
included in this distribution, for details about the copyright.
"Castle Game Engine" is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
----------------------------------------------------------------------------
}
{ Lists of primitive types. Using FPC generic TFPGList. }
{$ifdef read_interface}
type
TSingleList = class;
TDoubleList = class;
TLongIntList = class;
TLongWordList = class(specialize TFPGList<LongWord>)
public
procedure AddList(Source: TLongWordList);
procedure AddArray(const A: array of LongWord);
function L: PLongWord;
end;
TFloatList = class(specialize TFPGList<Float>)
procedure AppendFloats(Floats: TSingleList);
procedure AddList(Source: TFloatList);
procedure AddArray(const A: array of Float);
function L: PFloat;
end;
TArray_Single = packed array [0..MaxInt div SizeOf(Single) - 1] of Single;
PArray_Single = ^TArray_Single;
TSingleList = class(specialize TFPGList<Single>)
procedure AppendFloats(Floats: TFloatList);
function ToDouble: TDoubleList;
{ Assign value from TDoubleList, converting to double-precision. }
procedure Assign(Source: TDoubleList); overload;
{ Assign linear interpolation between two other float arrays.
We take ACount items, from V1[Index1 ... Index1 + ACount - 1] and
V2[Index2 ... Index2 + ACount - 1], and interpolate between them
like normal Lerp functions.
It's Ok for both V1 and V2 to be the same objects.
But their ranges should not overlap, for future optimizations
(although it's Ok for current implementation). }
procedure AssignLerp(const Fraction: Single;
V1, V2: TSingleList; Index1, Index2, ACount: Integer);
procedure AddList(Source: TSingleList);
procedure AddListRange(Source: TSingleList; Index, AddCount: Integer);
procedure AddArray(const A: array of Single);
function L: PSingle;
end;
TDoubleList = class(specialize TFPGList<Double>)
function ToSingle: TSingleList;
{ Assign value from TSingleList, converting to double-precision. }
procedure Assign(Source: TSingleList); overload;
procedure AddList(Source: TDoubleList);
procedure AddArray(const A: array of Double);
function L: PDouble;
end;
TCardinalList = class(specialize TFPGList<Cardinal>)
function BigSum: Int64;
function Sum: Cardinal;
procedure AddList(Source: TCardinalList);
procedure AddArray(const A: array of Cardinal);
function L: PCardinal;
end;
TBooleanList = class(specialize TFPGList<boolean>)
public
{ Set appropriate item to given value.
These are useful methods to pass as callback in some situations
(e.g. TCastleScene.RenderFrustumOctree passes
RenderFrustumOctree_Visible.SetTrue method as callback
that should mark visible items.)
@groupBegin }
procedure SetFalse(Index: Integer);
procedure SetTrue(Index: Integer);
{ @groupEnd }
function ToLongInt: TLongIntList;
procedure AddList(Source: TBooleanList);
procedure AddArray(const A: array of boolean);
function L: PBoolean;
end;
TArray_LongInt = packed array [0..MaxInt div SizeOf(LongInt) - 1] of LongInt;
PArray_LongInt = ^TArray_LongInt;
TLongIntList = class(specialize TFPGList<LongInt>)
public
function Max: LongInt;
function Sum: LongInt;
procedure DeleteRange(const Index: Integer; DelCount: Integer = 1);
procedure AddList(Source: TLongIntList);
procedure AddArray(const A: array of LongInt);
{ Add given Item a number of times to the list. }
procedure AddDuplicate(const Item: LongInt; const DuplicateCount: Cardinal);
function L: PLongInt;
end;
TIntegerList = class(specialize TFPGList<Integer>)
public
function Sum: Integer;
procedure AddList(Source: TIntegerList);
procedure AddArray(const A: array of Integer);
function L: PInteger;
end;
{$endif}
{$ifdef read_implementation}
{ TLongWordList ------------------------------------------------------------ }
procedure TLongWordList.AddList(Source: TLongWordList);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + Source.Count;
if Source.Count <> 0 then
System.Move(Source.L[0], L[OldCount], SizeOf(LongWord) * Source.Count);
end;
procedure TLongWordList.AddArray(const A: array of LongWord);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + High(A) + 1;
if High(A) <> -1 then
System.Move(A[0], L[OldCount], SizeOf(LongWord) * (High(A) + 1));
end;
function TLongWordList.L: PLongWord;
begin
Result := PLongWord(FList);
end;
{ TFloatList ------------------------------------------------------------ }
procedure TFloatList.AppendFloats(Floats: TSingleList);
var OldCount, i: Integer;
begin
OldCount := Count;
Count := Count + Floats.Count;
for i := 0 to Floats.Count - 1 do Items[OldCount+i] := Floats.Items[i];
end;
procedure TFloatList.AddList(Source: TFloatList);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + Source.Count;
if Source.Count <> 0 then
System.Move(Source.L[0], L[OldCount], SizeOf(Float) * Source.Count);
end;
procedure TFloatList.AddArray(const A: array of Float);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + High(A) + 1;
if High(A) <> -1 then
System.Move(A[0], L[OldCount], SizeOf(Float) * (High(A) + 1));
end;
function TFloatList.L: PFloat;
begin
Result := PFloat(FList);
end;
{ TSingleList ------------------------------------------------------------ }
procedure TSingleList.AppendFloats(Floats: TFloatList);
var OldCount, i: Integer;
begin
OldCount := Count;
Count := Count + Floats.Count;
for i := 0 to Floats.Count - 1 do Items[OldCount+i] := Floats.Items[i];
end;
function TSingleList.ToDouble: TDoubleList;
begin
Result := TDoubleList.Create;
Result.Assign(Self);
end;
procedure TSingleList.Assign(Source: TDoubleList);
var
I: Integer;
Src: PDouble;
Dest: PSingle;
begin
Count := Source.Count;
Src := PDouble(Source.List);
Dest := PSingle(List);
for I := 0 to Count - 1 do
begin
Dest^ := Src^;
Inc(Src);
Inc(Dest);
end;
end;
procedure TSingleList.AssignLerp(const Fraction: Single;
V1, V2: TSingleList; Index1, Index2, ACount: Integer);
var
I: Integer;
begin
Count := ACount;
for I := 0 to Count - 1 do
Items[I] := Lerp(Fraction, V1.Items[Index1 + I], V2.Items[Index2 + I]);
end;
procedure TSingleList.AddList(Source: TSingleList);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + Source.Count;
if Source.Count <> 0 then
System.Move(Source.L[0], L[OldCount], SizeOf(Single) * Source.Count);
end;
procedure TSingleList.AddListRange(Source: TSingleList; Index, AddCount: Integer);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + AddCount;
if Source.Count <> 0 then
System.Move(Source.L[Index], L[OldCount], SizeOf(Single) * AddCount);
end;
procedure TSingleList.AddArray(const A: array of Single);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + High(A) + 1;
if High(A) <> -1 then
System.Move(A[0], L[OldCount], SizeOf(Single) * (High(A) + 1));
end;
function TSingleList.L: PSingle;
begin
Result := PSingle(FList);
end;
{ TDoubleList ------------------------------------------------------------ }
function TDoubleList.ToSingle: TSingleList;
begin
Result := TSingleList.Create;
Result.Assign(Self);
end;
procedure TDoubleList.Assign(Source: TSingleList);
var
I: Integer;
Src: PSingle;
Dest: PDouble;
begin
Count := Source.Count;
Src := PSingle(Source.List);
Dest := PDouble(List);
for I := 0 to Count - 1 do
begin
Dest^ := Src^;
Inc(Src);
Inc(Dest);
end;
end;
procedure TDoubleList.AddList(Source: TDoubleList);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + Source.Count;
if Source.Count <> 0 then
System.Move(Source.L[0], L[OldCount], SizeOf(Double) * Source.Count);
end;
procedure TDoubleList.AddArray(const A: array of Double);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + High(A) + 1;
if High(A) <> -1 then
System.Move(A[0], L[OldCount], SizeOf(Double) * (High(A) + 1));
end;
function TDoubleList.L: PDouble;
begin
Result := PDouble(FList);
end;
{ TCardinalList ------------------------------------------------------------ }
function TCardinalList.BigSum: Int64;
var i: integer;
begin
result := 0;
for i := 0 to Count-1 do result := result + Items[i];
end;
function TCardinalList.Sum: Cardinal;
var
I: Integer;
begin
Result := 0;
for I := 0 to Count - 1 do
Result += Items[I];
end;
procedure TCardinalList.AddList(Source: TCardinalList);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + Source.Count;
if Source.Count <> 0 then
System.Move(Source.L[0], L[OldCount], SizeOf(Cardinal) * Source.Count);
end;
procedure TCardinalList.AddArray(const A: array of Cardinal);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + High(A) + 1;
if High(A) <> -1 then
System.Move(A[0], L[OldCount], SizeOf(Cardinal) * (High(A) + 1));
end;
function TCardinalList.L: PCardinal;
begin
Result := PCardinal(FList);
end;
{ TBooleanList ------------------------------------------------------------ }
procedure TBooleanList.SetFalse(Index: Integer);
begin
Items[Index] := false;
end;
procedure TBooleanList.SetTrue(Index: Integer);
begin
Items[Index] := true;
end;
function TBooleanList.ToLongInt: TLongIntList;
var
I: Integer;
begin
Result := TLongIntList.Create;
Result.Count := Count;
for I := 0 to Count - 1 do
Result.Items[I] := Ord(Items[I]);
end;
procedure TBooleanList.AddList(Source: TBooleanList);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + Source.Count;
if Source.Count <> 0 then
System.Move(Source.L[0], L[OldCount], SizeOf(boolean) * Source.Count);
end;
procedure TBooleanList.AddArray(const A: array of boolean);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + High(A) + 1;
if High(A) <> -1 then
System.Move(A[0], L[OldCount], SizeOf(boolean) * (High(A) + 1));
end;
function TBooleanList.L: PBoolean;
begin
Result := PBoolean(FList);
end;
{ TLongIntList ----------------------------------------------------------- }
function TLongIntList.Max: LongInt;
var
I: Integer;
begin
Result := Low(LongInt);
for I := 0 to Count - 1 do
MaxTo1st(Result, Items[I]);
end;
function TLongIntList.Sum: LongInt;
var
I: Integer;
begin
Result := 0;
for I := 0 to Count - 1 do
Result += Items[I];
end;
procedure TLongIntList.DeleteRange(const Index: Integer; DelCount: Integer);
var
I: Integer;
begin
{ Make sure Index and DelCount are sensible first }
if Index >= Count then
Exit;
MinTo1st(DelCount, Count - Index);
for I := Index to Count - 1 - DelCount do
Items[I] := Items[I + DelCount];
Count := Count - DelCount;
end;
procedure TLongIntList.AddList(Source: TLongIntList);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + Source.Count;
if Source.Count <> 0 then
System.Move(Source.L[0], L[OldCount], SizeOf(LongInt) * Source.Count);
end;
procedure TLongIntList.AddArray(const A: array of LongInt);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + High(A) + 1;
if High(A) <> -1 then
System.Move(A[0], L[OldCount], SizeOf(LongInt) * (High(A) + 1));
end;
procedure TLongIntList.AddDuplicate(const Item: LongInt; const DuplicateCount: Cardinal);
var
I, C: Integer;
begin
C := Count;
Count := Count + DuplicateCount;
for I := C to Count - 1 do
Items[I] := Item;
end;
function TLongIntList.L: PLongInt;
begin
Result := PLongInt(FList);
end;
{ TIntegerList ----------------------------------------------------------- }
function TIntegerList.Sum: Integer;
var
I: Integer;
begin
Result := 0;
for I := 0 to Count - 1 do
Result += Items[I];
end;
procedure TIntegerList.AddList(Source: TIntegerList);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + Source.Count;
if Source.Count <> 0 then
System.Move(Source.L[0], L[OldCount], SizeOf(Integer) * Source.Count);
end;
procedure TIntegerList.AddArray(const A: array of Integer);
var
OldCount: Integer;
begin
OldCount := Count;
Count := Count + High(A) + 1;
if High(A) <> -1 then
System.Move(A[0], L[OldCount], SizeOf(Integer) * (High(A) + 1));
end;
function TIntegerList.L: PInteger;
begin
Result := PInteger(FList);
end;
{$endif}
|