This PR is to submit the first draft of the linked list module for stdlib.
This is based upon #68 by Milan, #463 by me.

I have been working on this module as a part of my GSoC Project.
All my work was regularly updated on my personal repository that I have been sharing with everyone in my weekly report.
Link to my repository (here).
A bit detailed project report is available (here).
List of all the weekly Blogs - (here)

The module was tested in two compilers, intel oneAPI and gfortran.

How should we review this best? While there is an implementation I don't find a specification, examples or tests in this PR.

Hi Sebastian, Chetan and I can work on that - the documentation resides in his own repository together with the workplan, but let us distill a version that is suitable for reviewing the . We have a meeting planned for this friday, mainly for preparing the conference, but this may be a second topic. Op ma 13 sep. 2021 om 23:29 schreef Sebastian Ehlert < ***@***.***>:

…

How should we review this best? While there is an implementation I don't find a specification, examples or tests in this PR. — You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on <#491 (comment)>, or unsubscribe <https://.com/notifications/unsubscribe-auth/AAN6YR3ZNUGNWGZWTMDXGTTUBZUKTANCNFSM5CRFTFJA> . Triage notifications on the go with Mobile for iOS <https://apps.apple.com/app/apple-store/id1477376905?ct=notification-email&mt=8&pt=524675> or Android <https://play.google.com/store/apps/details?id=com..android&referrer=utm_campaign%3Dnotification-email%26utm_medium%3Demail%26utm_source%3D>.

Any update on this feature?

I have not been in a position yet to follow on this. I want to contact @chetan karwa ***@***.***> about it, but my workload has not diminished enough that I can actually spare the energy yet. Op zo 19 dec. 2021 om 13:46 schreef Sebastian Ehlert < ***@***.***>:

…

Any update on this feature? — Reply to this email directly, view it on <#491 (comment)>, or unsubscribe <https://.com/notifications/unsubscribe-auth/AAN6YR4ZYWPHQOBJUUCMVNDURXHZBANCNFSM5CRFTFJA> . Triage notifications on the go with Mobile for iOS <https://apps.apple.com/app/apple-store/id1477376905?ct=notification-email&mt=8&pt=524675> or Android <https://play.google.com/store/apps/details?id=com..android&referrer=utm_campaign%3Dnotification-email%26utm_medium%3Demail%26utm_source%3D>. You are receiving this because you commented.Message ID: ***@***.***>

This linked list is very good 👍 and can store almost any data type, I leave a little suggestion based on my limited knowledge, maybe not quite right :)

[zoziha]

Suggested change

	nullify (this_child_list%head, this_child_list%tail)

It seems that the head and tail of the linked list need to be blanked here, otherwise an error will be reported when a new push node is pushed again.

[zoziha]

Suggested change

	deallocate(current_node)
	call current_node%clear()
	deallocate(current_node)

It seems that the destruction of the current node content should be added here.

[zoziha]

Maybe a routine can be abstracted here, allowing the user to customize the way to get the contents of the linked list?

...
generic :: get => get_node_at_index, &
                  get_node_at_index_user
procedure, private :: get_node_at_index, &
                      get_node_at_index_user
...
abstract interface
        subroutine get_value(this_item, return_item)
            class(*), intent(in) :: this_item
            class(*), intent(out) :: return_item
        end subroutine get_value
end interface
...
subroutine get_node_at_index_user(this_list, node_index, func, return_item)
        class(child_list), intent(inout) :: this_list
        integer, intent(in) :: node_index
        procedure(get_value) :: func
        class(*), intent(out) :: return_item
        type(node), pointer :: curr_node
        integer index

        curr_node => this_list%head
        index = 1
        do while (associated(curr_node))
            if (index == node_index) then
                call func(curr_node%item, return_item)
                nullify (curr_node)
                return
            end if

            curr_node => curr_node%next
            index = index + 1
        end do
        nullify (curr_node)

end subroutine get_node_at_index_user
...

The user can use it like this:

program main

    use linked_list_m, only: child_list, rk, ik
    implicit none
    real(rk) :: x
    integer(ik) :: n

    type(this_child) :: list
    print *, list%size()

    call list%push(1.0_rk)
    call list%push(2_ik)

    call list%get(1, get_value, x)
    call list%get(2, get_value, n)

    print *, x, n, list%size()

contains

    subroutine get_value(this_item, return_item)
        class(*), intent(in) :: this_item
        class(*), intent(out) :: return_item

        select type (this_item)
        type is (real(rk))
            select type (return_item)
            type is (real(rk))
                return_item = this_item
            class default
                print *, '*<ERROR>* get_value: type mismatch'
            end select
        type is (integer(ik))
            select type (return_item)
            type is (integer(ik))
                return_item = this_item
            class default
                print *, '*<ERROR>* get_value: type mismatch'
            end select
        class default
            print *, "*<ERROR>* get_value: invalid type"
        end select

    end subroutine get_value

end program main

[zoziha]

source uses the optional argument new_item here, there may be memory access errors.

I guess this PR has become stale. Since we already have a decent implementation here, should we try to update the PR, address the review comments and get it merged?

I guess this PR has become stale. Since we already have a decent implementation here, should we try to update the PR, address the review comments and get it merged?

Maybe @arjenmarkus / @chetan has some news/updates. Specs and tests are mainly missing.

I have (finally, sigh ;)) started setting up a test program. The documentation will follow with it.