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
❯ docker build -t buckaroo . | |
Sending build context to Docker daemon 35.84kB | |
Step 1/16 : FROM base/archlinux | |
---> 40aec536e4af | |
Step 2/16 : RUN echo -e "\nen_US.UTF-8 UTF-8" >> /etc/locale.gen | |
---> Running in b2a896a63ef0 | |
---> 56ada7eefd40 | |
Step 3/16 : RUN locale-gen | |
---> Running in 0ed299fb13e4 | |
Generating locales... |
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 <omp.h> | |
#include <assert.h> | |
#include <stdio.h> | |
void sum(){ | |
int x,y; | |
x = y = 10000; | |
int** A = new int*[x]; | |
for(int i = 0; i < x; ++i) | |
A[i] = new int[y]; |
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 <omp.h> | |
#include <assert.h> | |
#include <stdio.h> | |
void sum(){ | |
int x,y; | |
x = y = 10000; | |
int** A = new int*[x]; | |
for(int i = 0; i < x; ++i) | |
A[i] = new int[y]; |
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 <stdio.h> | |
#include <time.h> | |
#include <omp.h> | |
long long num_steps = 100000000; | |
double step, table[40]; | |
int main(int argc, char* argv[]) | |
{ | |
clock_t start, stop; |
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 <omp.h> | |
#include <iostream> | |
void sum(){ | |
int x,y; | |
int i,j,k; | |
long long table[40]; //8 bitów | |
x = 10000; | |
y = 10000; | |
int** A = new int*[x]; | |
for(i = 0; i < x; ++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 <omp.h> | |
#include <iostream> | |
void sum(){ | |
int x,y; | |
int i,j,k; | |
/* | |
Ta tablica w pamięci wygląda tak, zakładając linię pamięci 64 bajtów | |
linia 1: 8B 8B 8B 8B 8B 8B 8B 8B | |
linia 2: 8B 8B 8B 8B 8B 8B 8B 8B | |
linia 3: 8B 8B 8B 8B 8B 8B 8B 8B |
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
opt/dotnet/dotnet /home/adrian/Projects/sandbox/indexer/bin/Debug/netcoreapp2.0/indexer.dll | |
Line count: 10487067 | |
Line number: 5 | |
-(tYX | |
Linear time(ms): 0 | |
-(tYX | |
Lookup time(ms): 1 | |
Line number: 500 |