Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 687891
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 14, 20262026-05-14T02:10:25+00:00 2026-05-14T02:10:25+00:00

I really wish Processing had push and pop methods for working with Arrays, but

  • 0

I really wish Processing had push and pop methods for working with Arrays, but since it does not I’m left trying to figure out the best way to remove an object at a specific position in an array. I’m sure this is as basic as it gets for many people, but I could use some help with it, and I haven’t been able to figure much out by browsing the Processing reference.

I don’t think it matters, but for your reference here is the code I used to add the objects initially:

Flower[] flowers = new Flower[0];

for (int i=0; i < 20; i++)
{
    Flower fl = new Flower();
    flowers = (Flower[]) expand(flowers, flowers.length + 1);
    flowers[flowers.length - 1] = fl;
}

For the sake of this question, let’s assume I want to remove an object from position 15. Thanks, guys.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-14T02:10:25+00:00Added an answer on May 14, 2026 at 2:10 am

    I think that your best bet is to use arraycopy. You can use the same array for src and dest. Something like the following (untested):

    // move the end elements down 1
    arraycopy(flowers, 16, flowers, 15, flowers.length-16);
    // remove the extra copy of the last element
    flowers = shorten(flowers);
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I really should upgrade to Firefox 3, but I'm very dependent on Firebug working
I do not really wish to profile because I was wanting to do many
Really stuck on trying to write code to unzip a file or directory on
I really like DevX components, but they are pretty expensive, maybe anyone knows free
Really wish i was God, then I would understand what this means: The element
I really wish that Google was better at searching for syntax: decades :: (RealFrac
When I look in the SVN log I really wish I could see markers
I get the following now in the output log. I really wish I hadn't
i wish to create a repository pattern but with a WCF Rest Service which
Really simple question - how do I do a search to find all records

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.