LlOrd/ja

/ja

/LSL

Ord

llOrd

要約

関数: integer llOrd( string val, integer index );

?	関数ID
0.0	遅延
10.0	エネルギー

Calculate the ordinal value for a character in a string.
integer で返します。

• string	val	–	Source string for character ordinal.
• integer	index	–	Index of character ordinal to retrieve.

index supports negative indexes. The returned value is the UTF-32 value of the character at the specified index. If index is outside the bounds of the string, this function returns 0.

仕様

Index	Positive	Negative
First	0	-length
Last	length - 1	-1

Indexes

• Positive indexes count from the beginning, the first item being indexed as 0, the last as (length - 1).

• Negative indexes count from the far end, the first item being indexed as -length, the last as -1.

警告

• If index is out of bounds the script continues to execute without an error message.

サンプル

default
{
    touch_start(integer total_number)
    {
        string test_string = "The quick brown fox jumped over the lazy dog";
        list test_list = [];
        string test_string2 = "";
        
        integer index;
        integer ord;
        for (index = 0; index < llStringLength(test_string); ++index)
        {
            ord = llOrd(test_string, index);
            test_list = test_list + [ ord ];
        }
        
        string char;
        for (index = 0; index < llGetListLength(test_list); ++index)
        {
            ord = llList2Integer(test_list, index);
            char = llChar(ord);
            test_string2 = test_string2 + char;
        }
        
        llSay(0, "\"" + test_string + "\" -> [" + 
            llDumpList2String(test_list, ", ") + "] -> \"" + test_string2 + "\"");
    }
}

関連項目

関数

• llChar/ja	Convert an ordinal into a character
• llHash/ja	Calculate a 32bit hash for a string

記事

•	Negative Index
•	UTF-32

特記事項

Search JIRA for related Issues

Signature
function integer llOrd( string val, integer index );

この翻訳は 原文 と比べて古いですか？間違いがありますか？読みにくいですか？みんなで 修正 していきましょう！ (手順はこちら)

この項目はあなたにとって参考にならない項目ですか？もしかしたらLSL Wikiの関連した項目が参考になるかもしれません。