« first day (692 days earlier)      last day (3328 days later) » 

12:00 AM
There are 1262 unanswered questions
 
@SimonAndréForsberg ... I could start showing why this can't be done and why you may never do that: easily found when looking at the function y = sin(x) around 0. It behaves almost linearly between [-0.3; 0.3]. So if you measure data and it is linear you might be tempted to say "the curve will be linear". Yet if you extrapolate this up to 0.5 the absolute error is massive.
And that could be scaled to anything (y = sin(0.001 *x) * 1000 which is near linear between -300 and 300)
 
@paul23 I am perfectly aware of that, but so far I have not seen any method in all my years of programming that has time complexity O(sin(x))
@Duga this is not going well
And of course this complexity-estimation algorithm will try out a little more than that to try to see the "big picture"
 
Well n log n will look for a long time (depending on the constants before both ns) like n^0.5 (or even linear)
 
@SimonAndréForsberg pretty please
it's feminine :D
 
@Mehrad naaah... sorry. not that one
@paul23 I am aware.
 
12:05 AM
I'm not convinced that I mind @Duga's avatar that much as it is
 
@Lucus That's your pseudocode and you already have it implemented in your code. If you're looking to improve it go to CodeReview.SEmichaelpri 1 min ago
 
@Mehrad also please make sure that whatever image you suggest isn't copyrighted.
 
No suggestion anymore. two I liked
Thought it would give it a distinguished look same as Captain and all. That's it really
 
@Mehrad I'll think about it!
 
and I am pretty sure that's the same reason you guys called it Duga rather than user1234
@Duga Cheers
 
12:09 AM
anyway back back to trying to decide if I should use an in-memory sql database to keep track of my measurements.
Having 1000ish measurements and often want to "graph all measurements with mass = 10 and mach number = 7"
 
I don't think a SQL database would help that much with 1000 measurements in memory
 
That's true, but I wonder if there's any other library that can then give a concise syntax to select things.
 
12:24 AM
@SimonAndréForsberg UBench seems like a good place. It may have some initial limitations on the following:
1. currently it has no 3rd party dependency libraries (other than JUnit, which is compile-time only)
2. it's text-based
other than that, I think it fits in well with the goals/scope of it.
It is an existing tool, which makes it easy to deploy, etc.
It is modern (no Java7 requirements, etc.).
It really is a benchmark thing, solved through UBenching.
 
yeah, alright
 
@Duga ......this isn't improving....
 
29 mins ago, by Simon André Forsberg
@Duga this is not going well
 
@SimonAndréForsberg Sorry, but I've been doing doing school.
BTW, hehehe, I wonder, hohoho, when my Fanatic badge will come in, hahaha?
 
1
Q: Calculate median and quartile in C without sorting the array

AgostinoHere's a piece of working code wrote in C to calculate the median without putting all values in an array and sorting them. It reads values from a file. #include <stdio.h> #include <stdlib.h> double find_min(FILE *, double, double); double find_max(FILE *, double, double); int main(int argc, ch...

 
12:38 AM
@Hosch250 Typically at abou 03h00Z
 
OK
 
@Hosch250 You're fanatic? Congrats!
 
Yup.
 
Congrats on Sportsmanship, @Hosch250
2
 
@rolfl Woah, first fanatic in 2015!
 
12:43 AM
Congrats on Fanatic, @Hosch250 Badge->Fanatic
3
 
@rolfl That was about a month ago.
 
I like sportsmanship
 
@rolfl Got it.
Thanks.
 
0
Q: Print in assembly

RandolphI can print a string in nasm like below. However, this takes quite a lot of code, I would like to simplify it somehow. Do you have an idea? global print print: ; (str) push r12 ; str push r13 ; len mov r12, rdi call strlen mov r13, rax .loop: mov rdi, STDOUT mov rs...

Is this question for CR?
 
12:48 AM
@SimonAndréForsberg
 
