當前位置: 首頁>>代碼示例>>PHP>>正文


PHP Uuid::getMostSignificantBitsHex方法代碼示例

本文整理匯總了PHP中Rhumsaa\Uuid\Uuid::getMostSignificantBitsHex方法的典型用法代碼示例。如果您正苦於以下問題:PHP Uuid::getMostSignificantBitsHex方法的具體用法?PHP Uuid::getMostSignificantBitsHex怎麽用?PHP Uuid::getMostSignificantBitsHex使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在Rhumsaa\Uuid\Uuid的用法示例。


在下文中一共展示了Uuid::getMostSignificantBitsHex方法的1個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的PHP代碼示例。

示例1: compareTo

 /**
  * Compares this UUID with the specified UUID.
  *
  * The first of two UUIDs is greater than the second if the most
  * significant field in which the UUIDs differ is greater for the first
  * UUID.
  *
  * Q. What's the value of being able to sort UUIDs?<br>
  * A. Use them as keys in a B-Tree or similar mapping.
  *
  * @param Uuid $uuid UUID to which this UUID is to be compared
  * @return int -1, 0 or 1 as this UUID is less than, equal to, or greater than $uuid
  */
 public function compareTo(Uuid $uuid)
 {
     $comparison = null;
     if ($this->getMostSignificantBitsHex() < $uuid->getMostSignificantBitsHex()) {
         $comparison = -1;
     } elseif ($this->getMostSignificantBitsHex() > $uuid->getMostSignificantBitsHex()) {
         $comparison = 1;
     } elseif ($this->getLeastSignificantBitsHex() < $uuid->getLeastSignificantBitsHex()) {
         $comparison = -1;
     } elseif ($this->getLeastSignificantBitsHex() > $uuid->getLeastSignificantBitsHex()) {
         $comparison = 1;
     } else {
         $comparison = 0;
     }
     return $comparison;
 }
開發者ID:AlexSnet,項目名稱:webtrees,代碼行數:29,代碼來源:Uuid.php


注:本文中的Rhumsaa\Uuid\Uuid::getMostSignificantBitsHex方法示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台,相關代碼片段篩選自各路編程大神貢獻的開源項目,源碼版權歸原作者所有,傳播和使用請參考對應項目的License;未經允許,請勿轉載。