{"id":16780,"date":"2022-10-22T03:55:32","date_gmt":"2022-10-21T22:25:32","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/"},"modified":"2022-10-22T03:55:32","modified_gmt":"2022-10-21T22:25:32","slug":"solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/","title":{"rendered":"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset?"},"content":{"rendered":"

[ad_1]
\n<\/p>\n

\n
\n
<\/div>\n
\n
\n

The following code does what the question asks for.
\nThe function that does all the work is append_one<\/code>. It<\/p>\n

    \n
  1. Creates a vector Y<\/code> repeating the prefix length(x)<\/code> times.<\/li>\n
  2. Gets the runs of vector y<\/code>.<\/li>\n
  3. Cleans the runs’ values to the empty string \"\"<\/code> if the runs’ lengths are less than N<\/code>.<\/li>\n
  4. Reverses the run-length encoding.<\/li>\n
  5. Pastes this vector of prefixes with the input vector x<\/code>.<\/li>\n<\/ol>\n

    Then function append_all<\/code> calls this function on every column of the input data frame.<\/p>\n

    append_one <- function(x, N, pref = \"D\"){\n  y <- rep(pref, length(x))\n  is.na(y) <- is.na(x)\n  r <- rle(y)\n  r$values[r$lengths < N] <- \"\"\n  y <- inverse.rle(r)\n  paste0(y, x)\n}\n\nappend_all <- function(X, n, pref = \"D\"){\n  Y <- X\n  Y [] <- lapply(Y, append_one, N = n, pref = pref)\n  Y\n}\n\nN1 <- 3\nappend_all(df1, N1)\n<\/code><\/pre>\n
    Data.<\/strong>  <\/p>\n
    Original data set, posted in the question.<\/p>\n
    df <- data.frame(c(1,NA,1,1,1),\n                  c(2,2,NA,NA,NA),\n                  c(3,3,3,3,NA),\n                  c(4,4,4,4,4),\n                  c(5,NA,5,NA,5))\n<\/code><\/pre>\n
    New data set and corresponding output, posted in a comment.<\/p>\n
    df1 <- data.frame(c(1.0,NA,1.1,1.2,1.3),\n                  c(2.0,2.1,NA,NA,NA),\n                  c(3.0,3.1,3.2,3.3,NA),\n                  c(4.0,4.1,4.2,4.3,4.4),\n                  c(5.0,NA,5.1,NA,5.2))\n\ndf2 <- data.frame(c(1.0,NA,'D1.1','D1.2','D1.3'),\n                  c(2.0,2.1,NA,NA,NA),\n                  c('D3.0','D3.1','D3.2','D3.3',NA),\n                  c('D4.0','D4.1','D4.2','D4.3','D4.4'),\n                  c(5.0,NA,5.1,NA,5.2))\n<\/code><\/pre>\n<\/p><\/div>\n
    <\/div>\n<\/div>\n
                4<\/span> <\/p><\/div>\n<\/div>\n
    [ad_2]<\/p>\n
    solved Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset? <\/p>\n","protected":false},"excerpt":{"rendered":"
    [ad_1] The following code does what the question asks for. The function that does all the work is append_one. It Creates a vector Y repeating the prefix length(x) times. Gets the runs of vector y. Cleans the runs’ values to the empty string “” if the runs’ lengths are less than N. Reverses the run-length … Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[321],"class_list":["post-16780","post","type-post","status-publish","format-standard","hentry","category-solved","tag-r"],"yoast_head":"\n[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset? - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset? - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] The following code does what the question asks for. The function that does all the work is append_one. It Creates a vector Y repeating the prefix length(x) times. Gets the runs of vector y. Cleans the runs’ values to the empty string "" if the runs’ lengths are less than N. Reverses the run-length ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-10-21T22:25:32+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset?\",\"datePublished\":\"2022-10-21T22:25:32+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/\"},\"wordCount\":145,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"r\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/\",\"name\":\"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset? - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2022-10-21T22:25:32+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset?\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset? - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset? - JassWeb","og_description":"[ad_1] The following code does what the question asks for. The function that does all the work is append_one. It Creates a vector Y repeating the prefix length(x) times. Gets the runs of vector y. Cleans the runs’ values to the empty string \"\" if the runs’ lengths are less than N. Reverses the run-length ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/","og_site_name":"JassWeb","article_published_time":"2022-10-21T22:25:32+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset?","datePublished":"2022-10-21T22:25:32+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/"},"wordCount":145,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["r"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/","url":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/","name":"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset? - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-10-21T22:25:32+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-is-there-an-efficient-method-to-check-for-8-successive-elements-that-are-not-na-i-e-is-nafalse-in-each-column-of-a-large-dataset\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Is there an efficient method to check for 8 successive elements that are not NA (i.e. is.na()==FALSE) in each column of a large dataset?"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/16780","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=16780"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/16780\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=16780"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=16780"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=16780"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}