programming
traceroute landingpage ipvx
Start: 2024-02-05T15:36:45+0500
HOST: DNSChecker.org Loss% Snt Last Avg Best Wrst StDev
1.|-- ??? 100.0 3 0.0 0.0 0.0 0.0 0.0
2.|-- 10.74.132.69 0.0% 3 0.5 0.7 0.4 1.1 0.4
3.|-- 138.197.251.12 0.0% 3 0.8 8.2 0.8 23.0 12.8
4.|-- 138.197.248.18 0.0% 3 0.9 0.7 0.6 0.9 0.1
5.|-- nyk-b11-link.ip.twelve99.net (62.115.45.5) 66.7% 3 1.1 1.1 1.1 1.1 0.0
6.|-- nyk-bb2-link.ip.twelve99.net (62.115.112.70) 0.0% 3 2.3 2.1 1.9 2.3 0.2
7.|-- ldn-bb1-link.ip.twelve99.net (62.115.113.21) 33.3% 3 73.4 73.6 73.4 73.7 0.1
8.|-- prs-bb1-link.ip.twelve99.net (62.115.135.25) 0.0% 3 80.2 79.8 79.5 80.2 0.3
9.|-- prs-b3-link.ip.twelve99.net (62.115.118.59) 0.0% 3 111.7 90.6 79.9 111.7 18.3
10.|-- ae5.sxb1-ibr-tarazed.bb.godaddy.com (80.239.192.122) 0.0% 3 143.3 106.0 85.4 143.3 32.3
11.|-- ae7.fra10-cr-antares.bb.gdinf.net (87.230.115.2) 0.0% 3 91.0 91.4 91.0 92.0 0.6
12.|-- ae2.cgn1-cr-nashira.bb.gdinf.net (87.230.114.4) 0.0% 3 90.3 90.3 90.3 90.3 0.0
13.|-- po250.sr-left.cgn1.dcnet-emea.godaddy.com (87.230.114.79) 0.0% 3 92.8 92.8 92.7 92.9 0.1
14.|-- ??? 100.0 3 0.0 0.0 0.0 0.0 0.0
15.|-- wp633.webpack.hosteurope.de (5.175.14.155) 0.0% 3 92.8 92.8 92.6 93.1 0.35259 (two links, one done, one toodoo)
5175 (untitled)
GET -> FETCH
HEAD -> EXAMINE
POST -> SUBMIT
PUT -> REPLACE
DELETE -> REMOVE
CONNECT -> PROXY
OPTIONS -> ALTERNATIVES
TRACE -> ECHO
PATCH -> PARTIALUPDATE
https://news.ycombinator.com/item?id=34201082
5006 (querying funding)
| id | url | comment |
|---|---|---|
| 00 | https://opensource.guide/getting-paid/#building-a-case-for-financial-support | overview |
| 01 | https://renewablefreedom.org/grants/funding-sources/ | Liste von Stiftungen |
| 02 | https://everyday.app/ | building habits everyday |
| 03 | https://p2pfoundation.net/ | ??? 521 |
| 04 | https://apply.opentech.fund/ | several subfunds |
| 05 | https://www.ripe.net/support/cpf | ripe community project fund |
| 06 | https://innovationsfonden.dk/en | innovation fund denmark |
| 07 | https://www.awesomefoundation.org/en/about_us | awesome foundation |
| 08 | https://prototypefund.de/en | german fund prototype needed |
| 09 | https://opencollective.com/ | opencollective crowdfunding |
| 10 | https://bountysource.com/ | bountysource drop and hunt |
| 11 | https://en.liberapay.com/ | liberapay crowdfunding |
| 12 | https://github.com/protontypes/libreselery | command line tool |
| 13 | https://github.com/sponsors | gh sponsors |
| 14 | https://github.com/nayafia/lemonade-stand | howto |
| 15 | https://techcultivation.org/ | cultivation of tech (relaunch announced) |
| 16 | https://github.com/iSoron/uhabits/ | offtopic |
4956 (resources)
4840 (using…)
| no | item | comment |
|---|---|---|
| 1 | https://atom.io/ | editor |
| 2 | https://vitejs.dev/ | webserver |
| 3 | https://jeff-zucker.github.io/solid-file-client/docs/examples/ | actual project in work |
| 4 | https://github.com/ | platform |
| 5 | https://mxlinux.org/ | OS |
4397 (day)
Die Unternehmenskennzahlen machen momentan keinen Sinn. Leider ist es so (zum Bedauern aller) dass der Gewerbeschein legal ist und für den Vertrieb gedacht war, allerdings ebenfalls Programmierung umfasst und somit solidweb.org ebenfalls abgedeckt ist. Alle Pflicht auf der Arbeit wird erledigt werden – uninteressant, gewiss – doch die fortschreitende Fetischisierung derselben erfordert, dass umgedacht wird. Du willst Sozi – Pech, musst Du Auto abgeben.
Sonnenschein gibt uns die Richtung vor. lasst uns die Dinge beobachten und Musik sowie Bewegung und Papyroskas nicht unterschätzen. Das Arztpapier wird nicht veröffentlicht (allerdings mit Deeplinks wird auch das umgangen). INPUT G$. Licht kommt in die Welt, um es so auszudrücken, und sei es eine Kerze. Nun wird es Grillungen und Getränke geben. Auch eine now-Page gehört ab sofort zum Portfolio. Du sagst Ping, Maschine sagt Pong. Man muss halt sehr auf Details achten. Bleiben Sie geduldig. Peace.
4377 (java eingabeklasse)
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
//package iotool
//readByte
//readShort
//readInt
//readLong
//readFloat
//readDouble
//readString
//readChar
public class eingabe {
//read-Byte-Methode
public static byte readByte(String inText) {
byte bZahl ;
BufferedReader br;
//Eingabepuffer für eine Dateneingabe neu erstellen
br = new BufferedReader(new InputStreamReader(System.in));
bZahl = 0;
System.out.print(inText);
try {
bZahl= Byte.parseByte(br.readLine());
}
catch (NumberFormatException e) {
System.out.println("Exception geworfen, kein Byte.");
}
catch (IOException e) {
e.printStackTrace();
}
return bZahl;
}
//read-Short-Methode
public static short readShort(String inText) {
short sZahl ;
BufferedReader br;
//Eingabepuffer für eine Dateneingabe neu erstellen
br = new BufferedReader(new InputStreamReader(System.in));
sZahl = 0;
System.out.print(inText);
try {
sZahl= Short.parseShort(br.readLine());
}
catch (NumberFormatException e) {
System.out.println("Exception geworfen, kein Short.");
}
catch (IOException e) {
e.printStackTrace();
}
return sZahl;
}
//read-Integer-Methode
public static int readInt(String inText) {
int iZahl ;
BufferedReader br;
//Eingabepuffer für eine Dateneingabe neu erstellen
br = new BufferedReader(new InputStreamReader(System.in));
iZahl = 0;
System.out.print(inText);
try {
iZahl= Integer.parseInt(br.readLine());
}
catch (NumberFormatException e) {
System.out.println("Exception geworfen, kein Integer.");
}
catch (IOException e) {
e.printStackTrace();
}
return iZahl;
}
//read-Long-Methode
public static long readLong(String inText) {
long lZahl ;
BufferedReader br;
//Eingabepuffer für eine Dateneingabe neu erstellen
br = new BufferedReader(new InputStreamReader(System.in));
lZahl = 0;
System.out.print(inText);
try {
lZahl= Long.parseLong(br.readLine());
}
catch (NumberFormatException e) {
System.out.println("Exception geworfen, kein Long.");
}
catch (IOException e) {
e.printStackTrace();
}
return lZahl;
}
//read-Float-Methode
public static float readFloat(String inText) {
float fZahl ;
BufferedReader br;
//Eingabepuffer für eine Dateneingabe neu erstellen
br = new BufferedReader(new InputStreamReader(System.in));
fZahl = 0;
System.out.print(inText);
try {
fZahl= Float.parseFloat(br.readLine());
}
catch (NumberFormatException e) {
System.out.println("Exception geworfen, kein float.");
}
catch (IOException e) {
e.printStackTrace();
}
return fZahl;
}
//read-Double-Methode
public static double readDouble(String inText) {
double dZahl ;
BufferedReader br;
//Eingabepuffer für eine Dateneingabe neu erstellen
br = new BufferedReader(new InputStreamReader(System.in));
dZahl = 0;
System.out.print(inText);
try {
dZahl= Double.parseDouble(br.readLine());
}
catch (NumberFormatException e) {
System.out.println("Exception geworfen, kein double.");
}
catch (IOException e) {
e.printStackTrace();
}
return dZahl;
}
//read-String-Methode
public static String readString(String inText) {
String sText ;
BufferedReader br;
//Eingabepuffer für eine Dateneingabe neu erstellen
br = new BufferedReader(new InputStreamReader(System.in));
sText = "";
System.out.print(inText);
try {
sText= (br.readLine());
}
catch (IOException e) {
e.printStackTrace();
}
return sText;
}
//read-Character-Methode
public static char readChar(String inText) {
char cZeichen ='0';
System.out.print(inText);
try {
do{
cZeichen =(char) System.in.read();
}
while(cZeichen == '\n' | cZeichen =='\r');
}
catch (IOException e) {
e.printStackTrace();
}
return cZeichen;
}
}
//found @ coderz-home.de, modified by ewing 20150131
4367 (exercise[repeat])
import java.lang.Math;
class a0311b_cross {
public static void main (String[] args) {
double l1x1in,l1x2in,l1y1in,l1y2in,l2x1in,l2x2in,l2y1in,l2y2in,l1x1,l1x2,l1y1,l1y2,l2x1,l2x2,l2y1,l2y2,a,b,c,d,xs,ys;
boolean parallel, deckung, crossed;
int fall;
l1x1in = 0;
l1x2in = 0;
l1y1in = 0;
l1y2in = 0;
l2x1in = 0;
l2x2in = 0;
l2y1in = 0;
l2y2in = 0;
l1x1 = 0;
l1x2 = 0;
l1y1 = 0;
l1y2 = 0;
l2x1 = 0;
l2x2 = 0;
l2y1 = 0;
l2y2 = 0;
a = 0;
b = 0;
c = 0;
d = 0;
xs = 0;
ys = 0;
parallel = false;
deckung = false;
crossed = false;
fall = 0;
l1x1in = eingabe.readDouble ("Linie 1, x1:");
l1y1in = eingabe.readDouble ("Linie 1, y1:");
l1x2in = eingabe.readDouble ("Linie 1, x2:");
l1y2in = eingabe.readDouble ("Linie 1, y2:");
l2x1in = eingabe.readDouble ("Linie 2, x1:");
l2y1in = eingabe.readDouble ("Linie 2, y1:");
l2x2in = eingabe.readDouble ("Linie 2, x2:");
l2y2in = eingabe.readDouble ("Linie 2, y2:");
//l1, bottom to top
if ((l1x1in == l1x2in) && (l1y1in < l1y2in))
{
l1x1 = l1x1in;
l1x2 = l1x2in;
l1y1 = l1y1in;
l1y2 = l1y2in;
}
//l1, top to bottom
if ((l1x1in == l2x1in) && (l1y1in > l1y2in))
{
l1x1 = l1x2in;
l1y1 = l1y2in;
l1x2 = l1x1in;
l1y2 = l1y1in;
}
//l1, left to right
if ((l1x1in < l1x2in) && (l1y2in == l1y2in))
{
l1x1 = l1x1in;
l1x2 = l1x2in;
l1y1 = l1y1in;
l1y2 = l1y2in;
}
//l1, right to left
if ((l1x1in > l1x2in) && (l1y1in == l1y2in))
{
l1x1 = l1x2in;
l1y1 = l1y2in;
l1x2 = l1x1in;
l1y2 = l1y1in;
}
//l1, bottom left to top right
if ((l1x1in < l1x2in) && (l1y1in < l1y2in))
{
l1x1 = l1x1in;
l1x2 = l1x2in;
l1y1 = l1y1in;
l1y2 = l1y2in;
}
//l1, top right to bottom left
if ((l1x1in > l1x2in) && (l1y1in > l1y2in))
{
l1x1 = l1x2in;
l1y1 = l1y2in;
l1x2 = l1x1in;
l1y2 = l1y2in;
}
//l1, top left to bottom right
if ((l1x1in < l1x2in) && (l1y1in > l1y2in))
{
l1x1 = l1x1in;
l1x2 = l1x2in;
l1y1 = l1y1in;
l1y2 = l1y2in;
}
//l1, bottom right to top left
if ((l1x1in > l1x2in) && (l1y1in < l1y2in))
{
l1x1 = l1x2in;
l1y1 = l1y2in;
l1x2 = l1x1in;
l1y2 = l1y1in;
}
//l2, bottom to top
if ((l2x1in == l2x2in) && (l2y1in < l2y2in))
{
l2x1 = l2x1in;
l2x2 = l2x2in;
l2y1 = l2y1in;
l2y2 = l2y2in;
}
//l2, top to bottom
if ((l2x1in == l2x2in) && (l2y1in > l2y2in))
{
l2x1 = l2x2in;
l2y1 = l2y2in;
l2x2 = l2x1in;
l2y2 = l2y1in;
}
//l2, left to right
if (( l2x1in < l2x2in) && (l2y1in == l2y2in))
{
l2x1 = l2x1in;
l2x2 = l2x2in;
l2y1 = l2y1in;
l2y2 = l2y2in;
}
//l2, right to left
if ((l2x1in > l2x2in) && (l2y1in == l2y2in))
{
l2x1 = l2x2in;
l2y1 = l2y2in;
l2x2 = l2x1in;
l2y2 = l2y1in;
}
//l2, bottom left to top right
if ((l2x1in < l2x2in) && (l2y1in < l2y2in))
{
l2x1 = l2x1in;
l2x2 = l2x2in;
l2y1 = l2y1in;
l2y2 = l2y2in;
}
//l2, top right to bottom left
if ((l2x1in > l2x2in) && (l2y1in > l2y2in))
{
l2x1 = l2x2in;
l2y1 = l2y2in;
l2x2 = l2x1in;
l2y2 = l2y1in;
}
//l2, top left to bottom right
if ((l2x1in < l2x2in) && (l2y1in > l2y2in))
{
l2x1 = l2x1in;
l2x2 = l2x2in;
l2y1 = l2y1in;
l2y2 = l2y2in;
}
//l2, bottom right to top left
if ((l2x1in > l2x2in) && (l2y1in < l2y2in))
{
l2x1 = l2x2in;
l2y1 = l2y2in;
l2x2 = l2x1in;
l2y2 = l2y1in;
}
// | * | 1
if ((l1x1 == l1x2) && (l2x1 == l2x2)) { fall = 1; }
// | * - 2
else if ((l1x1 == l1x2) && (l2y1 == l2y2)) { fall = 2; }
// | * / 3
else if ((l1x1 == l1x2) && (l2y1 < l2y2)) { fall = 3; }
// | * \ 4
else if ((l1x1 == l1x2) && (l2y1 > l2y2)) { fall = 4; }
// - * | 5
else if ((l1y1 == l1y2) && (l2x1 == l2x2)) { fall = 5; }
// - * - 6
else if ((l1y1 == l1y2) && (l2y1 == l2y2)) { fall = 6; }
// - * / 7
else if ((l1y1 == l1y2) && (l2y1 < l2y2)) { fall = 7; }
// - * \ 8
else if ((l1y1 == l1y2) && (l2y1 > l2y2)) { fall = 8; }
// / * | 9
else if ((l1y1 < l1y2) && (l2x1 == l2x2)) { fall = 9; }
// / * - 10
else if ((l1y1 < l1y2) && (l2y1 == l2y2)) { fall = 10; }
// / * / 11
else if ((l1y1 < l1y2) && (l2y1 < l2y2)) { fall = 11; }
// / * \ 12
else if ((l1y1 < l1y2) && (l2y1 > l2y2)) { fall = 12; }
// \ * | 13
else if ((l1y1 > l1y2) && (l2x1 == l2x2)) { fall = 13; }
// \ * - 14
else if ((l1y1 > l1y2) && (l2y1 == l2y2)) { fall = 14; }
// \ * / 15
else if ((l1y1 > l1y2) && (l2y1 < l2y2)) { fall = 15; }
// \ * \ 16
else if ((l1y1 > l1y2) && (l2y1 > l2y2)) { fall = 16; }
switch (fall)
{
// hv * vh 1,2,5,6
case 1: case 2: case 5: case 6:
{
//no content neccessary by purpose
break;
}
// | * x 3,4
case 3: case 4:
{
c = (l2y2 - l2y1) / (l2x2 - l2x1);
d = l2y1 - (c * l2x1);
xs = l1x1;
ys = (c * xs) + d;
break;
}
// x * | 9,13
case 9: case 13:
{
a = (l1y2 - l1y1) / (l1x2 - l1x1);
b = l1y1 - (a * l1x1);
xs = l2x1;
ys = (a * xs) + b;
break;
}
case 7: case 8: case 10: case 11: case 12: case 14: case 15: case 16:
{
a = (l1y2 - l1y1) / (l1x2 - l1x1);
c = (l2y2 - l2y1) / (l2x2 - l2x1);
b = l1y1 - (a * l1x1);
d = l2y1 - (c * l2x1);
if (a == c)
{
if (b == d)
{ deckung = true; }
else { deckung = false;
parallel = true; }
}
else { xs = (d - b) / (a - c); }
ys = (a * xs) + b;
break;
}
default:
{
//cannot be reached
break;
}
}
switch (fall)
{
// | * | 1
case 1:
{
if ((l1x1 == l2x1) && (((l2y1 >= l1y1) && (l2y1 <= l1y2)) || ((l2y2 >= l1y1) && (l2y2 <= l1y2))))
{ crossed = true; }
else
{ crossed = false; }
break;
}
// | * - 2
case 2:
{
if (((l2y1 >= l1y1) && (l2y1 <= l1y2)) && ((l1x1 >= l2x1) && (l1x1 <= l2x2)))
{ crossed = true; }
else
{ crossed = false; }
break;
}
// - * | 5
case 5:
{
if (((l2x1 >= l1x1) && (l2x1 <= l1x2)) && ((l1y1 >= l2y1) && (l1y1 <= l2y2)))
{ crossed = true; }
else
{ crossed = false; }
break;
}
// - * - 6
case 6:
{
if ((l1y1 == l2y1) && (((l2x1 >= l1x1) && (l2x1 <= l1x2)) || ((l2x2 >= l1x1) && (l2x2 <= l1x2))))
{ crossed = true; }
else
{ crossed = false; }
break;
}
// | * / 3, | * \ 4
case 3: case 4:
{
if ((ys >= l1y1) && (ys <= l1y1))
{ crossed = true; }
else
{ crossed = false; }
break;
}
// / * | 9, \ * | 13
case 9: case 13:
{
if ((ys >= l2y1) && (ys <= l2y2))
{ crossed = true; }
else
{ crossed = false; }
break;
}
// up-up
case 10: case 7: case 11:
{
if (parallel) { crossed = false; }
else if (deckung)
{
if (((l2x1 >= l1x1) && (l2x1 <= l1x2)) || ((l2x2 >= l1x1) && (l2x2 <= l1x2)))
{ crossed = true; }
else { crossed = false; }
}
else
{
if ((((xs >= l1x1) && (xs <= l1x2)) && ((ys >= l1y1) && (ys <= l1y2))) &&
(((xs >= l2x1) && (xs <= l2x2)) && ((ys >= l2y1) && (ys <= l2y2))))
{ crossed = true; }
else
{ crossed = false; }
}
break;
}
// up-down
case 12:
{
if ((((xs >= l1x1) && (xs <= l1x2)) && ((ys >= l1y1) && (ys <= l1y2))) &&
(((xs >= l2x1) && (xs <= l2x2)) && ((ys <= l2y1) && (ys >= l2y2))))
{ crossed = true; }
else
{ crossed = false; }
break;
}
// down-up
case 15:
{
if ((((xs >= l1x1) && (xs <= l1x2)) && ((ys <= l1y2) && (ys >= l1y2))) &&
(((xs >= l2x1) && (xs <= l2x2)) && ((ys >= l2y1) && (ys <= l2y2))))
{ crossed = true; }
else
{ crossed = false; }
break;
}
// down-down
case 16: case 14: case 8:
{
if (parallel) { crossed = false; }
else if (deckung)
{
if (((l2x1 >= l1x1) && (l2x1 <= l1x2)) || ((l2x2 >= l1x1) && (l2x2 <= l1x2)))
{ crossed = true; }
else { crossed = false; }
}
else
{
if ((((xs <= l1x1) && (xs >= l1x2)) && ((ys <= l1y1) && (ys >= l1y2))) &&
(((xs <= l2x1) && (xs >= l2x2)) && ((ys <= l2y1) && (ys >= l2y2))))
{ crossed = true; }
else { crossed = false; }
}
break;
}
//zero
default:
{
//cannot be reached
break;
}
}
if (crossed)
{
System.out.println ("the lines do cross or at least touch");
}
else
{
System.out.println ("the lines neither cross nor touch");
}
}
}
Solid Experiments 