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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 4, 20262026-06-04T02:27:33+00:00 2026-06-04T02:27:33+00:00

I have a list. I need to create a a new list, like in

  • 0

I have a list. I need to create a a new list, like in example below:
[3, 3, 1, 3] to [3, 3, 3, 1, 1, 3, 3].
can anybody tell what is wrong with my code?

add xs
   = let
      adding (x : xs) as
         =
            if x == head(xs) && length(xs) >= 1
               then adding xs (x : as)
               else adding xs (x : x : as)
      adding _ as
         = as
   in
   adding xs []

ghci tells that there is always empty list is xs, but i have xs length control.

  • 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-06-04T02:27:34+00:00Added an answer on June 4, 2026 at 2:27 am

    I’m not sure what you’re ultimately trying to do, but I can help you avoid the “empty list” problem.

    When the list (x:xs) has one item left in it, xs == []. (For example, if (x:xs) contains only the item 1, then x == 1, and xs == []). In this case, head xs causes an exception because head is not defined for empty lists.

    Try changing the line

    if x == head(xs) && length(xs) >= 1
    

    to

    if length(xs) >= 1 && x == head(xs)
    

    After this change, when xs == [], length(xs) >= 1 evaluates to False. Since False && p == False for all p, Haskell skips evaluating the other expression (x == head(xs)), and the exception is avoided.

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

Sidebar

Related Questions

I have the following code. I need to create list separators before A elements,
so i have a list where i need to add new values constantly but
I need to create a Linked List from a text file that looks like
I have two collections, and need to create a new collection from the two
I have created a custom list as a feature in sharepoint. i need to
I have a list that I need to send through a URL to a
I have list of catalog paths and need to filter out some of them.
I have List[(String,String)] and I need to sort them by the 2nd value and
I need help with CMD scripts. Here is my problem: I have list of
I have a list of callback functions that I need to invoke when an

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.