Skip to content

Conversation

@gentlegiantJGC
Copy link

@gentlegiantJGC gentlegiantJGC commented Dec 30, 2021

The improved execution code is much more robust than the Harvard execution code.
It finds the contents of the column based on the column name (the old code ignored the column names and assumed the colums were in a specific order.
It will populate any missing columns with default values (the old code would error)
It adds support for an optional FRAME_TIME column which allows users to customise how long a frame remains for. If undefined it runs the frames as quickly as the hardware is able to.

Added documentation for the animation file format.
Also added a .gitignore

I tried submitting this code to the Harvard repository but they are no longer maintaining the repository.

Discussion for this code can be found in
GSD6338/XmasTree#2
and
GSD6338/XmasTree#4

This should also fix #9

gentlegiantJGC added a commit to gentlegiantJGC/xmastree2021 that referenced this pull request Jan 6, 2022
Added my sequences.
I wrote these using python so I have added the source python files as well as the baked CSV files. I wrote a version of the neopixel library that can be run without the tree. It visualises the tree using matplotlib and has the option to generate the CSV file from the inputs it was given.
It also adds the baked CSV files for Matt's tree.
Some of these are designed to run at slower frame rates so require standupmaths#30
@gentlegiantJGC
Copy link
Author

@oliverdunk did you get a chance to look over this?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Any information on the animation speed?

1 participant