Develop Reference

Is it possible to use IPOPT without Jacobian matrix? [closed]

Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 5 days ago.
Improve this question
I am writing a program with IPOPT in Java and due to the nature of the problem, it is rather difficult to provide a Jacobian matrix.
The question is basically the title:
Is it possible to use IPOPT without Jacobian matrix and if so how?
i couldn't find anything in the documentation, but maybe i am just blind.

Endienness conversion between Little and Big [closed]

Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
does java have a function to make a direct conversion between Little and BigEndien?

Several. Byte order can be swapped using ByteBuffer or Integer/Long.reverseBytes

Insert space between numbers and letters in currency formatted text [closed]

Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
I have a string "eur0.99", it can be "eur123.0" or "som0.10", or "0.99usd", or "123.34any" or something like that. How can I simply insert a space between the price and letters without making a huge nasty messy code?

You can use
System.out.println(input.replaceAll("(?<=[A-Za-z])(?=[0-9])|(?<=[0-9])(?=[A-Za-z])", " "));
Ideone Demo

Should I check if a text field has text and then clean it or directly clean it? [closed]

Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 6 years ago.
Improve this question
So the question is basically if to have
getDriver().findElement(by).clear();
or to have
String text = getDriver().findElement(by).getText();
if (!text.equals(""))
getDriver().findElement(by).clear();
and after that a sendKeys.
Note: Most of the times, the field is empty.

This is simple math
getDriver().findElement(by).clear();
Costs as
getDriver().findElement(by).getText();
To the second line you add an if check and maybe getDriver().findElement(by).clear(); anyway.
So just call clear() without a check.

huffman without using node [closed]

Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 7 years ago.
Improve this question
I'm thinking on possibility of making a Huffman code without "node".
It's based on the nodes then my question seems a bit ambiguous.
I know,maybe we have to use string's abilites ...
Is it possible ? and if "YES" how Is it possible in java?
Thanks.

You can use indices instead of nodes but you need somewhere nodes and/or vertices.