We have 4 assembly questions... 1 is a fizzbuzz... 2/3 of the other are answered
 
@Mat'sMug Dugette?
 
lol
(probably SFW, not sure if free of rights though)
 
> What do You think about Girls Robot Robot Girls Robot Girl Wallpaper Hd Robot Fall In Love With A Girl Nikon Wallpaper Girl?
 
@Mat'sMug Naaaaw
 
12:52 AM
You awake, Simon?
 
So, I was thinking, that we should divide and conquer
There's two major components, one is simpler than the other
The simple thing is running the bench process for different scale inputs.
the other thing is the matching and analytics of the results.
It strikes me that your analytics from minesweeper would be useful
 
yes
oh?
to use as a test subject? Measure the time complexity of solving Minesweeper?
 
Well, not the actual algorithm, but the process
 
12:55 AM
You seemed to enjoy the concept... that's all I am saying...
It's easy to generate the data, it's harder to analyze it
pattern matching, curve fitting,e tc
 
You mean I'm doing divide and conquer in Minesweeper? I guess you could call it that.
 
NO, I mean, we divide the work, and I start by giving you data, and you start by analyzing it ;-)
 
Why do I get the hard part?
2
I definitely think I will run the Minesweeper algorithm on this estimation though
 
because then you can set up the right strategies, and I can catch up and help with the implementation
 
12:57 AM
I was thinking that a decent strategy would be to:
1. take a scale of 1, and run the algorithm for a second, and count the calls.
2. double the scale, and run it for a second, and count the calls.
3. repeat until you only get one iteration through.
It will run perhaps as many as 16-to-20 iterations.....
that should be enough data to capture a rudimentary curve.
the problem is if the are only a few (less than 5 or so) points
then go back and fill in the half-size gaps?
 
sounds like a good plan
Still not sure how you connected this to my Minesweeper algorithm... but the funny thing about that is that it can be both linear time and exponential time, all depending on how you arrange the Minesweeper board.
 
I did not connect it to the algorithm, I connected it to the way you think
 
still don't see the connection. How do I think?
 
-1
Q: Check If All Lotto Numbers Are Covered In Input

FabZerosEach ticket for the Pick-10 lotto has 10 unique numbers ranging from 1 to 99. Suppose you buy a lot of tickets and like to have them cover all numbers from 1 to 99. Write a program that reads the ticket numbers from a file and checks whether all numbers are covered. Assume the last number in the ...

 
I expect you will provide the data points in (x, y) form? x = input size, y = iterations per second?
 
1:03 AM
Yeah, sounds about right.
 
on second thought... y = nanoseconds per iteration might be better.
otherwise it would be a "falling" graph
 
OK. sensible, but, I still think the time-based execution is a good solution.
 
sure. absolutely. don't want it to run for too long
What if there's an algorithm that takes more than one second for n=1 though?
Then it's paaaaaainfully slow.
 
@SimonAndréForsberg Time to pick a better algorithm then.
 
@Hosch250 yes, but we can't control what algorithms are being inputted here.
 
1:11 AM
Oh.
 
@SimonAndréForsberg That's why we start at 1
 
hopefully this will never happen so it shouldn't be a problem at all.
yeah, exactly...
 
if they have not got it running in less than a second..... we have problems
 
Well, why don't you put a timer in "Time out - poor algorithm."
 
I think I'm making up a hypothetical problem here.
@rolfl perhaps a 5-second time limit before the call is interrupted? Although some implementations never check Thread.interrupted state...
as I said, probably a hypothetical problem.
 
1:13 AM
A default time of 1 second.... with an option to make it longer.
 
n = 1 should be solvable in nanoseconds, shouldn't it?
 
THe user will not submit themselves to running it if they have not run it before
 
@Hosch250 depends on the algorithm, but normally, yes.
 
So, what is the problem here, anyway?
 
1:14 AM
@Hosch250 There is no spoon problem.
 
