Lamers

Fuck, I can't stand this shit anymore: why you don't understand the potential of your knowledge plus this particular/unique moment of the human society (Internet age, etc.) for do something that could change the world forever. It's a shame that you are wasting your time on /prog/ instead of coding something revolutionary. Seems that you prefer to read SICP all the fucking day and fap watching all those parentheses in your screen. Fuck you: I just hope you all get raped in the ass next decade when cryptography would be a WMD, Internet used only for streaming DRM content and computers a pseudo-interactive TV.

instead of coding something revolutionary
Like what?
Protip: Terminator and Matrix are not real.

>>1
Seems that you prefer to read SICP all the fucking day and fap watching all those parentheses in your screen.
If you think you're going to write something revolutionary in something other than Lisp, then you are a javamonkey dicksucking retard.

Fuck you: I just hope you all get raped in the ass next decade when cryptography would be a WMD, Internet used only for streaming DRM content and computers a pseudo-interactive TV.
That's alright, I don't plan on living in the United States of Hysteria anyway.

>>1
English, Yannick motherfucker, do you speak it?

>>4
Wait, I'm confused. Yannick is a Lisp-hater?

Hilarious that someone thinks shitty computer programs can be ``revolutionary''. Go back to reddit.

Real scientists such as physicists and chemists (read: not code monkeys or their academic counterparts) are the ones who make revolutions.

>>5
I am confused too. I don't know how many Yannicks are hiding in this shithole.
Probably a lot!

>>6
NCSA Mosaic was a ``revolutionary'' piece of code...

Wait, who is Yannick? What's his gimmick that he earned a name?

>>10
He got a proposal from Krueger last week.

>>10
holy shit infinite pime taradoks

>>1
You're obviously oblivious to Symta, back to le /g/reddits with you.

*feels shamed*
*looks at his feet*
Ok, i'll get back to work... i wish someone would pay me ;-;

150K-point pathfinder

[code]

function [jxy,jz] = splitterRecurVx3(x)

statx = sum(x,1) ./ size(x,1);

statA = statx(2);

statB = statx(3);

statA2 = 0.75 .* sum(abs(x(:,2) .- statA)) ./ size(x,1);

statB2 = 0.75 .* sum(abs(x(:,3) .- statB)) ./ size(x,1);

statA3 = [statA - statA2, statA + statA2];

statB3 = [statB - statB2, statB + statB2];

jx(1,:) = x(:,2) < statA3(1);

jx(3,:) = x(:,2) > statA3(2);

jx(2,:) = ~jx(1,:) & ~jx(3,:);

jy(1,:) = x(:,3) < statB3(1);

jy(3,:) = x(:,3) > statB3(2);

jy(2,:) = ~jy(1,:) & ~jy(3,:);

jxy = [];

jz = [];

yVec = [3:-1:1];

for(iterjX = 1:3)

  yVec(end:-1:1) = yVec;

  for(iterjY = yVec);

    if (sum(jx(iterjX,:) & jy(iterjY,:)) > 0)

      jxy = [jxy; x( jx(iterjX,:) & jy(iterjY,:),1)];

      jz(end+1) = length(jxy);

      endif;

    endfor;

  endfor;

endfunction


function [jxy, jz, statzx] = splitterMainVx3(x, shortVal = 100)

tic

Cont = true;

curSplit = 9;

[jxy, jz] = splitterRecurVx3(x);

oldIter = 1;

iter = 2;

jz = [0, jz];

while(iter<=length(jz))

    njz = [jz(iter-1)+1 :jz(iter)];

    if(length(njz)>shortVal)

      x2 = x( jxy(njz) ,:);

      [jxy2, jz2] = splitterRecurVx3(x2);

      jzVecA = [1:iter-1];

      jzVecB = [iter:length(jz)];

      jz = [jz(jzVecA), (jz2(1:end-1) .+ jz(iter - 1)), jz(jzVecB)];

      jxy(njz) = jxy2;

      curSplit += 8;

      keepLoop = true;

      endif;
 
    if(length(njz)<=shortVal)
 
      iter++;

      endif;

    endwhile;

for(iter2 = 2:length(jz))

  x3 = x(jxy(jz(iter2-1)+1:jz(iter2)),:);

  statzx(iter2-1,:) = sum(x3,1) ./ size(x3,1);
 
  endfor;

statzx(:,1) = [1:size(statzx,1)];

size(statzx)

plot(statzx(:,2), statzx(:,3), 'g-')

statzx2 = x(jxy,2:3); %%statzx(:, 2:3);

statzx3 = sqrt(sum((statzx2(1:end-1,:) .- statzx2(2:end,:)).^2,2));

