Title: | PADDED STRING - TREATING STRING AS SEQUENCE OF MACHINE WORDS |
Authors: | WU, PC WANG, FJ 資訊科學與工程研究所 Institute of Computer Science and Engineering |
Keywords: | STRING;DATA STRUCTURE;STRING SORTING |
Issue Date: | 1-Sep-1994 |
Abstract: | A string is a sequence of characters. The operations such as copy and comparison on strings are usually performed character by character. This note presents a data type called padded string, a string type with faster operations. A padded string is a sequence of machine words. For 32-bit machines, four characters can be operated in one machine instruction. Operations on padded strings can then run faster than traditional strings such as char* in C language. An experiment sorting an array of strings shows speedup 24% using padded string. |
URI: | http://hdl.handle.net/11536/2356 |
ISSN: | 0362-1340 |
Journal: | SIGPLAN NOTICES |
Volume: | 29 |
Issue: | 9 |
Begin Page: | 64 |
End Page: | 67 |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.