-
Notifications
You must be signed in to change notification settings - Fork 25
Expand file tree
/
Copy pathnatcasesort.xml
More file actions
154 lines (150 loc) · 3.7 KB
/
natcasesort.xml
File metadata and controls
154 lines (150 loc) · 3.7 KB
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
<?xml version="1.0" encoding="utf-8"?>
<!-- EN-Revision: f781803449007bb0e3a96c693e0eee067f7eb466 Maintainer: nilgun Status: ready -->
<refentry xml:id="function.natcasesort" xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink">
<refnamediv>
<refname>natcasesort</refname>
<refpurpose>Bir diziyi harf büyüklüğüne duyarsız "doğal sıralama"
algoritmasıyla sıralar</refpurpose>
</refnamediv>
<refsect1 role="description">
&reftitle.description;
<methodsynopsis>
<type>true</type><methodname>natcasesort</methodname>
<methodparam><type>array</type><parameter role="reference">dizi</parameter></methodparam>
</methodsynopsis>
<para>
<function>natcasesort</function> işlevi <function>natsort</function>
işlevinin harf büyüklüğüne duyarsız sürümüdür.
</para>
<para>
Bu işlev, abecesayısal dizgeleri, insanların anahtar değer ilişkisini
sağlayarak yaptıkları şekilde gerçekleyen bir sıralama algoritmasını
kullanarak sıralar. Bu algoritmaya "doğal sıralama" algoritması adı
verilir.
</para>
¬e.sort-unstable;
¬e.reset-index;
</refsect1>
<refsect1 role="parameters">
&reftitle.parameters;
<para>
<variablelist>
<varlistentry>
<term><parameter>dizi</parameter></term>
<listitem>
<para>
Sıralanacak dizi.
</para>
</listitem>
</varlistentry>
</variablelist>
</para>
</refsect1>
<refsect1 role="returnvalues">
&reftitle.returnvalues;
<para>
&return.true.always;
</para>
</refsect1>
<refsect1 role="changelog">
&reftitle.changelog;
<para>
<informaltable>
<tgroup cols="2">
<thead>
<row>
<entry>&Version;</entry>
<entry>&Description;</entry>
</row>
</thead>
<tbody>
&return.type.true;
</tbody>
</tgroup>
</informaltable>
</para>
</refsect1>
<refsect1 role="examples">
&reftitle.examples;
<para>
<example>
<title>- <function>natcasesort</function> örneği</title>
<programlisting role="php">
<![CDATA[
<?php
$array1 = $array2 = array('IMG0.png', 'img12.png', 'img10.png', 'img2.png',
'img1.png', 'IMG3.png');
sort($array1);
echo "Standart sıralama\n";
print_r($array1);
natcasesort($array2);
echo "\nDoğal sıralama (harf büyüklüğüne duyarsız)\n";
print_r($array2);
?>
]]>
</programlisting>
&example.outputs;
<screen>
<![CDATA[
Standart sıralama
Array
(
[0] => IMG0.png
[1] => IMG3.png
[2] => img1.png
[3] => img10.png
[4] => img12.png
[5] => img2.png
)
Doğal sıralama (harf büyüklüğüne duyarsız)
Array
(
[0] => IMG0.png
[4] => img1.png
[3] => img2.png
[5] => IMG3.png
[2] => img10.png
[1] => img12.png
)
]]>
</screen>
<para>
Daha fazla bilgi için Martin Pool'un <link
xlink:href="&url.strnatcmp;">Natural Order String Comparison</link>
sayfasına bakınız.
</para>
</example>
</para>
</refsect1>
<refsect1 role="seealso">
&reftitle.seealso;
<para>
<simplelist>
<member><function>natsort</function></member>
<member>&seealso.array.sorting;</member>
<member><function>strnatcmp</function></member>
<member><function>strnatcasecmp</function></member>
</simplelist>
</para>
</refsect1>
</refentry>
<!-- Keep this comment at the end of the file
Local variables:
mode: sgml
sgml-omittag:t
sgml-shorttag:t
sgml-minimize-attributes:nil
sgml-always-quote-attributes:t
sgml-indent-step:1
sgml-indent-data:t
indent-tabs-mode:nil
sgml-parent-document:nil
sgml-default-dtd-file:"~/.phpdoc/manual.ced"
sgml-exposed-tags:nil
sgml-local-catalogs:nil
sgml-local-ecat-files:nil
End:
vim600: syn=xml fen fdm=syntax fdl=2 si
vim: et tw=78 syn=sgml
vi: ts=1 sw=1
-->