Sign Up
EU Cyber Resilience Act (CRA) — First Deadline September 2026
If you sell LabVIEW-based software and systems in the EU, please be aware that new CRA regulations may require you to implement security vulnerability reporting starting September 11, 2026. The VIPM Team has prepared guides to help you understand how this applies to your software applications and published packages, since it's important you understand these regulatory requirements (click the Learn More link to read these guides). Thank you for your help in keeping security front-and-center within the LabVIEW community.
Learn more

Advanced Structures by G Open Source Project for LabVIEW - Toolkit for LabVIEW Download

Advanced Structures

D Discussion Watch * 1 ↓7,783
 screenshot
Version1.0.0.1
ReleasedJan 14, 2024
Publisher G Open Source Project for LabVIEW
License 0-BSD
LabVIEW VersionLabVIEW>=13.0
Operating System Windows, Mac, and Linux
Dependencies labview_open_source_project_lib_labview_open_source_palette  
Used By labview_open_source_project_lib_mqtt_connection   labview_open_source_project_lib_mqtt_broker  
Project links Repository   Discussion

Description

Circular Buffer including Queues (FIFO) and Stacks (FILO)
- Support for Queue or Stack from the same base class
- Restrict overflow or not
- O(1) operations for insertions (queue/push) and removal (dequeue/pop)
- Preview any element at index, or all
- Insert elements directly from an array in near O(1) time (no for loop)

Base class consists of a Variant Circular Buffer (LabVIEW 2013 and up, no malleables, no interfaces)

- ByteFIFO is strictly-typed to support byte streams in Queue configuration
- Circular Buffer (Object) is strictly-typed to support LabVIEW object type
- Circular BufferMap is a ByRef dictionary of named buffers (for factory-style designs)
- Esily extensible to any strict type by creating a facade (no malleables)

Release Notes

1.0.0.1 (Jan 14, 2024)

Circular Buffer including Queues (FIFO) and Stacks (FILO)
- Support for Queue or Stack from the same base class
- Restrict overflow or not
- O(1) operations for insertions (queue/push) and removal (dequeue/pop)
- Preview any element at index, or all
- Insert elements directly from an array in near O(1) time (no for loop)

francois-normandin was a contributor to this release


Download Package

Versions
All Contributors

  Post an Idea   Post a Resource

Recent Posts

Forum Posts

Kamakshi Money Loan CUSTOMER CARE HELPLINE NUMBER (91)∆O❼❾⓿❹❾❻❹❺❻❷///7904964562@)\x{Call Now
Kamakshi Money Loan CUSTOMER CARE HELPLINE NUMBER (91)∆O❼❾⓿❹❾❻❹❺❻❷///7904964562@)\x{Call NowKamak…