February 28, 2020, 08:49 (GMT) |
handle multiple operator sockets more correctly |
February 28, 2020, 08:34 (GMT) |
make node rebuilding function more reusable |
February 28, 2020, 08:11 (GMT) |
Merge branch 'functions' into simulation-tree |
Revision 4ed7334 by Jacques Lucke (builtin-simulation-nodes, functions, particle-solver-dev, simulation-tree) February 28, 2020, 08:01 (GMT) |
Merge branch 'master' into functions |
February 25, 2020, 17:35 (GMT) |
write node storage to file and read back Have to find a better way to do this. An issue is that `node->typeinfo` when the node is just read. |
February 25, 2020, 17:01 (GMT) |
initial operator socket callback |
February 25, 2020, 16:30 (GMT) |
run node declaration function only once per update |
February 25, 2020, 15:15 (GMT) |
simplify SocketDecl |
February 25, 2020, 13:46 (GMT) |
new operator socket |
February 25, 2020, 13:34 (GMT) |
first node with a variable number of sockets |
February 25, 2020, 12:08 (GMT) |
keep socket values after node rebuild |
February 25, 2020, 12:07 (GMT) |
implicitely convert rgba_f to const float * |
February 25, 2020, 11:41 (GMT) |
remove invalid links and maintain links after rebuild |
February 25, 2020, 11:40 (GMT) |
access node identifier |
February 25, 2020, 10:23 (GMT) |
automatically remove links between incompatible links |
February 25, 2020, 10:22 (GMT) |
store incident links in virtual node tree |
February 25, 2020, 08:58 (GMT) |
Merge branch 'functions' into simulation-tree |
February 25, 2020, 08:58 (GMT) |
Merge branch 'master' into functions |
Revision b92b1a4 by Jacques Lucke (builtin-simulation-nodes, functions, particle-solver-dev, simulation-tree) February 23, 2020, 16:37 (GMT) |
Use new LinearAllocatedVector in various places |
Revision 096856a by Jacques Lucke (builtin-simulation-nodes, functions, particle-solver-dev, simulation-tree) February 23, 2020, 16:35 (GMT) |
new LinearAllocatedVector<T> This is a vector that does not own the memory its elements are stored in. Instead, a linear allocator is passed to every call to `append`, that will be used if the vector has to grow. Since a linear allocator does not support deallocation, no memory is dealloced until the linear allocator is destructed. This structure can be used when many small vectors of initially unknown size are required. |
|