# Delete a particular item in a queue without using delete method

**URL:** <https://verificationacademy.com/forums/t/delete-a-particular-item-in-a-queue-without-using-delete-method/39369>\
**Category:** SystemVerilog\
**Tags:** SystemVerilog, queues-systemverilog\
**Created:** [July 26, 2021, 6:19pm UTC](https://verificationacademy.com/forums/t/delete-a-particular-item-in-a-queue-without-using-delete-method/39369 "2021-07-26T18:19:23Z")\
**Posts on this page:** 1\
**Showing post:** 4

<div class="post-metadata">

**Author:** ![dave\_59](https://verificationacademy.com/forums/user_avatar/verificationacademy.com/dave_59/32/4499_2.png) [@dave\_59](https://verificationacademy.com/forums/u/dave_59)\
**Post date:** [February 1, 2023, 10:46pm UTC](https://verificationacademy.com/forums/t/delete-a-particular-item-in-a-queue-without-using-delete-method/39369/4 "2023-02-01T22:46:51Z")

</div>

_In reply to [rlraj\_2020](https://verificationacademy.com/forums/t/delete-a-particular-item-in-a-queue-without-using-delete-method/39369/3):_

I don’t agree with that explanation. Queues are the best kind of array for adding or deleting one element at a time. While it might be true that accessing (reading or writing) an element in the middle queue might be less efficient than other array kinds, having to reconstruct the entire queue because an element gets added or deleted is going to be less efficient. It would be much better to write this as

```verilog
module test();
  int q[$] = {12,3,45,23};
  int b[$]; // all 'find' methods return a queue in case nothing is found.
  initial begin
    b = q.find_first_index(x) with (x==45);
    if (b.size() == 1) q.delete(b[0]);
  end
endmodule

```

---

_[View the full topic](https://verificationacademy.com/forums/t/delete-a-particular-item-in-a-queue-without-using-delete-method/39369)._