Oh?
Then what are you discussing?
 
last night, I was wondering the same thing...
 
Resorts to the other discusser. @rolfl What is going on?
 
@rolfl Just a thought about method signature like <T> SomeResult estimate(IntFunction<T> dataSupplier, Consumer<T> performer) { ? clear separation between the supplier of the data - which should not be timed - and the performer of the data.
2 hours ago, by Simon André Forsberg
@rolfl many people seem to have problems knowing what the complexity of their code is. I figured that by providing a void doSomethingToFindComplexity(int n) method, and in that method create an input and sort it using some algorithm or whatever, it would be possible to estimate the actual complexity of the code.
 
I think I know the basic complexities are, but I'm not familiar with log anymore.
I know where to find the basic rules, though.
 
1:19 AM
@Simon - I think adding a partner method to press() is another option
you build up a benchmark as you want, with one, perhaps more tasks/options.
then, instead of running 'press', you run estimate(IntFunction<T> dataSupplier)
 
Return a class like UReport, but with timings
 
1:35 AM
I got a feeling that doing iterations for one second is too less.
it is much easier to tell the difference between O(n^2) and O(n log n) if there are more points, a bit further away. Such as n=1024, and to get a good measure it is probably needed, at least for a normal Java sort, to do a couple of those.
 
Let me play with things and figure out hat works.... I think you're right, but, warmups and stuff can be done fast.
 
once warmed, the rest can fit in somehow
There's another issue with low-resolution times at scale=1
but, we'll cross that bridge....
 
I managed to get myself a little test set of data, and checked with a Graph program that it is possible to estimate the complexity.
I'm glad I still have my math book about statistics, I should be able to figure this out.
 
0
Q: Checking If Input Covers All Lottery Numbers

FabZerosach ticket for the Pick-10 lotto has 10 unique numbers ranging from 1 to 99. Suppose you buy a lot of tickets and like to have them cover all numbers from 1 to 99. Write a program that reads the ticket numbers from a file and checks whether all numbers are covered. Assume the last number in the f...

 
1:43 AM
@SimonAndréForsberg you can now push to Microbench, and I have created github.com/rolfl/MicroBench/tree/stepper
 
@rolfl oh, awesome!
 
The actual interaction with oss.sonatype for the maven-system is not something i can share though, so unfortunately, if it is to keep the tuis.net.ubench groupid, only I can release...
Building, and so on, though should work fine.
you won't be able to do a mvn release:perform though (at least not successfully)
 
that's perfectly fine. You should be the only one who can release. otherwise I might mess things up completely
I'm curious though how exactly it can/should be migrated into UBench... as UBench currently doesn't have the separation between task and "task with n-sized input"
for my test data, I did this:
        UBench bench = new UBench("");
        for (int i = 0; i < 12; i++) {
            final int n = 1 << i;
            bench.addTask("Sort " + n, () -> sort(n));
        }
        bench.press(10000).report();
 
hmmmmm
you're right.
How about creating 1 task per data size...?
Hmmm, no, it's messy, I'm going to have to look
 
like exactly how I did in my test? No problem, but then I guess your plan for the squat method isn't going to work...
 
1:55 AM
I think you're right, integrating in to UBench is not going to happen.
Also, squat is not a good name any more... i think UScale .. ;-)
 
UScale is a lot better definitely ^^
 
UBench, and UScale...
UScale - constructor with a function to test, and a supplier of data at different sizes.
 
not sure if it's needed to pass that function to the constructor, might be enough to pass it to the actual performing method
 
Actually, I think there's a different way.
that.
 
There always is!
 
1:58 AM
The issue is that some functions take data, others take a primitive
So, for example, factor values below 1000, 20000, etc.
 
How about Supplier<T> and Consumer<T>?
+some PECS of course
Supplier<? extends T> and Consumer<? super T>
 
exactly....
 
