Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
A
ad
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Peter Gerwinski
ad
Commits
6d0c863a
Commit
6d0c863a
authored
May 5, 2022
by
Peter Gerwinski
Browse files
Options
Downloads
Patches
Plain Diff
Aktualisiertes Testprogramm für Hash-Tabellen, 5.5.2022
parent
e234b44b
No related branches found
No related tags found
No related merge requests found
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
20220505/hash-map-test-02.c
+97
-0
97 additions, 0 deletions
20220505/hash-map-test-02.c
20220505/hash-map-test-03.c
+106
-0
106 additions, 0 deletions
20220505/hash-map-test-03.c
with
203 additions
and
0 deletions
20220505/hash-map-test-02.c
0 → 100644
+
97
−
0
View file @
6d0c863a
#include
<stdio.h>
#include
<errno.h>
#include
<error.h>
#include
<string.h>
#include
<stdint.h>
#include
<stdlib.h>
const
int
ERROR
=
-
1
;
const
int
size
=
1117
;
const
int
bufsize
=
100
;
int
n
[
size
];
// zunächst: alle 0
const
char
*
check
[
size
];
// zunächst: alle NULL
constexpr
int
hash
(
const
char
*
name
)
{
// Cantor pairing function
uint8_t
n0
=
name
?
name
[
0
]
:
0
;
uint8_t
n1
=
n0
?
name
[
1
]
:
0
;
uint8_t
n2
=
n1
?
name
[
2
]
:
0
;
return
((
n0
+
n1
)
/
2
*
(
n0
+
n1
+
1
)
+
n2
)
%
size
;
}
void
put_number
(
const
char
*
name
,
int
value
)
{
int
idx
=
hash
(
name
);
if
(
check
[
idx
]
&&
strcmp
(
check
[
idx
],
name
)
!=
0
)
fprintf
(
stderr
,
"occupied: %s = %d
\n
"
,
name
,
value
);
else
{
check
[
idx
]
=
name
;
n
[
idx
]
=
value
;
}
}
int
get_number
(
const
char
*
name
)
{
int
value
=
ERROR
;
int
idx
=
hash
(
name
);
if
(
check
[
idx
]
&&
strcmp
(
check
[
idx
],
name
)
==
0
)
value
=
n
[
idx
];
else
fprintf
(
stderr
,
"not found: %s
\n
"
,
name
);
return
value
;
}
static
void
read_data
(
FILE
*
f
,
char
**
name
,
int
*
value
)
{
int
v
;
char
buffer
[
bufsize
];
int
bytes_read_1
=
fscanf
(
f
,
"%d"
,
&
v
);
char
*
bytes_read_2
=
fgets
(
buffer
,
bufsize
-
1
,
f
);
int
l
=
strlen
(
buffer
);
if
(
l
>
0
&&
buffer
[
l
-
1
]
==
'\n'
)
buffer
[
l
-
1
]
=
0
;
const
char
*
n
=
buffer
;
while
(
n
[
0
]
==
' '
)
n
++
;
l
=
strlen
(
n
);
if
(
l
<
30
)
printf
(
"l = %d, buffer =
\"
%s
\"
, bytes_read_1 = %d, bytes_read_2 = %zx, errno = %d
\n
"
,
l
,
buffer
,
bytes_read_1
,
(
size_t
)
bytes_read_2
,
errno
);
if
(
*
name
==
NULL
)
*
name
=
(
char
*
)
malloc
(
l
);
strncpy
(
*
name
,
n
,
l
+
1
);
*
value
=
v
;
}
int
main
(
int
argc
,
char
**
argv
)
{
const
char
*
filename
=
"hash-test.dat"
;
if
(
argc
>
1
)
filename
=
argv
[
1
];
FILE
*
f
=
fopen
(
filename
,
"r"
);
if
(
!
f
)
error
(
errno
,
errno
,
"cannot open file
\"
%s
\"
"
,
filename
);
while
(
!
feof
(
f
))
{
int
value
;
char
*
name
=
NULL
;
read_data
(
f
,
&
name
,
&
value
);
put_number
(
name
,
value
);
}
rewind
(
f
);
while
(
!
feof
(
f
))
{
int
value
;
char
name
[
bufsize
];
char
*
p
=
name
;
read_data
(
f
,
&
p
,
&
value
);
int
v
=
get_number
(
name
);
if
(
v
!=
value
)
printf
(
"%s: %d instead of %d
\n
"
,
name
,
v
,
value
);
}
fclose
(
f
);
return
0
;
}
This diff is collapsed.
Click to expand it.
20220505/hash-map-test-03.c
0 → 100644
+
106
−
0
View file @
6d0c863a
#include
<stdio.h>
#include
<errno.h>
#include
<error.h>
#include
<string.h>
#include
<stdint.h>
#include
<stdlib.h>
const
int
ERROR
=
-
1
;
const
int
size
=
1117
;
const
int
bufsize
=
100
;
int
n
[
size
];
// zunächst: alle 0
const
char
*
check
[
size
];
// zunächst: alle NULL
constexpr
int
hash
(
const
char
*
name
)
{
// Cantor pairing function
uint8_t
n0
=
name
?
name
[
0
]
:
0
;
uint8_t
n1
=
n0
?
name
[
1
]
:
0
;
uint8_t
n2
=
n1
?
name
[
2
]
:
0
;
return
((
n0
+
n1
)
/
2
*
(
n0
+
n1
+
1
)
+
n2
)
%
size
;
}
void
put_number
(
const
char
*
name
,
int
value
)
{
int
idx
=
hash
(
name
);
if
(
check
[
idx
]
&&
strcmp
(
check
[
idx
],
name
)
!=
0
)
fprintf
(
stderr
,
"occupied: %s = %d
\n
"
,
name
,
value
);
else
{
check
[
idx
]
=
name
;
n
[
idx
]
=
value
;
}
}
int
get_number
(
const
char
*
name
)
{
int
value
=
ERROR
;
int
idx
=
hash
(
name
);
if
(
check
[
idx
]
&&
strcmp
(
check
[
idx
],
name
)
==
0
)
value
=
n
[
idx
];
else
fprintf
(
stderr
,
"not found: %s
\n
"
,
name
);
return
value
;
}
static
void
read_data
(
FILE
*
f
,
char
**
name
,
int
*
value
)
{
int
v
;
char
buffer
[
bufsize
];
int
bytes_read_1
=
fscanf
(
f
,
"%d"
,
&
v
);
char
*
bytes_read_2
=
fgets
(
buffer
,
bufsize
-
1
,
f
);
if
(
bytes_read_1
<=
0
||
bytes_read_2
==
NULL
)
{
*
name
=
NULL
;
*
value
=
-
1
;
}
else
{
int
l
=
strlen
(
buffer
);
if
(
l
>
0
&&
buffer
[
l
-
1
]
==
'\n'
)
buffer
[
l
-
1
]
=
0
;
const
char
*
n
=
buffer
;
while
(
n
[
0
]
==
' '
)
n
++
;
l
=
strlen
(
n
);
if
(
*
name
==
NULL
)
*
name
=
(
char
*
)
malloc
(
l
);
strncpy
(
*
name
,
n
,
l
+
1
);
*
value
=
v
;
}
}
int
main
(
int
argc
,
char
**
argv
)
{
const
char
*
filename
=
"hash-test.dat"
;
if
(
argc
>
1
)
filename
=
argv
[
1
];
FILE
*
f
=
fopen
(
filename
,
"r"
);
if
(
!
f
)
error
(
errno
,
errno
,
"cannot open file
\"
%s
\"
"
,
filename
);
while
(
!
feof
(
f
))
{
int
value
;
char
*
name
=
NULL
;
read_data
(
f
,
&
name
,
&
value
);
if
(
value
>=
0
&&
name
)
put_number
(
name
,
value
);
}
rewind
(
f
);
while
(
!
feof
(
f
))
{
int
value
;
char
name
[
bufsize
];
char
*
p
=
name
;
read_data
(
f
,
&
p
,
&
value
);
if
(
value
>=
0
&&
name
)
{
int
v
=
get_number
(
name
);
if
(
v
!=
value
)
printf
(
"%s: %d instead of %d
\n
"
,
name
,
v
,
value
);
}
}
fclose
(
f
);
return
0
;
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment