| 1 | """Methods on YSH List"""
|
| 2 |
|
| 3 | from __future__ import print_function
|
| 4 |
|
| 5 | from _devbuild.gen.value_asdl import (value, value_t)
|
| 6 |
|
| 7 | from core import num
|
| 8 | from core import vm
|
| 9 | from frontend import typed_args
|
| 10 | from mycpp import mops
|
| 11 | from mycpp.mylib import log
|
| 12 | from ysh import val_ops
|
| 13 |
|
| 14 | _ = log
|
| 15 |
|
| 16 |
|
| 17 | class Append(vm._Callable):
|
| 18 |
|
| 19 | def __init__(self):
|
| 20 | # type: () -> None
|
| 21 | pass
|
| 22 |
|
| 23 | def Call(self, rd):
|
| 24 | # type: (typed_args.Reader) -> value_t
|
| 25 |
|
| 26 | items = rd.PosList()
|
| 27 | to_append = rd.PosValue()
|
| 28 | rd.Done()
|
| 29 |
|
| 30 | items.append(to_append)
|
| 31 | return value.Null
|
| 32 |
|
| 33 |
|
| 34 | class Clear(vm._Callable):
|
| 35 |
|
| 36 | def __init__(self):
|
| 37 | # type: () -> None
|
| 38 | pass
|
| 39 |
|
| 40 | def Call(self, rd):
|
| 41 | # type: (typed_args.Reader) -> value_t
|
| 42 |
|
| 43 | li = rd.PosList()
|
| 44 | rd.Done()
|
| 45 |
|
| 46 | del li[:]
|
| 47 |
|
| 48 | return value.Null
|
| 49 |
|
| 50 |
|
| 51 | class Extend(vm._Callable):
|
| 52 |
|
| 53 | def __init__(self):
|
| 54 | # type: () -> None
|
| 55 | pass
|
| 56 |
|
| 57 | def Call(self, rd):
|
| 58 | # type: (typed_args.Reader) -> value_t
|
| 59 |
|
| 60 | a = rd.PosList()
|
| 61 | b = rd.PosList()
|
| 62 | rd.Done()
|
| 63 |
|
| 64 | a.extend(b)
|
| 65 | return value.Null
|
| 66 |
|
| 67 |
|
| 68 | class Pop(vm._Callable):
|
| 69 |
|
| 70 | def __init__(self):
|
| 71 | # type: () -> None
|
| 72 | pass
|
| 73 |
|
| 74 | def Call(self, rd):
|
| 75 | # type: (typed_args.Reader) -> value_t
|
| 76 |
|
| 77 | items = rd.PosList()
|
| 78 | rd.Done()
|
| 79 |
|
| 80 | return items.pop()
|
| 81 |
|
| 82 |
|
| 83 | class Reverse(vm._Callable):
|
| 84 |
|
| 85 | def __init__(self):
|
| 86 | # type: () -> None
|
| 87 | pass
|
| 88 |
|
| 89 | def Call(self, rd):
|
| 90 | # type: (typed_args.Reader) -> value_t
|
| 91 |
|
| 92 | li = rd.PosList()
|
| 93 | rd.Done()
|
| 94 |
|
| 95 | li.reverse()
|
| 96 |
|
| 97 | return value.Null
|
| 98 |
|
| 99 |
|
| 100 | class IndexOf(vm._Callable):
|
| 101 |
|
| 102 | def __init__(self):
|
| 103 | # type: () -> None
|
| 104 | pass
|
| 105 |
|
| 106 | def Call(self, rd):
|
| 107 | # type: (typed_args.Reader) -> value_t
|
| 108 |
|
| 109 | li = rd.PosList()
|
| 110 | needle = rd.PosValue()
|
| 111 | rd.Done()
|
| 112 | i = 0
|
| 113 | while i < len(li):
|
| 114 | if val_ops.ExactlyEqual(li[i], needle, rd.LeftParenToken()):
|
| 115 | return num.ToBig(i)
|
| 116 | i += 1
|
| 117 | return value.Int(mops.MINUS_ONE)
|
| 118 |
|
| 119 |
|
| 120 | class LastIndexOf(vm._Callable):
|
| 121 |
|
| 122 | def __init__(self):
|
| 123 | # type: () -> None
|
| 124 | pass
|
| 125 |
|
| 126 | def Call(self, rd):
|
| 127 | # type: (typed_args.Reader) -> value_t
|
| 128 |
|
| 129 | li = rd.PosList()
|
| 130 | needle = rd.PosValue()
|
| 131 | rd.Done()
|
| 132 |
|
| 133 | i = len(li) - 1
|
| 134 | while i > -1:
|
| 135 | if val_ops.ExactlyEqual(li[i], needle, rd.LeftParenToken()):
|
| 136 | return num.ToBig(i)
|
| 137 | i -= 1
|
| 138 | return value.Int(mops.MINUS_ONE)
|
| 139 |
|
| 140 |
|
| 141 | class Remove(vm._Callable):
|
| 142 |
|
| 143 | def __init__(self):
|
| 144 | # type: () -> None
|
| 145 | pass
|
| 146 |
|
| 147 | def Call(self, rd):
|
| 148 | # type: (typed_args.Reader) -> value_t
|
| 149 |
|
| 150 | li = rd.PosList()
|
| 151 | to_remove = rd.PosValue()
|
| 152 | rd.Done()
|
| 153 |
|
| 154 | i = 0
|
| 155 | while i < len(li):
|
| 156 | if val_ops.ExactlyEqual(li[i], to_remove, rd.LeftParenToken()):
|
| 157 | li.pop(i)
|
| 158 | break
|
| 159 | i += 1
|
| 160 |
|
| 161 | # Like Dict.erase(), we don't raise an exception. We ensure that there
|
| 162 | # is one less occurrence, and zero occurrences is OK.
|
| 163 | return value.Null
|
| 164 |
|
| 165 |
|
| 166 | class Insert(vm._Callable):
|
| 167 |
|
| 168 | def __init__(self):
|
| 169 | # type: () -> None
|
| 170 | pass
|
| 171 |
|
| 172 | def Call(self, rd):
|
| 173 | # type: (typed_args.Reader) -> value_t
|
| 174 |
|
| 175 | li = rd.PosList()
|
| 176 | # List limited to 2^32 entries
|
| 177 | at_index = mops.BigTruncate(rd.PosInt())
|
| 178 | to_insert = rd.PosValue()
|
| 179 | rd.Done()
|
| 180 |
|
| 181 | length = len(li)
|
| 182 |
|
| 183 | if at_index < 0:
|
| 184 | # Negative index is relative to the end
|
| 185 | at_index += length
|
| 186 | # If it's still less than 0, insert at the beginning
|
| 187 | if at_index < 0:
|
| 188 | at_index = 0
|
| 189 |
|
| 190 | # Note: Positive overflow isn't a special case because there will be no
|
| 191 | # shifting (unlike mycpp SLICE_ADJUST())
|
| 192 |
|
| 193 | # Add extra item at the end
|
| 194 | li.append(None)
|
| 195 |
|
| 196 | # Shift items at positions greater than at_index
|
| 197 | i = length
|
| 198 | while i > at_index:
|
| 199 | li[i] = li[i - 1]
|
| 200 | i -= 1
|
| 201 |
|
| 202 | # New item
|
| 203 | li[i] = to_insert
|
| 204 |
|
| 205 | return value.Null
|