{"id":16572770,"url":"https://github.com/lemire/runningmaxmin","last_synced_at":"2025-03-21T12:31:16.274Z","repository":{"id":14323202,"uuid":"17032463","full_name":"lemire/runningmaxmin","owner":"lemire","description":"Fast maximum-minimum filters implemented in C++","archived":false,"fork":false,"pushed_at":"2023-02-10T00:01:24.000Z","size":39,"stargazers_count":44,"open_issues_count":1,"forks_count":11,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-18T01:11:24.068Z","etag":null,"topics":["algorithms","maximum","minimum"],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lemire.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2014-02-20T19:20:27.000Z","updated_at":"2024-09-07T16:51:57.000Z","dependencies_parsed_at":"2024-10-28T10:24:21.242Z","dependency_job_id":"030fb1d4-86b0-4d24-a5dc-f47fb7baa74a","html_url":"https://github.com/lemire/runningmaxmin","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemire%2Frunningmaxmin","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemire%2Frunningmaxmin/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemire%2Frunningmaxmin/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemire%2Frunningmaxmin/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lemire","download_url":"https://codeload.github.com/lemire/runningmaxmin/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244799325,"owners_count":20512234,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","maximum","minimum"],"created_at":"2024-10-11T21:28:32.629Z","updated_at":"2025-03-21T12:31:15.968Z","avatar_url":"https://github.com/lemire.png","language":"C++","readme":"Fast running maximum-minimum filters implemented in C++.\r\n========================================================== \r\n[![Build Status](https://travis-ci.org/lemire/runningmaxmin.png)](https://travis-ci.org/lemire/runningmaxmin)\r\n\r\nThis code implements the algorithms described in the following paper:\r\n\r\nDaniel Lemire, [Streaming Maximum-Minimum Filter Using No More than \r\nThree Comparisons per Element](http://arxiv.org/abs/cs.DS/0610046). Nordic Journal of Computing, 13 (4), pages 328-339, 2006. \r\n\r\nContributors: Daniel Lemire, Kai Wolf\r\n\r\nThe main algorithm presented in this package is used in [Apache Hive](https://github.com/apache/hive).\r\n\r\nUsage\r\n----- \r\n\r\nTo reproduce the numbers from the paper, do the following:\r\n\r\n```\r\n  make\r\n  \r\n  ./unit\r\n  \r\n  ./runningmaxmin --sine 1000000 10000 --windowrange 4 100  --times 1\r\n  \r\n  ./runningmaxmin --white 1000000 --windowrange 4 100  --times 1\r\n```\r\n\r\nSuitability \r\n------------\r\n\r\nThe new algorithm introduced in the manuscript is most suitable for piecewise monotonic\r\ndata or when low-latency is required. Otherwise, Gil-Kimmel and van Herk\r\nare good choices.\r\n\r\nSee also\r\n---------\r\n\r\n- Julia version: streaming maximum-minimum filter implementation in Julia  https://github.com/sairus7/MaxMinFilters.jl  \r\n- For a Python version, see https://github.com/lemire/pythonmaxmin\r\n- For an application of this idea to rolling statistics in JavaScript, see https://github.com/shimondoodkin/efficient-rolling-stats\r\n- For an application in Go, please see  https://github.com/notnot/movingminmax\r\n- Another C++ library: STL Monotonic Wedge https://github.com/EvanBalster/STL_mono_wedge\r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flemire%2Frunningmaxmin","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flemire%2Frunningmaxmin","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flemire%2Frunningmaxmin/lists"}