Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating resource.
Please try to avoid dependencies to third-party libraries and frameworks.
Implementation edit is for fixing errors and enhancing with metadata.
Instead of changing the code of the snippet, consider creating another Perl implementation.
for i, y := range items { if y == x { items = append(items[:i], items[i+1:]...) break } }
for i, y := range items { if y == x { copy(items[i:], items[i+1:]) items[len(items)-1] = nil items = items[:len(items)-1] break } }
i = items.index(x) items.delete_at(i) unless i.nil?
items.remove(x)
items.remove(x);
if let Some(i) = items.first(&x) { items.remove(i); }
integer, dimension(:), allocatable :: items i = findloc(items, x) if (i /= 0) items = [items(1:i-1), items(i+1:)]
$list_position = array_search($x, $items); $specific_item = $items[$position]; unset($specific_item);
erase(items, x);
List.delete(items, x)