| sudo su | |
| echo "core.%e.%p.%h.%t" > /proc/sys/kernel/core_pattern | |
| ulimit -c unlimited |
| // http://nikhilm.github.io/uvbook/threads.html | |
| #include <string> | |
| #include <map> | |
| #include <node.h> | |
| #include <v8.h> | |
| #include <uv.h> | |
| #include <sys/syscall.h> | |
| #include <stdlib.h> |
| import random ## to generate the items | |
| from pulp import * ## import pulp-or functions | |
| class MasterProblem: | |
| def __init__(self, maxValue, itemLengths, itemDemands, initialPatterns, problemname): | |
| self.maxValue=maxValue | |
| self.itemLengths=itemLengths |
If you are familiar with Java's generics, and are coming to Rust, you might be lead to assume that its generics are working the same way.
However, due to the different type systems, and different implementation details, there are quite a few differences between generic code in both languages.
This document tries to give a short summary about those differences:
| /* | |
| Implementation by Groxx, with absolutely no guarantees, so don't complain to me if it breaks stuff. | |
| Feel free to use it for awesome, as needed. Apply liberally, and induce vomiting if you ingest large doses. | |
| Note from #0d15eb: BREAKING CHANGE FROM #1d1057: this is now a generic storage, storing pointers to data. Manage your memory accordingly. | |
| Note: now stores the "next" pointer prior to processing, allowing you to process and pop the first item in the list in one pass without losing your place in the queue (and possibly other shenanigans, this one was just handy for my uses so I changed it). | |
| */ | |
| typedef void * queue_data_type; | |
| struct queue_item { | |
| queue_data_type contents; |
