This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include "pqueue.hpp" | |
int main() { | |
PriorityQueue<int*> q{}; | |
for (int i=0; i < 12; i++) { | |
std::printf("%d, first\n", i); | |
q.push(i, new int{i}); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <vector> | |
#include <benchmark/benchmark.h> | |
#include "squeue.hpp" | |
#define COUNT_I 1000 | |
#define COUNT_J 10 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from pwn import * | |
context.arch = 'amd64' | |
context.os = 'linux' | |
def exploit(p, libc, pop_rdi_offset, xor_rax_offset, local): | |
p.recv() | |
# pop_rdi_offset = ROP(libc).find_gadget(['pop rdi', 'ret']) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#ifndef GVIZARD_GRAPH_GRAPH_HPP_ | |
#define GVIZARD_GRAPH_GRAPH_HPP_ | |
#include <cstddef> | |
#include <optional> | |
#include <type_traits> | |
#include <variant> | |
#include "gvizard/registry/attrset.hpp" | |
#include "gvizard/registry/attrset_registry.hpp" |