Witamy w Nieoficjalnym polskim support'cie AMX Mod X
Witamy w Nieoficjalnym polskim support'cie AMX Mod X, jak w większości społeczności internetowych musisz się zarejestrować aby móc odpowiadać lub zakładać nowe tematy, ale nie bój się to jest prosty proces w którym wymagamy minimalnych informacji.
|
Guest Message by DevFuse
3rdParty
CSX
DoDX
Engine
ESF
Fakemeta
Fun
GeoIP
HamSandwich
JSON
NS
nVault
REAPI
Sockets
Sql
SQLx
TFCX
TSFUN
TSX
ammopacks
amxbans_core
amxbans_main
atac
basebuilder
celltrie
chr_engine
cod
codmod
colorchat
credits
csdm
dHUD
diablo_nowe
entlib
expmod
expmod_achievements
expmod_mission
expmod_shop
fvault
ggpro
gunxpmod
ncodmod
netdb
orpheu
orpheu_advanced
orpheu_const
orpheu_memory
orpheu_stocks
pokemod
roulette
StripWeapons
zmvip
zombie_plague_advance
zombieplague
zombieplaguenew1.3
Coreamxbans_core
amxbans_main
atac
basebuilder
celltrie
chr_engine
cod
codmod
colorchat
credits
csdm
dHUD
diablo_nowe
entlib
expmod
expmod_achievements
expmod_mission
expmod_shop
fvault
ggpro
gunxpmod
ncodmod
netdb
orpheu
orpheu_advanced
orpheu_const
orpheu_memory
orpheu_stocks
pokemod
roulette
StripWeapons
zmvip
zombie_plague_advance
zombieplague
zombieplaguenew1.3
amxconst
amxmisc
amxmodx
cellarray
chatcolor
core
datapack
file
float
hlsdk_const
lang
message_const
message_stocks
messages
newmenus
sorting
string
time
vault
vector
Cstrikeamxmisc
amxmodx
cellarray
chatcolor
core
datapack
file
float
hlsdk_const
lang
message_const
message_stocks
messages
newmenus
sorting
string
time
vault
vector
CSX
DoDX
Engine
ESF
Fakemeta
Fun
GeoIP
HamSandwich
JSON
NS
nVault
REAPI
cssdk_const
hlsdk_const
reapi
reapi_engine
reapi_engine_const
reapi_gamedll
reapi_rechecker
reapi_reunion
reapi_vtc
Regexhlsdk_const
reapi
reapi_engine
reapi_engine_const
reapi_gamedll
reapi_rechecker
reapi_reunion
reapi_vtc
Sockets
Sql
SQLx
TFCX
TSFUN
TSX
/* Sorting functions. * * by the AMX Mod X Development Team * * This file is provided as is (no warranties). * * All sort functions are based off the qsort() function from the * C standard library, which uses the Quick Sort algorithm. * For more info, see: http://linux.wku.edu/~lamonml/algor/sort/sort.html */ #if defined _sorting_included #endinput #endif #define _sorting_included enum SortMethod { Sort_Ascending = 0, Sort_Descending = 1, }; /** * Basic sorting functions below. */ native SortIntegers(array[], array_size, SortMethod:order = Sort_Ascending); native SortFloats(Float:array[], array_size, SortMethod:order = Sort_Ascending); native SortStrings(array[][], num_strings, SortMethod:order = Sort_Ascending); /** * Custom sorting functions below. */ /** * Sorts a custom 1D array. You must pass in a comparison function. * The sorting algorithm then uses your comparison function to sort the data. * The function is called in the following manner: * * public MySortFunc(elem1, elem2, const array[], const data[], data_size) * * elem1, elem2 - Current element pair being compared * array[] - Array in its current mid-sorted state. * data[] - Extra data array you passed to the sort func. * data_size - Size of extra data you passed to the sort func. * * Your function should return: * -1 if elem1 should go before elem2 * 0 if elem1 and elem2 are equal * 1 if elem1 should go after elem2 * Note that the parameters after elem2 are all optional and you do not need to specify them. */ native SortCustom1D(array[], array_size, const comparefunc[], data[]="", data_size=0); /** * Sorts a custom 2D array. * The sorting algorithm then uses your comparison function to sort the data. * The function is called in the following manner: * * public MySortFunc(const elem1[], const elem2[], const array[], data[], data_size) * * elem1[], elem2[] - Current element array pairs being compared * array[][] - Array in its currently being sorted state. * data[] - Extra data array you passed to the sort func. * data_size - Size of extra data you passed to the sort func. * * Your function should return: * -1 if elem1[] should go before elem2[] * 0 if elem1[] and elem2 are equal[] * 1 if elem1[] should go after elem2[] * Note that the parameters after elem2[] are all optional and you do not need to specify them. */ native SortCustom2D(array[][], array_size, const comparefunc[], data[]="", data_size=0);
Pobierz plik sorting.inc