IGNITE-15922 Implement NUMA-aware allocator

[ivandasch]

Thank you for submitting the pull request to the Apache Ignite.

In order to streamline the review of the contribution
we ask you to ensure the following steps have been taken:

The Contribution Checklist

• There is a single JIRA ticket related to the pull request.
• The web-link to the pull request is attached to the JIRA ticket.
• The JIRA ticket has the Patch Available state.
• The pull request body describes changes that have been made.
  The description explains WHAT and WHY was made instead of HOW.
• The pull request title is treated as the final commit message.
  The following pattern must be used: IGNITE-XXXX Change summary where XXXX - number of JIRA issue.
• A reviewer has been mentioned through the JIRA comments
  (see the Maintainers list)
• The pull request has been checked by the Teamcity Bot and
  the green visa attached to the JIRA ticket (see TC.Bot: Check PR)

Notes

• How to Contribute
• Coding abbreviation rules
• Coding Guidelines
• Apache Ignite Teamcity Bot

If you need any help, please email dev@ignite.apache.org or ask anу advice on http://asf.slack.com #ignite channel.

[SammyVimes]

Looks good! But I think some parts should be a little bit more documented

[SammyVimes]

I don't quite get where this class is used. I see that it captures the position in a bitset and an object of the Reference is returned by the [] op. Is it used in the internals of the libnuma?

[ivandasch]

Now it is not used. This is quite common technique (see i.e. bitset implementation in libstdc++) to implement non-const operator[]. With it you can do somethin like this

BitSet a, b;
a[0] = true;
for (size_t i = 0; i < a.Size() && i < b.Size(); ++i) {
     a[i] = !b[i];
}

But this functionality is not used so far, it is for probably future uses

[rpuch]

Great contribution! Just a couple of comments from my side (not mandatory, obviously).