meanwhile, I found some use for the existing UBench functionality to give me the data I want easier:
        for (int i = 0; i < 12; i++) {
            final int n = 1 << i;
            bench.addTask(String.valueOf(n), () -> sort(n));
        }
        bench.press(10000).getStats().stream()
            .map(stats -> new long[]{ Long.parseLong(stats.getName()), stats.getAverageRawNanos() })
            .forEach(data -> System.out.println(Arrays.toString(data)));
 
and, the method returns an instance of UScale containing the data, and reporting methods
 
although parsing the name back to long is #ugly
@rolfl data = estimated complexity?
 
2:01 AM
data -> collection of (scale,nanosecond) datapoints
 
reporting methods -> bunch of various complexities to test against?
 
no, methods to output visualizations, reports of the data.
here's the raw data, and here's what we think it means
 
So, something like:
public static <T> UScale scale(Consumer<T> function, IntFunction<T> generator);
UScale results = UScale.scale(MyClass::isPalindrome, scale -> buildStringForScale(scale));
Also....
public static UScale scale(IntConsumer function, IntUnaryOperator generator);
UScale results = UScale.scale(MyClass::countPrimesLessThan, scale -> setLimitForScale(scale))
etc.
then youc an do:
results.report();
etc.
 
I am so going to run this on almost every single Java question about performance in the future.
 
2:11 AM
0
Q: Checking If Inputs Cover All Lottery Numbers

FabZerosEach ticket for the Pick-10 lotto has 10 unique numbers ranging from 1 to 99. Suppose you buy a lot of tickets and like to have them cover all numbers from 1 to 99. Write a program that reads the ticket numbers from a file and checks whether all numbers are covered. Assume the last number in the ...

 
report() is going to have to have the identification and analysis of the raw data in the results
that will be the hard part
 
@CaptainObvious Isn't that like the third such question now? by the same author? Seems like he deletes them and then reposts them...
@rolfl I believe I'm onto something.
 
OK, you do your thing, I'll get some data happening, using the above system.
Also, yes, he deleted two previous versions
 
@SimonAndréForsberg He deleted the first, Jamal deleted the second and reopened the first as it was edited.
He reclosed the first, and asked a third?
 
What data structure will you provide me? long[][] or something?
 
2:16 AM
Fortunately, I still had my answer to the first in my clipboard.
0
A: Checking If Inputs Cover All Lottery Numbers

