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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T12:05:29+00:00 2026-06-14T12:05:29+00:00

Is there an easy way (i.e. a function) to determine the level of nesting

  • 0

Is there an easy way (i.e. a function) to determine the level of nesting in list?
I know there is str which can be used to get this information. But is there something that simply gives back the result? And can I use such a function to get the names of all levels of alist (recursively) ?

  • 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-14T12:05:29+00:00Added an answer on June 14, 2026 at 12:05 pm

    A little recursive function can do this for you:

    depth <- function(this,thisdepth=0){
      if(!is.list(this)){
        return(thisdepth)
      }else{
        return(max(unlist(lapply(this,depth,thisdepth=thisdepth+1))))    
      }
    }
    

    If you’ve got package:testthat, here’s a test set:

    l1=list(1,2,3)
    l2=list(1,2,l1,4)
    l3=list(1,l1,l2,5)
    
    require(testthat)
    expect_equal(depth(l1),1)
    expect_equal(depth(l2),2)
    expect_equal(depth(l3),3)
    

    Apologies for using lower-case L in variable names. Readability fail.

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

Sidebar

Related Questions

Is there an easy way to be inside a python function and get a
Is there a built-in php function or an easy way to insert an element
Is there an easy way or integrated function to find out the decimal places
Is there an easy way to set a callback function to a new window
Is there an easy way to call a function given a string name in
Is there an easy way to invert a number in C# with a function?
Question: Is there an easy way (library function) to perform a bitwise AND or
Is there an easy way to get Doctrine's entity manager from within an entity's
Is there an easy way of working out which elements on a webpage will
I'm wondering if there's an easy way to get the colorspace of an image

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.