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 7073369
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T05:55:17+00:00 2026-05-28T05:55:17+00:00

I was looking into <algorithm> ‘s fill and fill_n function, and to me they

  • 0

I was looking into <algorithm>‘s fill and fill_n function, and to me they seem to do about the same thing but are just defined differently.

Is this true, and if not, how are they different?

The wording for their descriptions seem to be about the same (that I read from MSDN at fill_n and fill).

If they are the same, what is the advantage of having both of these functions available?

It is to just give a developer more options, or is one faster than the other?

  • 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-28T05:55:17+00:00Added an answer on May 28, 2026 at 5:55 am

    They’re not the same function, no. std::fill fills a range, given a start and end iterator. std::fill_n fills a certain number of elements, given a start iterator and a quantity. fill_n is useful for output iterators, when there’s no way for you to get an end iterator, such as with std::ostream_iterator:

    std::fill( std::ostream_iterator<int>(std::cout), ???, x);
                                                      ^^^
                                               what do I put here?
    
    std::fill_n( std::ostream_iterator<int>(std::cout), 25, x);
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm looking into Paxos and I'm confused about how the algorithm should behave in
I'm looking for an efficient algorithm for scrambling a set of letters into a
I am looking for a algorithm that takes a string and splits it into
I looking into making a kind of robot testing browser. Like Selenium, but one
I'm looking for a packing algorithm which will reduce a regular polygon into rectangles
I was looking into the timsort algorithm for doing some sorting on my fairly
I'm looking at the possibility of implementing a Levenshtein distance algorithm using APARAPI, but
I came across this sort algorithm when looking for a function to sort a
So I have been looking into implementing a lowest common ancestor algorithm. I looked
I'm looking for an algorithm that will evenly distribute 1 to many items into

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.