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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T17:15:15+00:00 2026-05-11T17:15:15+00:00

Suppose I have 2 enumerations that I know have the same number of elements

  • 0

Suppose I have 2 enumerations that I know have the same number of elements and each element “corresponds” with the identically placed element in the other enumeration. Is there a way to process these 2 enumerations simultaneously so that I have access to the corresponding elements of each enumeration at the same time?

Using a theoretical LINQ syntax, what I have in mind is something like:

from x in seq1, y in seq2
select new {x.foo, y.bar}
  • 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-11T17:15:15+00:00Added an answer on May 11, 2026 at 5:15 pm

    Since Neil Williams deleted his answer, I’ll go ahead and post a link to an implementation by Jon Skeet.

    To paraphrase the relevant portion:

    public static IEnumerable<KeyValuePair<TFirst,TSecond>> Zip<TFirst,TSecond>
        (this IEnumerable<TFirst> source, IEnumerable<TSecond> secondSequence)
    {
        using (IEnumerator<TSecond> secondIter = secondSequence.GetEnumerator())
        {
            foreach (TFirst first in source)
            {
                if (!secondIter.MoveNext())
                {
                    throw new ArgumentException
                        ("First sequence longer than second");
                }
                yield return new KeyValuePair<TFirst, TSecond>(first, secondIter.Current);
            }
            if (secondIter.MoveNext())
            {
                throw new ArgumentException
                    ("Second sequence longer than first");
            }
        }        
    }
    

    Note that the KeyValuePair<> is my addition, and that I’m normally not a fan of using it this way. Instead, I would define a generic Pair or Tuple type. However, they are not included in the current version of the framework and I didn’t want to clutter this sample with extra class definitions.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Suppose we have buyers and sellers that are trying to find each other in
Suppose we have a method that accepts a value of an enumeration. After this
Suppose I have a stringbuilder in C# that does this: StringBuilder sb = new
Suppose I have: Toby Tiny Tory Tily Is there an algorithm that can easily
Suppose I have a table called Companies that has a DepartmentID column. There's also
Suppose in XSD we have an element 'answer' defined: <xs:element name=answer minOccurs=1 maxOccurs=1> <xs:complexType>
Suppose I have a list of type list<boost::any> that has some type in it
Suppose i have an XML file, that i use as local database, like this):
Suppose I have a stream of [acme] objects that I want to expose via
suppose i have label and button on textbox and i want that if i

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.