avgD = sum(statzx3) / size(statzx3,1);

outlieX = size(statzx3(statzx3 > avgD * 3));

statzx4 = statzx3(statzx3 > avgD * 3);

fprintf("\n Dist = %8i, average = %8i\n", sum(statzx3), avgD);

fprintf("\n Large = %8i\n", outlieX);

t = toc

endfunction

150K-point pathfinder (argh try again)



function [jxy,jz] = splitterRecurVx3(x)
statx = sum(x,1) ./ size(x,1);
statA = statx(2);
statB = statx(3);
statA2 = 0.75 .* sum(abs(x(:,2) .- statA)) ./ size(x,1);
statB2 = 0.75 .* sum(abs(x(:,3) .- statB)) ./ size(x,1);
statA3 = [statA - statA2, statA + statA2];
statB3 = [statB - statB2, statB + statB2];
jx(1,:) = x(:,2) < statA3(1);
jx(3,:) = x(:,2) > statA3(2);
jx(2,:) = ~jx(1,:) & ~jx(3,:);
jy(1,:) = x(:,3) < statB3(1);
jy(3,:) = x(:,3) > statB3(2);
jy(2,:) = ~jy(1,:) & ~jy(3,:);
jxy = [];
jz = [];
yVec = [3:-1:1];
for(iterjX = 1:3)
  yVec(end:-1:1) = yVec;
  for(iterjY = yVec);
    if (sum(jx(iterjX,:) & jy(iterjY,:)) > 0)
      jxy = [jxy; x( jx(iterjX,:) & jy(iterjY,:),1)];
      jz(end+1) = length(jxy);
      endif;
    endfor;
  endfor;
endfunction

function [jxy, jz, statzx] = splitterMainVx3(x, shortVal = 100)
tic
Cont = true;
curSplit = 9;
[jxy, jz] = splitterRecurVx3(x);
oldIter = 1;
iter = 2;
jz = [0, jz];
while(iter<=length(jz))
    njz = [jz(iter-1)+1 :jz(iter)];
    if(length(njz)>shortVal)
      x2 = x( jxy(njz) ,:);
      [jxy2, jz2] = splitterRecurVx3(x2);
      jzVecA = [1:iter-1];
      jzVecB = [iter:length(jz)];
      jz = [jz(jzVecA), (jz2(1:end-1) .+ jz(iter - 1)), jz(jzVecB)];
      jxy(njz) = jxy2;
      curSplit += 8;
      keepLoop = true;
      endif;
    if(length(njz)<=shortVal)
      iter++;
      endif;
    endwhile;
for(iter2 = 2:length(jz))
  x3 = x(jxy(jz(iter2-1)+1:jz(iter2)),:);
  statzx(iter2-1,:) = sum(x3,1) ./ size(x3,1);
  endfor;
statzx(:,1) = [1:size(statzx,1)];
size(statzx)
plot(statzx(:,2), statzx(:,3), 'g-')
statzx2 = x(jxy,2:3); %%statzx(:, 2:3);
statzx3 = sqrt(sum((statzx2(1:end-1,:) .- statzx2(2:end,:)).^2,2));
avgD = sum(statzx3) / size(statzx3,1);
outlieX = size(statzx3(statzx3 > avgD * 3));
statzx4 = statzx3(statzx3 > avgD * 3);
fprintf("\n Dist = %8i, average = %8i\n", sum(statzx3), avgD);
fprintf("\n Large = %8i\n", outlieX);
t = toc
endfunction

Plus a simple optimizer

function xGroup = optimizeLinkVx(xGroup, leapVal)
lookahead = leapVal;
leapVecA = [0,1,leapVal-2, leapVal-1];
leapVecB = [1:leapVal-2];
leapVecC = leapVecB(end:-1:1);
optend = size(xGroup,1) - lookahead
optim = 0;
for(iter= 1:optend)
  digS = getDistances( xGroup(leapVecA .+ iter, :) );
  if((digS(1,2) + digS(3,4)) > (digS(1,3) + digS(2,4)))
    xGroup(leapVecB .+ iter,:) = xGroup(leapVecC .+ iter,:);
    optim++;
    endif;
  endfor;
optim
endfunction;

ah lol almost complete... missing this little bit

function x3 = getDistances(x)
x1 = x(:,2);
x2 = x(:,3);
xVec(1:length(x2)) = 1;
x1 = x1(:, xVec);
x2 = x2(:, xVec);
x3 = sqrt((x1 .- x1').^2 .+ (x2 .- x2').^2);
endfunction;

any Improvements?

>>9
He is just another faggot who was flamboyant enough to get a name.