Questions tagged [java]
Java (not to be confused with JavaScript) is a class-based, object-oriented, strongly typed, reflective language and run-time environment (JRE). Java programs are compiled to bytecode and run in a virtual machine (JVM) enabling a "write once, run anywhere" (WORA) methodology.
10,910 questions
2
votes
1
answer
27
views
Re-implement a simple port knocking client (UDP or TCP) in Java
(I have also published this project on GitHub.) I am aware that some people view this as security through obscurity.
The aim is to implement the port knocking technique in Java. I would like to know ...
4
votes
2
answers
409
views
A tiny Java framework for gathering running time statistics - Take III
From the previous post, I have incorporated the nice answers made by Chris and Chip01.
Code
...
4
votes
2
answers
468
views
A tiny Java framework for gathering running time statistics - Take II
Intro
(The previous version is here.)
(The next version is here.)
Now I have incorporated nice answers made by Chris and Chip01.
What changed:
Fixed the computation of median,
...
4
votes
3
answers
454
views
A tiny Java framework for gathering running time statistics
Intro
(See the next iteration A tiny Java framework for gathering running time statistics - Take II.)
I have this tiny Java framework that allows users to gather running time statistics of a piece of ...
1
vote
1
answer
119
views
A Java program for compressing/decompressing files via Huffman algorithms (version 1.1.1)
Intro
(See the version 1.0.0.)
(See the GitHub repository.)
This time I have got rid of some generic classes and adapted the entire code base to deal with byte ...
5
votes
1
answer
474
views
A Java program for compressing/decompressing files via Huffman algorithms (version 1.0.0)
Intro
(See the version A Java program for compressing/decompressing files via Huffman algorithms (version 1.1.1).)
(The full repository is here. It contains also some unit tests that do not fit in ...
2
votes
1
answer
165
views
Huffman code builder in Java - computing prefix codes for arbitrary (generic) alphabets - Take II
Intro
(This is the continuation of HuffmannEncoder.java - computing prefix codes for arbitrary (generic) alphabets.)
(See the GitHub repository.)
This time:
I have fixed the misspelled ...
4
votes
2
answers
375
views
HuffmannEncoder.java - computing prefix codes for arbitrary (generic) alphabets
(See the continuation of this post at HuffmanEncoder.java - computing prefix codes for arbitrary (generic) alphabets - Take II.)
I have this Java implementation of the Huffmann encoding. It looks like ...
-2
votes
2
answers
215
views
Object oriented programming deque implementation (another second thought)
Another second thought from the second thoughts series Object oriented programming deque implementation (after second thought) led to disposing if statements ...
3
votes
2
answers
862
views
Three non-negative integer encoding techniques in Java
Intro
In this post, I will present three (3) non-negative integer encoding techniques:
Elias gamma coding
Elias delta coding
Golomb-Rice coding
Code
...
4
votes
3
answers
497
views
A simple method for compressing white space in text (Java) - Take II
Intro
In this post, I will elaborate on A simple method for compressing white space in text (Java). Here, I have incorporated some advice offered by Chris. Also, this version preserves a single new ...
2
votes
2
answers
266
views
Benchmarking in Java some super linearithmic sorting algorithms
Intro
A sort is called super linearithmic if its running time is \$\omega(N \log N)\$. For example, \$f(N) = \omega(g(N))\$ means that \$f(N)\$ grows "faster" than \$g(N)\$. In this post, I ...
5
votes
1
answer
544
views
A simple method for compressing white space in text (Java)
(The story continues in A simple method for compressing white space in text (Java) - Take II.)
Intro
Now I have that text space compressor. For example,
...
-7
votes
1
answer
136
views
Object oriented programming deque implementation (after second thought)
The java.util.Deque implementation from Object oriented programming deque implementation that consists of three elements linked arrays, each array holding reference ...
2
votes
1
answer
166
views
ShannonFanoEncoder.java - computing prefix codes in Java
Intro
This time, I have implemented the Shannon-Fano coding.
Code
io.github.coderodde.compression.ShannonFanoEncoder.java
...