Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
dunixir
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
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
teaching
dunixir
Commits
086b3e59
Commit
086b3e59
authored
4 years ago
by
Julien29121998
Browse files
Options
Downloads
Patches
Plain Diff
BR_G40-41-43 no test
parent
5c5240cb
No related branches found
No related tags found
No related merge requests found
Pipeline
#1341
failed
4 years ago
Stage: test
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
lib/local_augmentation_example.ex
+64
-31
64 additions, 31 deletions
lib/local_augmentation_example.ex
with
64 additions
and
31 deletions
lib/local_augmentation_example.ex
+
64
−
31
View file @
086b3e59
defmodule
Index
.
Augmentation
do
defmodule
IndexUtility
do
#################################################
#
# Utility functions
#
#################################################
def
range
(
start_number
,
end_number
,
global_bindex
)
do
# records are order by number DESC
bindexes_records
=
:dets
.
match
(
global_bindex
,
{
:_
,
:"$1"
})
|>
List
.
flatten
()
|>
Enum
.
sort
(
&
(
&1
.
number
>
&2
.
number
))
end_number
=
min
(
end_number
,
length
(
bindexes_records
))
# theRange is a list contains bindex's key, its format likes [%{issuer: "a", issuersFrame: 3, number: 2},%{issuer: "b", issuersFrame: 2, number: 1}]
if
start_number
==
1
do
Enum
.
slice
(
bindexes_records
,
-
end_number
..
0
)
# Enum.reverse(the_range)
else
Enum
.
slice
(
bindexes_records
,
-
end_number
..
(
-
start_number
+
1
))
# Enum.reverse(the_range)
end
end
def
find_first_local_bindex_entry
(
local_bindex
)
do
key
=
:ets
.
first
(
local_bindex
)
:ets
.
lookup
(
local_bindex
,
key
)
end
def
duniter_reduce
(
records
)
do
Enum
.
reduce
(
records
,%{},
&
Map
.
merge
(
&2
,
&1
))
end
end
defmodule
BIndex
do
def
conf
,
do
:
ConfDTO
.
mockConfDTO
()
## BR_G01
...
...
@@ -274,37 +307,6 @@ defmodule Index.Augmentation do
end
end
defmodule
IndexUtility
do
#################################################
#
# Utility functions
#
#################################################
def
range
(
start_number
,
end_number
,
global_bindex
)
do
# records are order by number DESC
bindexes_records
=
:dets
.
match
(
global_bindex
,
{
:_
,
:"$1"
})
|>
List
.
flatten
()
|>
Enum
.
sort
(
&
(
&1
.
number
>
&2
.
number
))
end_number
=
min
(
end_number
,
length
(
bindexes_records
))
# theRange is a list contains bindex's key, its format likes [%{issuer: "a", issuersFrame: 3, number: 2},%{issuer: "b", issuersFrame: 2, number: 1}]
if
start_number
==
1
do
Enum
.
slice
(
bindexes_records
,
-
end_number
..
0
)
# Enum.reverse(the_range)
else
Enum
.
slice
(
bindexes_records
,
-
end_number
..
(
-
start_number
+
1
))
# Enum.reverse(the_range)
end
end
def
find_first_local_bindex_entry
(
local_bindex
)
do
key
=
:ets
.
first
(
local_bindex
)
:ets
.
lookup
(
local_bindex
,
key
)
end
def
duniter_reduce
(
records
)
do
Enum
.
reduce
(
records
,%{},
&
Map
.
merge
(
&2
,
&1
))
end
end
defmodule
IIndex
do
## BR_G20
def
uidUnique
(
local_iindex
,
global_iindex
,
key
)
do
...
...
@@ -391,8 +393,39 @@ defmodule Index.Augmentation do
|>
(
fn
x
->
Map
.
merge
(
entry
,
%{
toNewcomer:
x
!=
0
})
end
)
.
()
|>
(
&
:ets
.
insert
(
local_cindex
,
{
key
,
&1
}))
.
()
end
def
fromMember
(
local_cindex
,
global_iindex
,
key
)
do
# Get the entry waiting to be verified
[{
key
,
entry
}]
=
:ets
.
lookup
(
local_cindex
,
key
)
fromMember_data
=
:ets
.
match
(
global_iindex
,
{
:"$1"
,
%{
pub:
entry
.
issuer
}})
|>
Enum
.
map
(
&
:ets
.
lookup
(
global_iindex
,
&1
))
|>
IndexUtility
.
duniter_reduce
()
|>
Map
.
get
(
:member
)
:ets
.
insert
(
local_cindex
,
{
key
,
Map
.
merge
(
entry
,
%{
fromMember:
fromMember_data
})})
end
def
toMember
(
local_cindex
,
global_iindex
,
key
)
do
# Get the entry waiting to be verified
[{
key
,
entry
}]
=
:ets
.
lookup
(
local_cindex
,
key
)
toMember_data
=
:ets
.
match
(
global_iindex
,
{
:"$1"
,
%{
pub:
entry
.
issuer
}})
|>
Enum
.
map
(
&
:ets
.
lookup
(
global_iindex
,
&1
))
|>
IndexUtility
.
duniter_reduce
()
|>
Map
.
get
(
:member
)
:ets
.
insert
(
local_cindex
,
{
key
,
Map
.
merge
(
entry
,
%{
toMember:
toMember_data
})})
end
def
toLeaver
(
local_cindex
,
local_mindex
,
key
)
do
# Get the entry waiting to be verified
[{
key
,
entry
}]
=
:ets
.
lookup
(
local_cindex
,
key
)
toLeaver_data
=
:ets
.
match
(
local_mindex
,
{
:"$1"
,
%{
pub:
entry
.
receiver
}})
|>
Enum
.
map
(
&
:ets
.
lookup
(
local_mindex
,
&1
))
|>
IndexUtility
.
duniter_reduce
()
|>
Map
.
get
(
:leaving
)
:ets
.
insert
(
local_cindex
,
{
key
,
Map
.
merge
(
entry
,
%{
toLeaver:
toLeaver_data
})})
end
end
defmodule
SIndex
do
def
checkUnitBase
(
local_sindex
,
global_bindex
,
key
)
do
# Get the entry waiting to be verified
...
...
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