Hosch250First, this will not work with the input 99. Arrays are 0-indexed, but when you create one, you need to specify the value you wish .length to have, which is 100. This part is also erroneous: while (ticketNumber != 0) { for (int i = 1; i <= neededNumbers.length; i++) { neededNumbers...

 
@SimonAndréForsberg See:
public class UScale {

    private static final class ScaleResult {
        final int scale;
        final UStats stats;

        ScaleResult(int scale, UStats stats) {
            super();
            this.scale = scale;
            this.stats = stats;
        }

        public int getScale() {
            return scale;
        }

        public UStats getStats() {
            return stats;
        }

    }

    private final List<ScaleResult> stats;

    private UScale(List<ScaleResult> stats) {
That way you can choose to pull any of the measures you want to from the UStats
(fastest, average, 95th, etc.)
But, List<ScaleResult> seems like a flexible solution
 
ah, the final int scale; is for the average/fastest/95th/etc?
no, wait
I'm stupid
int scale is n of course
and you provide all the time data in the UStats
 
that's it
 
Really, what you'll want to start with, I guess, is stats.getScale() and stats.getStats().getAverageNanos()
or whatever
 
2:26 AM
yes
I'll sleep on this, I'll try to implement something tomorrow.
 
OK, and I should have something commited for when you awaken
 
@nhgrif I looked at your latest post (good one btw) I find the white/grey bar at the top of each code block ... distracting? I'd say either switch it off, or if you really need titles for code blocks, make the background color darker
 
'night @SimonAndréForsberg!
 
Also @nhgrif this is a bit weird (unless you did on purpose)...
> We shouldn’t be bitmasking purely because it’s more efficient. Bitmasking is more efficient, yes, but on such a miniscule level that if you’re
Missing part of a sentence
 
2:39 AM
@Phrancis a bit weird huh?
 
Might be a character limit with WP, maybe after a certain post length it
Then again I've written posts way longer than that on my own WP blog, so it may be something wholly unrelated
 
I paid for one of my upcoming trips
My bankaccount is sort of dead
Those tutoring sessions would really come in handy now
 
3:46 AM
0
Q: Correct coin denominations when giving change in a Vending Machine Program

MikCould anyone here help me; I have written a vending machine program but when giving change, it need to output the least amount of coins possible (Java) in the correct denominations. ($2, $1, 50c, 20c, 10c, 5c coins). It needs to read: eg "Your change is $4.75: Here you go: $2 x2 $0.50 x1 $0...

0
Q: Determine the indez where two lists diverge

Dave JarvisBackground A class provides an API to determine the index where two string lists diverge. import java.util.LinkedList; import static java.lang.System.out; /** * Provides the ability to determine the index whereat two lists begin * to differ in content. Both this list and the list to comapre...

 
3:58 AM
Can I fork a public Github repository into a private one?
 
I wouldn't think so
 
:[
 
but maybe
I mean, IDK
 
@Unihedro Sure you can.... I believe
 
Is it frowned upon if I make a private repository, add the public one as a remote, then pull from the public one and push to the private one periodically?
@rolfl The "fork" button gives me a public one.
 
3:59 AM
No.
Have you paid for private?
 
Yeah.
> Make this repository private
Make private
Public forks can't be made private. Please duplicate the repository or contact support.
Oh.
 
Can't you clone it and add a new remote ?
 
0
Q: Rubberduck's "Rename" refactoring implementation

Mat's MugKnowing who's using what, and where, I've implemented a "Rename" refactoring for Rubberduck. It works great - it needs further extensive testing, but the preliminary tests are very, very exciting. There are a few things I'm not sure I like though: The entire logic is implemented in the Rubb...

 
@JaDogg Yeah - It seems that github does that.
 
@Mat'sMug ctrl-f GetHashCode no results! yay!
 
4:02 AM
lol
 
        // until we figure out how to replace actual tokens,
        // this is going to have to be done the ugly way...
 
Uh oh.
 
yeah
> the implementation is ugly beyond words - and I'm not sure how to go about making it right.
 
i'll try to find some time this weekend to look over it
life has been really busy lately
 
FYI, there's one known issue with the refactoring, but it's not in that code (github.com/retailcoder/Rubberduck/issues/345)
 
4:10 AM
GetReplacementLine()
Jesus Mary Josef
Let me just condense that into 5 lines really quick
 
well the only way I can modify a code module, is by replacing an existing line
lol
ah
 
it's a little annoying that the target can be both in front and behind
You don't check closing braces?
what if you passed Blaat(Foo, Bar) and wanted to refactor Bar?
ah okay, the space option covers that
 
@Mat'sMug maybe i haven't understood the problem, but would something like this work
var input = "Foo = FooBar(Foo)";
Console.WriteLine(Regex.Replace(input, "\\bFoo\\b", "Baz"));
 
Yeah, a regex replace seems pretty solid for this.
 
Cache the compiled version in a constant so you can reuse it.
 
4:19 AM
I'll take a look at it today if it hasn't been answered yet, thought I think most can be fixed by using that regex instead of the ifs
 
i feel like the "proper" way is to update the AST though
 
Too broad. If you want a Code Review, use CodeReview.SE. If your question is "how do I add a background image to a Tkinter Canvas?" (as best I understand it), please ask just that and only include the minimum relevant code. — Two-Bit Alchemist 1 min ago
 
@mjolka I prefer an immutable AST, it leaves no room for unintended changes to it
4
Q: How does the release version of Roslyn implement immutable trees?

brightI understand that the pre-release version of Roslyn implemented immutable trees as described in this excellent blog post by Eric Lippert. However, that post ends with: "The cost is that this system is complex and can consume a lot of memory if the "red" facades get large. We are at present doing...

The links here seem very interesting on the subject
 
@mjolka I haven't tried a regex... I thought I'd get something more maintainable without.. wait, does that result in Baz = FooBar(Baz)?
 
I'll read them after I wake up. Night night.
 
4:24 AM
'night @JeroenVannevel!
 
@Mat'sMug yep Baz = FooBar(Baz)
 
I ...dismissed the obvious solution, like a total moron.
 
@JeroenVannevel maybe "update" was the wrong word, but yeah, immutability is good
 
I'm sure there's a way ANTLR can replace a token in the tree - somehow.
 
i'd be very surprised if you can't, but i haven't used ANTLR
 
4:29 AM
it's just the ANTLR docs are pretty hard to find. And what you find either applies to older versions, are specific to the Java target, or are just completely cryptic.
 
:(
 
:/
 
:\
 
:O
 
or I'm just too green to AST's to understand what I'm doing / should be doing.
lol
 
4:32 AM
user image
3
why do i do this to myself
 
Ctrl+A, Shift+Del
 
ah, there it is -- SettingsTest2 :(
 
@mjolka Is that the way you do version control? xD
Stay up to date, man. Use git or something.
 
@Unihedro That is the way I USED to do version control.
 
@Unihedro i use git, those are all unrelated projects
 
4:34 AM
But, I used to have that too, just a bunch of mini test projects.
 
@Hosch250 :S
@mjolka Oh, I see... Naming is hard :p
 
> I have a sick sense of what is fun
 
@Mat'sMug record scratch
whaaat
 
I need to know if Rubberduck can work in VB6 :)
 
@Unihedro Usually, I had at most 3 projects - a main one, maybe one to test troublesome new features, and maybe one with major developments that weren't ready for release.
 
4:40 AM
@mjolka that CD is over 15 years old... I hope all goes well!
 
@Mat'sMug this is on a VM, right?
@Hosch250 i'm so glad you started using git
 
Interestingly enough, even though I use Git now, I still have two projects - one ready for release (I need it for content updates in case MS updates OneNote), and one a few months away from being released.
Talking about Git, I need to merge some changes into my master.
 
@mjolka nope. cowboy style :)
bbl, gotta reboot
 
@Hosch250 sounds like instead of two projects you could use branches
 
@mjolka Too late - I didn't start until recently, and I don't want to try merging the two solutions.
I will use branches after I get this release out.
Night all.
 
4:46 AM
night @Hosch250
 
'night!
 
@Mat'sMug i hope you have an appropriately 90s playlist going. maybe put on a hypercolour t-shirt
 
mwahaha
crashes on load though... because we're doing Office-specific stuff at startup
I wonder...
 
@Simon, took longer than expected. Added: github.com/rolfl/MicroBench/commits/stepper
See the main method in UScale, should be runnable for you.
 
5:03 AM
@mjolka this IDE actually takes me right back into my previous job, just a year ago ;)
actually... hmm
 
@Mat'sMug ouch
 
        public void OnConnection(object Application, ext_ConnectMode ConnectMode, object AddInInst, ref Array custom)
        {
            try
            {
                _app = new App((VBE)Application, (AddIn)AddInInst);
            }
            catch (Exception exception)
            {
                MessageBox.Show(exception.Message, "Rubberduck Add-In Could Not Be Loaded", MessageBoxButtons.OK, MessageBoxIcon.Error);
            }
        }
it's my code running
apparently the cast to (VBE) is failing
 
I think codereview.stackexchange.com would be a better place for this. — Shaunak D 1 min ago
 
0
Q: Assembly Summation Efficiency

Evan BechtolI wrote a simple summation program to practice using loops and jump instructions. I feel like this is pretty lightweight and wanted some feedback on possible improvements! Am I correct in assuming this is a "do-while" loop? Any input is appreciated, thanks for your time! # Description: Summatio...

 
@Mat'sMug checked out RobH's profile
"Experienced with SP2010 and wouldn't wish it on my worst enemy."
 
5:17 AM
haha
 
at my old work there was a constant threat that i would have to work with sharepoint
luckily it never came true
but my co-workers decorated my office with sharepoint wheels one day
 
ooh pretty! - "I ♥ SharePoint" lol
 
 
1 hour later…
6:36 AM
0
Q: Double Dice Game: I must make the two dice equal eachother to win.

Frustrated Beginner ProgrammerI can't get my main class to recognize the dice as doubles. In order for the player to win, they must roll doubles. //----------------------------------------------------------------- // Constructor: Rolls the dice to get a beginning value. //---------------------------------------------...

 
4
Q: Convert a 24bit bitmap to grayscale

JaDoggI wrote this so I can learn CUDA. This is coded to work on my laptop's Nvidia GeForce GT 540M. Main points I need reviewed: CUDA programming conventions Performance, especially kernel speed C programming conventions Preprocessor and macro conventions Making it DRY kernel.cu /*************...

 
 
1 hour later…
7:38 AM
0
Q: Race On - a gambling game (in beta)

Jon Mark PerryIt's for six players. Each player writes six numbers from {1,2,3,4,5,6} down - any six (repeats allowed). They take it in turns to throw a dice. If the number is top of their list, they cross it off (automatic). If not, the dice is open to bids. You can bet 1,3,6,10,15. The current player must ac...

 
monking @all
 
If the reason is another dev's changes, I think they would be better handled by a proper code review process. That said, you can always check the diff as answers below suggest :) — mu 無 1 min ago
 
8:00 AM
@mu無, proper code reviews or firing this developer is indeed what should be done here, but I just told you what situation got me into thinking about such kind of merge. — Maximus 1 min ago
 
monking
 
8:25 AM
@CaptainObvious Not quite working — probably off-topic.
 
9:10 AM
@Havelock no it wouldn't, if the code works then it fits on codereview.SE (it has to actually work; they are very strict about that), this is otherwise a "best practice" question in disguise and will quickly get closed on programmers. — ratchet freak 28 secs ago
 
9:20 AM
I think that your question fits better on codereview.stackexchange.comHuorSwords 1 min ago
 
9:39 AM
0
Q: Please help me with the optimization

OGYResources in my program are not exempt and with prolonged use application, it can take up to ~ 500 MB of RAM, which is not I do? How to fix it? If Could you see the source code and share advice. Source on GitHub I am sorry for my english)

 
9:54 AM
0
Q: Safe way to encrypt and decrypt passswords PHP?

MaximilianI am wanting to encrypt a password and decrypt a password using PHP is this a safe method? $pass = "password" //encrypt password $salt = strtr(base64_encode(mcrypt_create_iv(16, MCRYPT_DEV_URANDOM)), '+', '.'); $salt = sprintf("$2a$%02d$", 10) . $salt; $hash = crypt($pass, $salt); //decryptio...

0
Q: Bootstrap Show Many Move One Carousel Modification - jQuery Optimization

rtpHarryI've been steadily improving a show many move one carousel sample that I found a few weeks ago. I want to post my improvements for others to use but don't want to spread bad code. I'm not an expert in JavaScript but I always like to produce clean code. Working demo at http://codepen.io/rtpHarry/...

0
Q: Making CORS work in XMLHTTPRequests

mitya221I'm currently working on a website which gets information from a server using its REST interface. I'm new to HTTP, so I've encountered some problems. First of all, the CORS is not allowed on the server and it is not possible to turn it on. If I type the URL of the requested resource right int...

 

« first day (692 days earlier)      last day (3328 days later) »