Anyone know how to delete an element in a array? Is there any built in method to do that?

If not, does anyone know of how to implement such a method?

  • Do you want to just delete the element, or delete it and move everything down an index? – Tjaden Hess Feb 21 '16 at 1:20
  • I would like everything down an index so if i delete a[2] then a[3] becomes a[2] – user697 Feb 21 '16 at 1:42

Use the delete operator to delete the element:

delete array[index];

If you don't want to leave a gap, you need to move each element manually:

contract test{
    uint[] array = [1,2,3,4,5];
    function remove(uint index)  returns(uint[]) {
        if (index >= array.length) return;

        for (uint i = index; i<array.length-1; i++){
            array[i] = array[i+1];
        delete array[array.length-1];
        return array;

If you don't care about the order, you can also just copy the last element into the empty spot, then delete the last element.

  • 1
    Thanks! I just have an issue with the function you gave when trying to make it more " general : function remove(uint[] array,uint index) returns(uint[]) { gives me Error: Expression has to be an lvalue. array.length--; Also , does that method can be adapted to work on array of all types ( struct , etc ) ? – user697 Feb 21 '16 at 2:35
  • I'm not sure about decreasing the length of arrays in memory, as opposed to storage. You can copy it all over to a new array, I guess, or just remove that line and leave the trailing zeros. You won't save any gas by making a memory array shorter, anyway. This method should work on any type, except mappings, since delete doesn't really make sense in mappings. – Tjaden Hess Feb 21 '16 at 2:41
  • if the array is very large for example 1000 objects, should not it consume very large amount of gas? – alper Oct 21 '16 at 13:47
  • 3
    Decreasing array length will automatically clean up the storage slots occupied by the out-of-bounds elements. So the line delete array[array.length-1]; is redundant. Moreover it adds 5000 gas to the transaction since gas refund applies only in the case when storage is reset from non-zero to zero value. If it's set from zero to zero (added by compiler) it costs 5000 gas. – medvedev1088 Feb 11 '18 at 20:02
  • 2
    The best way I tested that works is to copy the last element to the deleted spot, call delete on the last index, then decrement the array length. This is a constant amount of work, not linear. If you care about the order, you should have an additional mapping from this element to next, that you maintain during addition and deletion. – Amin Ariana Sep 21 '18 at 20:03

Small optimisation to Tjaden Hess' answer:

contract Test {
    uint[] array = [1,2,3,4,5];
    function remove(uint index)  returns(uint[]) {
        if (index >= array.length) return;

        for (uint i = index; i<array.length-1; i++){
            array[i] = array[i+1];
        return array;

I removed the line delete array[array.length-1]; before array.length--;. This makes the function cheaper by 5000 gas. The compiler will automatically clean up unoccupied slots when array length is decreased. Double storage resetting adds 5000 gas.

  • 3
    I found this answer only to work on storage arrays, can you confirm? The array.length--; line will throw an exception. When changing it so that there is no error anymore it will not remove the last element of the array. – Nico May 18 '18 at 8:40
  • @Nico, yup, array.length-- only works on storage arrays, for memory arrays, the length is constant after it's assigned. if you want a memory array of different length, you need to declare a new memory array. – hellopeach Jul 31 '19 at 12:10
  • What is the purpose of the return statement at the end of the function? – Derrick Miller Dec 9 '19 at 2:40
  • array.pop() instead of array.length-- for solidity > 0.6 even for storage arrays. – Zatara7 Aug 20 '20 at 19:16

This constant operation works without preserving order:

uint[] internal array;

// Move the last element to the deleted spot.
// Delete the last element, then correct the length.
function _burn(uint index) internal {
  require(index < array.length);
  array[index] = array[array.length-1];

To preserve order on recall without incurring the gas cost of shifting right-of-gap values, you'll need an additional mapping between each element's index to its successor's index that you need to maintain during insertion and deletion: mapping(uint => uint) private indexAfter;

pragma solidity ^0.4.11;
contract TestArray {
    uint[] public original;
    uint[] public newOr;
    event Log(uint n, uint a, uint b, uint c);

    function TestArray(){


    function test(){
        newOr = remove(original, 1);
        Log(newOr.length, newOr[0], newOr[1], newOr[2]);
    function remove(uint[] array, uint index) internal returns(uint[] value) {
        if (index >= array.length) return;

        uint[] memory arrayNew = new uint[](array.length-1);
        for (uint i = 0; i<arrayNew.length; i++){
            if(i != index && i<index){
                arrayNew[i] = array[i];
            } else {
                arrayNew[i] = array[i+1];
        delete array;
        return arrayNew;

  • How Could I delete the complete array? – Mago Nicolas Palacios Sep 22 '17 at 0:49
  • You need to delete all elements one by one. The array itself cannot not be deleted as it's a storage variable and lives forever in the contract space. – Andrey Feb 8 '18 at 4:39

delete a assigns the initial value for the type to a. I.e. for integers it is equivalent to a = 0, but it can also be used on arrays, where it assigns a dynamic array of length zero or a static array of the same length with all elements reset. For structs, it assigns a struct with all members reset.

> I have implemented it, may be helpful to understand by this simple example


And if we remove the element using index it will not leave the gap.



contract UserRecord {
    constructor() public { owner = msg.sender; }

    address owner;

    modifier onlyOwner {
        require(msg.sender == owner);

    struct User {
        bytes32 userEmail;
        uint index;

    mapping (bytes32 => User) private users;

    bytes32[] private usersRecords;
    event LogNewUser(bytes32 indexed userEmail, uint index);

    function setUseremail(bytes32 _userEmail) public onlyOwner returns(bool success){
        users[_userEmail].userEmail = _userEmail;
        users[_userEmail].index = usersRecords.push(_userEmail) -1;

        emit LogNewUser(
        return true;

//this will delete the user at particular index and gap will be not there

    function deleteUser(bytes32 _userEmail) public onlyOwner returns(uint index){
        uint toDelete = users[_userEmail].index;
        bytes32 lastIndex = usersRecords[usersRecords.length-1];
        usersRecords[toDelete] = lastIndex;
        users[lastIndex].index = toDelete; 
        return toDelete;   

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.