The 2nd Monitor

Mat's Mug

20:00

on hold

Captain Obvious

0

Q: Optimize matlab for loop

I have a large matrix and i want to do an exhaustive recherche, but the look took a lot of time. I can't figure out how to optimise it? for k=4963:0.00001:4031 for T=100:0.00001:5000 for phi=0:0.00001:2*pi for IB=1:nb_bloc_total n...

0

Q: Using promises to read an variable length array of npm modules

I'm reading an array (of unknown length) of modules package.json files in order to extract the "style" property and store it in an array of its own: var gulp = require('gulp') , path = require('path') , Promise = require('bluebird') , fs = Promise.promisifyAll(require('fs-extra')); let c...

javascript design-patterns node.js ecmascript-6 promise

0

Q: Joint excel/word reporting macro

I have a functional macro that draws information laid out in a spreadsheet, feeds it into a bookmarked word document, and then prints it out. The versions are excel 2010 and word 2010. The spreadsheet looks like this: Basically laid out in the above manner. The following code which is pointe...

vba excel ms-word

0

Q: Is this a good example of the revealing module pattern when using jQuery?

Recently I have been getting into the habit of leveraging the revealing module pattern for all my code \0/. Think the days of writing spaghetti, code are behind me! I used this guide for inspiration but it feels much more elegant. var styleGuide = (function styleGuideHandler() { 'use s...

javascript jquery revealing-module-pattern

skiwi

    @Override
    public OptimizeStrategyResult processNode(final ASTNode node, final boolean isLastNode) {
        Expression expression = node.getExpression();

        if (!(expression instanceof MemoryLoopExpression)) {
            return OptimizeStrategyResult.notAccepted();
        }
        else {
            try {
                return OptimizeStrategyResult.finished(createNewNodes(node));
            } catch (UnsupportedOperationException ex) {
                return OptimizeStrategyResult.notAccepted();

totally-not-a-hack pls-trust

2

Horribly failed while trying to optimize the loop? Just pretend we cannot optimize it!

I should've made a test that checked the output AST of an optimized hello world or something... Now I've got no clue whether it optimized everything

I may have a tab open for it

Duga

20:23

@JustinTime Thanks :) I deleted the question because it was more a code review for coding style (but code review closed the topic to anyway). — Mathieu Van Nevel 18 secs ago

skiwi

in Cardshifter and other projects, 34 secs ago, by Duga

[skiwi2/BrainfuckCompiler] skiwi2 pushed commit de255ba3 to master

in Cardshifter and other projects, 37 secs ago, by Duga

Refactored the IntermediateCodeOptimizer class to now allow for different optimization strategies instead of them being hardcoded.

Note: There is still an issue with the order of the optimizers, for example: MemoryValueChange and MemoryPointerChange optimizers are not run when a MemoryLoop is being optimized.

It's biiig and I like it

Mat's Mug

size-matters

Phrancis

Monkernoon

skiwi

Monkermonk

Hosch250

Noon? It is already 2:30 here.

Incomputable

20:41

@Hosch250, do you live in middle Asia?

Hosch250

@Incomputable Middle Asia?

No, I live in middle North America.

Opposite side of the world.

Incomputable

@Hosch250 it's 2:45 am in my city

Hosch250

It's 2:45 pm in my city.

Incomputable

@Hosch250 that's somewhat funny

Phrancis

It's close to 16h here so it's ~~afternoon~~ monkernoon =)

Hosch250

20:48

I have a whole page written on security in Exchange 2013.

I suppose I can just say etc.

Well, I can't exactly leave out auditing and IRM.

OK, two more paragraphs.

And then I need to write another page or so on compliance.

skiwi

It's 9.50pm here :D

Hosch250

And then I need to write about two paragraphs on clients and another two on deployment/migration.

And another two on project specs.

Incomputable

@skiwi is it 8th or 7th December in your city?

Hosch250

8th or 7th?

Oh, I see.

skiwi

7 December

Hosch250

20:51

?

We have three days going on at once?

skiwi

Whoops, typo

I'm trying to read my old pastebin.com/XEC1aAtU NN output, planning to make a new one tomorrow

Incomputable

@Hosch250 that would really be strange

Hosch250

Aw, I misread the Populist badge. Heslacher is still one vote away because it needs to have >2x.

Incomputable

how many bytes you would put as minimum for user space memory block if the header itself is 24 bytes? I've left another 24 bytes

Hosch250

Could someone oblige me? codereview.stackexchange.com/a/113576/34073

Phrancis

20:54

@Hosch250 the furthest apart two time zones can be is 12 hours, so it's not possible to have 3 different days going on at once

Hosch250

@Phrancis I know that much.

I was asking skiwi that.

Phrancis

Oh sry

Hosch250

I'm being an altruistic benefactor by getting votes on that post.

200_success

@Phrancis Not true.

UTC+14:00

UTC+14:00 is an identifier for a +14 hour time offset from UTC. This is the highest time zone, meaning that areas in this zone are the first to see a new day, and therefore the first to celebrate a New Year. UTC+14 stretches as far as 30° east of the 180° longitude line and creates a large fold in the International Date Line. == As standard time (all year round) == === Oceania === Kiribati Line Islands - including Kiritimati (Christmas Island) The IANA time zone database zone identifier is Pacific/Kiritimati. == As daylight saving time (Southern Hemisphere summer) == === Oceania ===...

Mat's Mug

@Phrancis depends on your definition of "days" and what your time zones are. if you're on Venus, 1 day is 116 Earth days and 18 hours, so it's technically possible to have 3 different days going on at once. you need to be more specific. "on Earth".

oh dear, I'm wrong

Hosch250

20:56

Uh, that's, um, new.

Wait, isn't +14 the same as -10?

200_success

Yes, but with a different date.

Incomputable

@Hosch250 no. Direction matters

Hosch250

Peculiar.

Duga

These kinds of questions should be posted on codereview, not SO. — Kayaman 51 secs ago

Incomputable

by the way I saw an unregistered user popping up old question to the active pane. Did anyone see him as well?

Hosch250

20:59

@Incomputable Approved edit, most likely.

Incomputable

is it possible to use desktop pc as a cloud service? My laptop is too slow to write something serious

Captain Obvious

0

Q: k means clustering algorithm

import csv import numpy as np k=2 def kmeans(data, k): clusters = [[] for i in range(k)] centroids = [] centroids = randomize_centroids(data, centroids, k) old_centroids = [[] for i in range(k)] iterations = 0 while not (has_converged(centroids, old_centroids, iteration...

python algorithm clustering

Incomputable

@CaptainObvious Jamalized

Hosch250

Oh dear, Heslacher won't get his Populist if no one upvotes him.

skiwi

@Incomputable Use a Remote Desktop session

Incomputable

21:13

@skiwi university internet has high ping, so I guess it will be less comfortable experience that it was before :P

so bad that there is no supercomputer to which we can just connect and draw horsepower. Having a subscription and a client machine would be much better than carrying laptop

Hosch250

Nice :)

Two populists rewarded today. That's a record.

Although, it has been rewarded twice in July 15 in two separate years.

That's one thing we can't have three of at the same time.

Mat's Mug

IIRC only one populist badge wasn't helped with chat-votes

Hosch250

Out of all 20?

I'm nowhere near that one.

Mat's Mug

hmm maybe not. I guess my data is outdated :)

Hosch250

BTW, can someone describe Tenacious to me? I just don't understand the rules for that one.

Mat's Mug

21:24

wow, we got 20 of those awarded?!

Hosch250

Just 3 tenacious.

And 1 unsung.

Mat's Mug

[badge:tenacious] is [very] poor man's [badge:unsung-hero]. i.e. not sure we'll see many of those around here.

Duga

Tell it to the judge ;-) You need to use Code Review for this codereview.stackexchange.com — Kitson88 55 secs ago

Hosch250

20 Populists.

@Mat'sMug I know. I just want to know the rules.

Dex' ter

Quick question for infosec guys from here: let's suppose we have four strings and they're somehow related (but we don't know how). Is there a way of finding the algorithm that was used to get 'em ? ^^

Mat's Mug

21:25

it's what the description says..

EBrown

One of the people from my work was found deceased in their home today. Sad day.

Mat's Mug

@EBrown ouch

my sympathies

Hosch250

The description is contradictory.

EBrown

He was a cool guy, old as snot but cool.

Hosch250

It says "0 score accepted answers", which means 0.

Mat's Mug

21:26

make that 0-score answers with a checkmark

Hosch250

Then it says more than five answers posted and less than 20% of posted answers.

EBrown

@Mat'sMug Thanks.

Hosch250

So, 0 answers with a checkmark.

EBrown

Anyway, everyone have a nice day.

Hosch250

So, anyone with five answers and none accepted?

Oh, no.

0 score means unvoted.

Mat's Mug

21:27

if you posted 100 answers, and have less than 20 with a checkmark and 0 score, you get the badge

minimum 5 answers posted

Hosch250

So, 5 unvoted, accepted answers, and 25 posted?

Mat's Mug

"less than 20%" might be misleading

I suspect it's actually "less than or equal to"

Hosch250

> Zero score accepted answers: more than 5 and 20% of total

That is equal.

Mat's Mug

ah

so you must have more than 5 answers with a checkmark and +0 score, and these 5 answers must be at least 20% of your total number of answers

Hosch250

2 mins ago, by Hosch250

So, anyone with five answers and none accepted?

Mat's Mug

21:29

whatever. you're not getting it anytime soon

Hosch250

Nope.

I'm not sure I want it.

If I get it, I might as well quit the site.

Mat's Mug

you want it as much as a tumbleweed

Hosch250

I think it would be hard to get it even with multiple accounts.

At this stage in the site, anyway.

Mat's Mug

depends

I earned [badge:tenacious] on SO a while back

Hosch250

SO doesn't vote.

Mat's Mug

21:34

lurk in tags nobody looks at

Hosch250

And if they do, they vote down.

Mat's Mug

or to close

Hosch250

@Mat'sMug Like Clojure? That would be the surest way to not get it because they are such old zombies.

Mat's Mug

IDK.. IMO you're right, it's near-impossible to get it on CR.

Hosch250

Last two were rewarded in '13. That ought to tell you something.

SO has 6 Unsung rewarded in the last 24 hours.

And 13 Tenacious.

Captain Obvious

21:39

1

Q: From a string of 3 numbers to 3 integers

I solve some puzzles to learn Rust. A problematic I faced is to turn a string of 3 integers into 3 integers. I succeeded with the following example: fn main() { let mut it = " 455 123 42 ".split_whitespace(); let (a, b, c) = match (it.next(), it.next(), it.next()) { (Some(...

beginner parsing integer rust

-1

Q: Pregenerated sample code

I am generating sample code to go along with the Google .NET client library. I would appropriate some feedback on the code that my application has generated. I will be releasing the sample code on Github once it's stable. Ideally, this code should be best practice type of thing. A lot of what is ...

c#

Duga

This is not a regular question, it is a press release. codereview is not a good place for it either. If the only question you really have is "What should I improve" and you've only added it "To make this a question", it's going to be too broad for any StackExchange site. — Don't Panic 37 secs ago

Mat's Mug

@Hosch250 and >10,000,000 questions

Jeroen Vannevel

kitchensoap.com/2012/10/25/on-being-a-senior-engineer

2

must read

all of you

Phrancis

@200_success I stand corrected, merci =)

Duga

I suppose @Don'tPanic is right. Dumping your code on Code Review would most likely have the same response as SO. For CodeReview, you could technically ask users to look at various elements of your code if you feel it could be improved. But as for marketing your Framework, I'm afraid this would need to be done elsewhere. — Kitson88 32 secs ago

Captain Obvious

21:50

0

Q: Determine if a string is permutation of another string

I've made a short program to determine if a string is permutation of another string private static void Main() { string a = Console.ReadLine(); string b = Console.ReadLine(); Console.WriteLine(IsPermutation(a, b)); Console.ReadKey(); ...

c# performance strings

0

Q: Loop combinations of byte for poker simulator

This is going to need some explanation. In (this) poker you have 2 hole cards and they are combined with 5 shared cards on the board. Each player makes the best 5 card hand from the seven. Believe it or not that is over 2 billion runs to do them all. Trying to create statistics for 2 known h...

c# .net iteration

Incomputable

going to try emacs. Rip clion

Dex' ter

@Incomputable does clion have a community edition ?

Incomputable

@Dex'ter, yes. I strongly recommend forgetting about it and never recalling back

Hosch250

Just got my 57th C# answer in. 23 answers and 69 votes away from a silver badge.

Incomputable

even Microsoft Visual Studio is much better

Dex' ter

22:00

gcc and g++ is all I need

^^

skiwi

@JeroenVannevel But I'm not even a junior yet

Incomputable

@Dex'ter I've thought that way as well, but you encounter CLion you will change your mind

Jeroen Vannevel

@skiwi me neither

Incomputable

@JeroenVannevel I don't have a degree yet

Hosch250

@skiwi I think I'm the "competent" level, and I've never held a position.

@Incomputable Me either, but I'll get mine next May.

Jeroen Vannevel

22:01

technically I'm grad but my boss is pitching me as the future teamlead of the future platform team

which he and I will set up in a few months

Hosch250

Nice.

Incomputable

@Hosch250 I have 7 more semesters to go

Hosch250

It'll come :)

skiwi

@JeroenVannevel Wow that's very nice

Dex' ter

@Incomputable I don't get it. First you said to forget about CLion and then you said: but you encounter CLion you will change your mind

skiwi

22:02

I'm hoping to get closer to securing my first job tomorrow :0

Hosch250

BTW, @JeroenVannevel, what's a "novice" who doesn't follow any rules because they don't know there are any to be followed?

Jeroen Vannevel

I interpret that as a person who just has never coded or only at a very basic level

Incomputable

@Dex'ter, I meant the message when you said you need only gcc and g++

without automatized build system compiling anything is hell

Jeroen Vannevel

@skiwi yeah it is. I've been working my ass off though -- shitload of tools written, people mentored and other activities on top of my day-to-day tasks

Dex' ter

so, I should use CLion ?

Jeroen Vannevel

22:05

Singlehandedly wrote the entire telemetry platform which the entire company will now start relying on for monitoring of all our apps

Incomputable

@Dex'ter no

Jeroen Vannevel

stuff like that gets you noticed

Dex' ter

@Incomputable That's the answer I was looking for ^^

Peilonrayz

@Dex'ter I used it, I liked it. I liked it more than PyCharm for sure

Incomputable

@Peilonrayz it gets useless when you'll start using some metaprogramming, complicated boost stuff aside

skiwi

22:06

@JeroenVannevel I'd hope so ;)

Dex' ter

@Peilonrayz hmm did you also start looking into C/C++ ? Niiiceee, I feel dumber now

Peilonrayz

@Incomputable And those are just words to me, ;P

@Dex'ter Yeah, I still need to pick it up, but I have 2 linked list questions, :P I'm in no way good at them

Incomputable

@Dex'ter use it if you have no idea about C++. If you want something more serious, you will need to get to the dark side

Hosch250

@Peilonrayz Hey, you have me beat. I don't have any linked list questions.

Dex' ter

@Incomputable Let's say I've got the basic stuff covered. I'll just have to dig into the OOP world of C++

Peilonrayz

22:08

@Hosch250 They're quite cool, kinda like binary trees, but without the binary, XD

Incomputable

@Dex'ter OOP is the smallest part of the C++

Hosch250

I know what they are, but I've never written one.

Peilonrayz

Ah sorry, ):

Incomputable

I think that linked list is a step back. Contiguous containers are much better: easier to write, easier to understand, easier for compilers/CPU to optimize. And linked list is like none of those

Dex' ter

@Hosch250 Linked lists were just a pretext for teachers to give us more meaningless homeworks

skiwi

22:12

Linked lists are very useful for O(n)-performance

Incomputable

linked list is stuck between being a tree and being a container, and ended up being nothing

Vogel612

it's a pretty good queue with unlimited size...

Incomputable

@skiwi if the measurements say so, why not. But the thing is that when using, for example std::vector, it will take the same time to write

and it happens to be faster most of the time due to fragmentation

skiwi

@Incomputable Huh?

Incomputable

@skiwi I never consider algorithmic complexity to be meaningful enough claim about performance of the whole system. If it is an algorithm, then probably yes

Hosch250

22:14

I like circular doubly-linked lists.

They are kind of like infinite loops.

The OP seems to disagree with this: codereview.stackexchange.com/a/149247/34073

Anyone want to vet my answer?

skiwi

@Incomputable Your whole system consists of algorithms

Incomputable

@skiwi asymptotic complexity abstracts away modern computer, on which those algorithms are actually run

skiwi

@Incomputable No, it's always relevant

Incomputable

if you want to argue more, we can move to another room. I really want to prove that asymptotic complexity is useless after some extent

Dex' ter

but you can argue here

skiwi

22:18

But in some specific cases (where certain sizes don't hit certain thresholds), a say O(n^3) algorithms can be faster than a O(n^2 log n)

Vogel612

@skiwi that stupid big-O complexity resulted in people using LinkedList over the whole mess of that stupid Java program I was asigned to work on.

and it's horrendously slow as heck

@skiwi for large enough constant factor that's exactly the problem of big-O

Incomputable

@skiwi, it's not about algorithmic complexity at all. I'm saying about algorithms that have the same complexity but tremendous difference in performance. Big O is useless on really fast software

Hosch250

I've always heard that big-O stuff typically doesn't work like that IRL.

It really depends on the system, such as how caching works, where data is stored, etc.

Jeroen Vannevel

@Incomputable You seem to not understand Big O then

skiwi

@Vogel612 Is the LinkedList used because you need to add/remove items in the list? Yes? Probably a good design, but still debatable. No? I don't see how it would be a good decision in any case

Vogel612

22:19

@Hosch250 algorithmically it's usually a halfway acceptable measure

Hosch250

@Vogel612 Algorithmically, yes, but you have to test it before saying it is actually faster.

Vogel612

@skiwi LinkedList used for everything

even number crunching

skiwi

@Hosch250 As far as I'm aware on last year of uni there was a trend of new algorithms that take cache sizes etc. into account

Vogel612

@Hosch250 some algos can't be improved beyond a certain threshold

Hosch250

@Vogel612 Of course.

A simple iteration algorithm can't get faster than O(N).

But depending on the size of the list and how the system handles lists and the type of storage structure being used (array, list, linkedlist, whatever), things can wildly vary.

Incomputable

22:22

@JeroenVannevel I don't think you have encountered such situations then. Try to watch this, and you'll understand what I'm talking about

I'm not claiming that you should write assembly. Just write more CPU friendly code

@Hosch250 actually linear search can get faster sometimes, but slower in others.

Jeroen Vannevel

Your code can be as CPU friendly as you want, you won't cut it with an O(n^3) algorithm

skiwi

@Incomputable That's exactly the worst idea you could possibly argue for, you first need to choose the fastest algorithmic way, and then only when you get performance issues or spot critical sections that can be optimized a lot then you start to look at the actual runtime

Incomputable

@JeroenVannevel I'm not saying big O is entirely useless. It is useless after some extent

Jeroen Vannevel

what extent?

Can you back any of this up with actual specifics?

Incomputable

@JeroenVannevel, measured extent

Jeroen Vannevel

22:25

This is what I mean

Incomputable

@JeroenVannevel, what specifics you want?

Jeroen Vannevel

You're spewing bullshit fancy terms

Incomputable

ok man, if you don't want to listen, don't

Jeroen Vannevel

You're not saying anything, there's nothing to listen to

linking a 1h youtube video is not "backing up your point"

Incomputable

@JeroenVannevel, tell me what citation or reference you want then

Jeroen Vannevel

22:28

Give me an example where you had an O(n^2) or worse algorithm under heavy load (give load specifics) that was improved by introducing cache locality

Dex' ter

@Incomputable It's not about citation or reference. It's about facts. Sustainable facts

Incomputable

@JeroenVannevel I'll write it up and post it when I'll finish with it. It's going to be answer for my old unanswered matrix class. I'll ping you when I'll finish

Jeroen Vannevel

I'll tell you right now: you don't have one, because you've never been in that situation yet. Instead, you are extrapolating an entirely artificial assumption out of a talk at a conference that most likely did not intend what you thought it did

lol

your matrix class is not "heavy load"

Incomputable

ok, let it end here. I give up

Jeroen Vannevel

I've seen pages on our website drop in performance during peak moments when we have 100k requests per second coming in and investigation sometimes revealed nested loops

cache locality does not solve that

A better Big-O value does

Dex' ter

22:33

enough for today.

Jeroen Vannevel

Big-O is an indication of how well a piece of code performs when it's put under stress. The kind of optimization you refer to is a micro-optimization in comparison to a better Big-O complexity

Hosch250

22:49

Down to three sections of my paper, and the diagrams.

6 pages done, probably about 2-3 to go.

Incomputable

@JeroenVannevel, can you recommend any books on discrete mathematics? I guess that I need it for proper analysis

Vogel612

@JeroenVannevel please watch your tone a little.

sidenote: what big-O is this?

    for (int i = 0; i < samples; i += buffer.length) {
        for (int j = 0; j < 20; j++) { // generate 10 waves into buffer
            sign *= -1;
            // fill from the jth wave-half to the j+1th wave-half with volume
            Arrays.fill(buffer, waveHalf * j, waveHalf * (j+1), (byte) (volume * sign));
        }
        dataLine.write(buffer, 0, buffer.length); //
    }

(assume buffer.length = 20 * waveHalf)

counting loops is an incorrect approach for O notation

Hosch250

Especially if those loops have the potential to break early.

Vogel612

also the comparison of LinkedList vs. ArrayList is not even remotely related to Big-O notation. The much more stressing issues with these two data-structures are cache-locality and maybe a usability factor for certain purposes

Hosch250

Maybe the worst-case scenario is slightly worse than needs be, but the average case scenario is much better.

Vogel612

22:58

it's more complicated to write an efficient queue with an array(list) than it is with a linked list. the benefits to doing so come from cache locality though.

skiwi

I still want to write an ASM sieve exploiting cache locality

I wonder if it really matters there

So looping over the whole range at once vs looping over cache sized blocks

Kaz

@skiwi I would say that the purpose of stars is to highlight things that you think other people in the room would want to see and/or to denote things that you think deserve to be, upvoted, for lack of a better term. In here, that's often things that are meant to amuse, but occasionally also inform and to lend weight to a sentiment.

9

A: My God, it's full of stars

Whoops, yeah. The limit was temporarily lifted the day after the US election and we intended to put it back... and then evidently forgot. I'm "putting that thing back where it came from" as we speak. Thanks for the report!

So, the star limit has been gone for a month and it took me until now to notice...

Hosch250

23:15

In other words, it was to help Clinton fans feel better. Just like cancelled midterms, etc.

Incomputable

@Hosch250 like curved grades!

Vogel612

</politics>???

Hosch250

Can someone please check my big-O calculation here: codereview.stackexchange.com/a/149247/34073? I'm kind of confused :/

Vogel612

@Hosch250 seems right .. count is linear search, so you got N^2

Hosch250

Yeah, I accidentally had 2N + 1 at first.

Kaz

23:24

@Hosch250 looks good.

Duga

Are you asking for a solution to a problem, or are you asking for a code review? — Taplar 1 min ago

I'm voting to close this question as off-topic because the user appears to be asking for a code review and as such is more apt for codereview.stackexchange.com — Taplar 36 secs ago

skiwi

23:41

Can I cancel a flagged answer from mobile?

Vogel612

you should be able to. not from the app tho

skiwi

Ok, btw

0

A: Why filter() after flatMap() is "not completely" lazy in Java streams?

I agree with other people this is a bug opened at JDK-8075939. And since it's still not fixed more than one year later. I would like to recommend you: AbacusUtil N.println("Result: " + Stream.of(1, 2, 3).peek(N::println).first().get()); N.println("-----------"); N.println("Result: " + Stream.o...

Check that user, I think the spam flag was wrong... but isn't he kind of spamming?

(It's SO)

Vogel612

disclosed affiliation ... not sure what the problem is ..

skiwi

He's spamming his tool on all questions he can find, that's my problem with him

Hosch250

:O gizmodo.com/wingdings-predicted-9-11-a-truthers-tale-1679759324

skiwi

23:50

Somehow this annoys me, Rubberduck answers don't annoy me in the slightest though

Hosch250

Wingdings is a wicked font :/

Kaz

@skiwi It could do with being a bit more fleshed out.But I'd put it under "Not the way I'd d it, but not breaking the rules"

skiwi

@Hosch250 Wow that's so far-fetched... lol

Hosch250

Two pages of promotions for AbacusUtil and a couple other things he's done.

Transcript for