PHP按對(duì)象字段對(duì)對(duì)象數(shù)組進(jìn)行排序的方法-創(chuàng)新互聯(lián)

這篇文章主要介紹PHP按對(duì)象字段對(duì)對(duì)象數(shù)組進(jìn)行排序的方法，文中介紹的非常詳細(xì)，具有一定的參考價(jià)值，感興趣的小伙伴們一定要看完！

陸川網(wǎng)站建設(shè)公司成都創(chuàng)新互聯(lián),陸川網(wǎng)站設(shè)計(jì)制作，有大型網(wǎng)站制作公司豐富經(jīng)驗(yàn)。已為陸川上千多家提供企業(yè)網(wǎng)站建設(shè)服務(wù)。企業(yè)網(wǎng)站搭建\外貿(mào)營(yíng)銷網(wǎng)站建設(shè)要多少錢，請(qǐng)找那個(gè)售后服務(wù)好的陸川做網(wǎng)站的公司定做！

按對(duì)象字段對(duì)對(duì)象數(shù)組排序的實(shí)現(xiàn)方法;

給定一個(gè)對(duì)象數(shù)組，我們按對(duì)象和給定字段對(duì)數(shù)組排序。

方法:

usort()函數(shù)是PHP中內(nèi)置的函數(shù)，用于使用給定的比較器函數(shù)對(duì)元素?cái)?shù)組進(jìn)行有條件的排序。usort()函數(shù)還可以用于按對(duì)象字段對(duì)對(duì)象數(shù)組排序。調(diào)用usort()函數(shù)，第一個(gè)參數(shù)作為對(duì)象數(shù)組，第二個(gè)參數(shù)作為比較器函數(shù)，必須在此基礎(chǔ)上比較兩個(gè)數(shù)組對(duì)象。

PHP代碼示例：

<?php 
  
$gfg_array = array( 
    array( 
        'score' => '100', 
        'name' => 'Sam', 
        'subject' => 'Data Structures'
    ), 
    array( 
        'score' => '50', 
        'name' => 'Tanya', 
        'subject' => 'Advanced Algorithms'
    ), 
    array( 
        'score' => '75', 
        'name' => 'Jack', 
        'subject' => 'Distributed Computing'
    ) 
); 
  
class geekSchool {  
    var $score, $name, $subject; 
    
    public function geekSchool($data) { 
        $this->name = $data['name']; 
        $this->score = $data['score']; 
        $this->subject = $data['subject']; 
    } 
} 
  
function data2Object($data) { 
    $class_object = new geekSchool($data); 
    return $class_object; 
}  

function comparator($object1, $object2) { 
    return $object1->score > $object2->score; 
} 
  
$school_data = array_map('data2Object', $gfg_array); 
  
print("原始對(duì)象數(shù)組:\n"); 
  
print_r($school_data); 
  
usort($school_data, 'comparator'); 
  
print("\n對(duì)象數(shù)組排序:\n"); 
  
print_r($school_data);

輸出：

原始對(duì)象數(shù)組:
Array
(
    [0] => geekSchool Object
        (
            [score] => 100
            [name] => Sam
            [subject] => Data Structures
        )

    [1] => geekSchool Object
        (
            [score] => 50
            [name] => Tanya
            [subject] => Advanced Algorithms
        )

    [2] => geekSchool Object
        (
            [score] => 75
            [name] => Jack
            [subject] => Distributed Computing
        )

)

對(duì)象數(shù)組排序:
Array
(
    [0] => geekSchool Object
        (
            [score] => 50
            [name] => Tanya
            [subject] => Advanced Algorithms
        )

    [1] => geekSchool Object
        (
            [score] => 75
            [name] => Jack
            [subject] => Distributed Computing
        )

    [2] => geekSchool Object
        (
            [score] => 100
            [name] => Sam
            [subject] => Data Structures
        )

)

以上是PHP按對(duì)象字段對(duì)對(duì)象數(shù)組進(jìn)行排序的方法的所有內(nèi)容，感謝各位的閱讀！希望分享的內(nèi)容對(duì)大家有幫助，更多相關(guān)知識(shí)，歡迎關(guān)注創(chuàng)新互聯(lián)行業(yè)資訊頻道！

名稱欄目：PHP按對(duì)象字段對(duì)對(duì)象數(shù)組進(jìn)行排序的方法-創(chuàng)新互聯(lián)
文章路徑：http://www.muchs.cn/article14/dsscge.html

成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián)，為您提供外貿(mào)網(wǎng)站建設(shè)、微信小程序、服務(wù)器托管、域名注冊(cè)、移動(dòng)網(wǎng)站建設(shè)、企業(yè)建站

廣告

聲明：本網(wǎng)站發(fā)布的內(nèi)容（圖片、視頻和文字）以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主，如果涉及侵權(quán)請(qǐng)盡快告知，我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng)，如需處理請(qǐng)聯(lián)系客服。電話：028-86922220；郵箱：631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載，或轉(zhuǎn)載時(shí)需注明來(lái)源： 創(chuàng)新互聯(lián)