LinkedList<Long> list = new LinkedList<>();
// Update the constructor to create the gauge
ExampleResource(MeterRegistry registry) {
this.registry = registry;
registry.gaugeCollectionSize("example.list.size", Tags.empty(), list);
}
@GET
@Path("gauge/{number}")
public Long checkListSize(@PathParam("number") long number) {
if (number == 2 || number % 2 == 0) {
// add even numbers to the list
list.add(number);
} else {
// remove items from the list for odd numbers
try {
number = list.removeFirst();
} catch (NoSuchElementException nse) {
number = 0;
}
}
return number;
}
LinkedList<Long> list = new LinkedList<>();
// Update the constructor to create the gauge
ExampleResource(MeterRegistry registry) {
this.registry = registry;
registry.gaugeCollectionSize("example.list.size", Tags.empty(), list);
}
@GET
@Path("gauge/{number}")
public Long checkListSize(@PathParam("number") long number) {
if (number == 2 || number % 2 == 0) {
// add even numbers to the list
list.add(number);
} else {
// remove items from the list for odd numbers
try {
number = list.removeFirst();
} catch (NoSuchElementException nse) {
number = 0;
}
}
return number;
}
Copy to ClipboardCopied!Toggle word wrapToggle overflow
@GET
@Path("prime/{number}")
public String checkIfPrime(@PathParam("number") long number) {
if (number < 1) {
return "Only natural numbers can be prime numbers.";
}
if (number == 1 || number == 2 || number % 2 == 0) {
return number + " is not prime.";
}
if ( testPrimeNumber(number) ) {
return number + " is prime.";
} else {
return number + " is not prime.";
}
}
protected boolean testPrimeNumber(long number) {
// Count the number of times we test for a prime number
registry.counter("example.prime.number").increment();
for (int i = 3; i < Math.floor(Math.sqrt(number)) + 1; i = i + 2) {
if (number % i == 0) {
return false;
}
}
return true;
}
@GET
@Path("prime/{number}")
public String checkIfPrime(@PathParam("number") long number) {
if (number < 1) {
return "Only natural numbers can be prime numbers.";
}
if (number == 1 || number == 2 || number % 2 == 0) {
return number + " is not prime.";
}
if ( testPrimeNumber(number) ) {
return number + " is prime.";
} else {
return number + " is not prime.";
}
}
protected boolean testPrimeNumber(long number) {
// Count the number of times we test for a prime number
registry.counter("example.prime.number").increment();
for (int i = 3; i < Math.floor(Math.sqrt(number)) + 1; i = i + 2) {
if (number % i == 0) {
return false;
}
}
return true;
}
Copy to ClipboardCopied!Toggle word wrapToggle overflow
@GET
@Path("prime/{number}")
public String checkIfPrime(@PathParam("number") long number) {
if (number < 1) {
registry.counter("example.prime.number", "type", "not-natural").increment();
return "Only natural numbers can be prime numbers.";
}
if (number == 1 ) {
registry.counter("example.prime.number", "type", "one").increment();
return number + " is not prime.";
}
if (number == 2 || number % 2 == 0) {
registry.counter("example.prime.number", "type", "even").increment();
return number + " is not prime.";
}
if ( testPrimeNumber(number) ) {
registry.counter("example.prime.number", "type", "prime").increment();
return number + " is prime.";
} else {
registry.counter("example.prime.number", "type", "not-prime").increment();
return number + " is not prime.";
}
}
protected boolean testPrimeNumber(long number) {
for (int i = 3; i < Math.floor(Math.sqrt(number)) + 1; i = i + 2) {
if (number % i == 0) {
return false;
}
}
return true;
}
@GET
@Path("prime/{number}")
public String checkIfPrime(@PathParam("number") long number) {
if (number < 1) {
registry.counter("example.prime.number", "type", "not-natural").increment();
return "Only natural numbers can be prime numbers.";
}
if (number == 1 ) {
registry.counter("example.prime.number", "type", "one").increment();
return number + " is not prime.";
}
if (number == 2 || number % 2 == 0) {
registry.counter("example.prime.number", "type", "even").increment();
return number + " is not prime.";
}
if ( testPrimeNumber(number) ) {
registry.counter("example.prime.number", "type", "prime").increment();
return number + " is prime.";
} else {
registry.counter("example.prime.number", "type", "not-prime").increment();
return number + " is not prime.";
}
}
protected boolean testPrimeNumber(long number) {
for (int i = 3; i < Math.floor(Math.sqrt(number)) + 1; i = i + 2) {
if (number % i == 0) {
return false;
}
}
return true;
}
Copy to ClipboardCopied!Toggle word wrapToggle overflow
# If you did not leave quarkus running in dev mode, start it again:
./mvnw compile quarkus:dev
curl http://localhost:8080/example/prime/-1
curl http://localhost:8080/example/prime/0
curl http://localhost:8080/example/prime/1
curl http://localhost:8080/example/prime/2
curl http://localhost:8080/example/prime/3
curl http://localhost:8080/example/prime/15
curl http://localhost:8080/q/metrics
# If you did not leave quarkus running in dev mode, start it again:
./mvnw compile quarkus:dev
curl http://localhost:8080/example/prime/-1
curl http://localhost:8080/example/prime/0
curl http://localhost:8080/example/prime/1
curl http://localhost:8080/example/prime/2
curl http://localhost:8080/example/prime/3
curl http://localhost:8080/example/prime/15
curl http://localhost:8080/q/metrics
Copy to ClipboardCopied!Toggle word wrapToggle overflow
# If you did not leave quarkus running in dev mode, start it again:
./mvnw compile quarkus:dev
curl http://localhost:8080/example/prime/256
curl http://localhost:8080/q/metrics
curl http://localhost:8080/example/prime/7919
curl http://localhost:8080/q/metrics
# If you did not leave quarkus running in dev mode, start it again:
./mvnw compile quarkus:dev
curl http://localhost:8080/example/prime/256
curl http://localhost:8080/q/metrics
curl http://localhost:8080/example/prime/7919
curl http://localhost:8080/q/metrics
Copy to ClipboardCopied!Toggle word wrapToggle overflow