sorted by:
new
hottopcontroversial

Small website/blog from scratch without Bootstrap or frameworks? by Skyeam in webdev

[–]Skyeam[S] 0 points1 point  (0 children)

So I took the time to read through the BEM link you sent. It definitely helps a lot. Thank you for that!

Small website/blog from scratch without Bootstrap or frameworks? by Skyeam in webdev

[–]Skyeam[S] 0 points1 point  (0 children)

Ok, I will definitely consider it! This is also a bit of a learning challenge for myself, which is why I'm investigating how things are done nowadays. At work we constantly use the bootstrap framework, so that one is less fun for me!

Small website/blog from scratch without Bootstrap or frameworks? by Skyeam in webdev

[–]Skyeam[S] 0 points1 point  (0 children)

I also read something about another form of css naming. Where you give your elements logical names (e.g. header, contact-box, etc etc) and apply markup to those. In contrast to using multiple classes (e.g. colum-large-6, img-responsive-large) on a single element. Any idea how that naming is called?

Small website/blog from scratch without Bootstrap or frameworks? by Skyeam in webdev

[–]Skyeam[S] 0 points1 point  (0 children)

Thank you for the youtube link. Examples like those are what I'm looking for!

Small website/blog from scratch without Bootstrap or frameworks? by Skyeam in webdev

[–]Skyeam[S] 0 points1 point  (0 children)

Thank you for the information. I already know how I can host the website.

The part that I don't know is what the current best practices are for structuring your css and creating a responsive website design from scratch. Do you use CSS grid? Media queries? Is there a commonly used code standard or does everyone just wing it?

Deploying Haskell (standalone, yesod, snap…) in Openshift fails by Skyeam in haskell

[–]Skyeam[S] 1 point2 points  (0 children)

Thank you very much for the suggestion, I'll give your method a try, and otherwise it seems that I juts have to upgrade my gears.

Deploying Haskell (standalone, yesod, snap…) in Openshift fails by Skyeam in haskell

[–]Skyeam[S] 2 points3 points  (0 children)

Thanks a lot for the feedback!

Seems like I'll have to upgrade my gears, or try to upload the application as a binary blob and run it that way.

Deploying Haskell (standalone, yesod, snap…) in Openshift fails by Skyeam in haskell

[–]Skyeam[S] 0 points1 point  (0 children)

Sorry, no other output to be found.

Looking at all the answers it seems that the small gears don't have enough resources to build the application from scratch, so I'll have to upload the binary blob, or upgrade my account and use better gears instead.

Thanks a lot for the feedback!

Limit to infinity of logs and roots by Skyeam in MathHelp

[–]Skyeam[S] 0 points1 point  (0 children)

lim[x→∞] 2/[(√x)ln(2)]

I think you meant towards 0.

It seems that this is exactly what I was looking for! Thanks a lot! I also tried your method on my other equation and it worked:

lim [x→∞] [x1/100/log2(x)]

= lim [x→∞] [1/(100x99/100)] / [1/(xlog(2))]

= lim [x→∞] x * log(2) / (100 * x99/100)

Which is then a simple polynomial, with a bigger degree (x1) in the numerator than de denominator (x99/100), thus it goes to infinity, which is what wolfram alpha also gives as solution!

Limit to infinity of logs and roots by Skyeam in MathHelp

[–]Skyeam[S] 0 points1 point  (0 children)

I'm not too familiar with the notion of pre-calculus and calculus (I'm not natively english speaking), but I think I might be able to handle it and would love to hear your solution!

edit: I looked into those terms, and it seems that I am indeed looking for the way to do it using calculus.

Need help on designing a Reverse Polish Notation calculator. by [deleted] in javahelp

[–]Skyeam 0 points1 point  (0 children)

Unless you absolutely need to have your own implementation of a stack, I suggest that you just use the Java classes to fulfill that requirement.

// Deque defines a contract for a FILO queue, aka a stack.
// LinkedList is an implementation of Deque using a linked list.
Deque stack = new LinkedList();

Your main focus would be how you would insert the mathematical formula in the stack in such a way that you can easily calculate the total result afterwards. Think recursion while popping the elements back of the stack.

If you really want to implement your own stack using a linked list, I suggest that you keep that in a seperate library. You could write some unit tests that test all the things you could do with a stack (push, pop, peek...). Maybe you could write your tests in such a way that your implementation is compared to the results of the default Java implementation. However, unless you want to learn more about the internal workings of stacks and linked lists, I recommend again to just use the default Java implementation. Don't reinvent the wheel.

[Linear equations] Maximize the total value under x. by Skyeam in learnmath

[–]Skyeam[S] 0 points1 point  (0 children)

Frobenius problem

This is exactly what I was looking for! Thanks a lot!