|
|
|
|
|
|
|
|
|
|
- Sorting the memory area
- Existence of memory area
- Performing a search in a memory area
- Equivalence
MemPrevious (Function) In french: MemPrécédent
 Warning
From version 20, this feature is kept for backward compatibility. We recommend that you use Associative arrays.
Positions on the element found before the current element of a memory area and returns the value of this element.
ResPrécédent = MemPrevious("MaZoneMémoire")
Syntax
<Result> = MemPrevious(<Memory area>)
<Result>: Any type - If previous element exists: return value of previous element, defined by functions MemAdd or MemModify.
- If the preceding element does not exist: an empty string ("").
<Memory area>: Character string Name of the memory area, defined by MemCreate. Remarks The sorts performed by MemSort are taken into account during the call to MemPrevious. If no sort was requested by MemSort, MemPrevious returns the value of the previous element according to the order of the elements added by MemAdd. Existence of memory area The existence of the memory area is not checked. If the specified memory area does not exist, a WLanguage error occurs when MemPrevious is used. To check the existence of a memory area, use MemExist. Performing a search in a memory area If MemSeek is used before the call to MemPrevious, MemPrevious will be positioned on the previous element sought. The two following syntaxes are equivalent: Res = MemPrevious(<Memory area>)
Res = MemRetrieve(<Memory area>, MemCurrent(<Memory area>)-1) Business / UI classification: Neutral code
This page is also available for…
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|