Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

https://gitlab.inria.fr/line/aide-group/macrovsa
16 May 2026, 22:45:59 UTC
  • Code
  • Branches (1)
  • Releases (0)
  • Visits
    • Branches
    • Releases
    • HEAD
    • refs/heads/master
    No releases to show
  • d85ce8c
  • /
  • src
  • /
  • AssociativeMap.hpp
Raw File Download Save again
Take a new snapshot of a software origin

If the archived software origin currently browsed is not synchronized with its upstream version (for instance when new commits have been issued), you can explicitly request Software Heritage to take a new snapshot of it.

Use the form below to proceed. Once a request has been submitted and accepted, it will be processed as soon as possible. You can then check its processing state by visiting this dedicated page.
swh spinner

Processing "take a new snapshot" request ...

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • content
  • directory
  • revision
  • snapshot
origin badgecontent badge
swh:1:cnt:39ecb232d4e9f0a1c4748a36e4b9a88d1c7e2b41
origin badgedirectory badge
swh:1:dir:b8157120e03f8858febdc76e496e300e843c5750
origin badgerevision badge
swh:1:rev:31a87d848f8ab28a06ccf77d0b359fc966974138
origin badgesnapshot badge
swh:1:snp:ffb1e6ef77e78b82672462770a7171c80c299b3b

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • content
  • directory
  • revision
  • snapshot
(requires biblatex-software package)
Generating citation ...
(requires biblatex-software package)
Generating citation ...
(requires biblatex-software package)
Generating citation ...
(requires biblatex-software package)
Generating citation ...
Tip revision: 31a87d848f8ab28a06ccf77d0b359fc966974138 authored by vthierry on 15 December 2025, 21:31:50 UTC
sync from makefile
Tip revision: 31a87d8
AssociativeMap.hpp
#ifndef __macrovsa_AssociativeMap__
#define __macrovsa_AssociativeMap__

#include "Symbol.hpp"
#include "Bundling.hpp"
#include "Binding.hpp"
#include <map>

namespace macrovsa {
  /**
   * @class AssociativeMap
   * @description Implements a macroscopic ersatz of a VSA associative map.
   * - An associative map is created adding new key/value pairs of symbol.
   * - It is implemented via [Bundling](./Bundling.html) and [Binding](./Binding.html), without using a C++ `std::map`.
   * @extends Bundling
   * @param {string} [name] An optional name. By default, a `#index` unique name is generated.
   */
  class AssociativeMap: public Symbol {
    // Non assignable
    AssociativeMap& operator = (const AssociativeMap&) = delete;
    // Binding map to accelerate the get function with remanence mechanism
    std::unordered_map < unsigned int, std::pair < const Symbol *, std::unordered_map < unsigned int, Symbol * >> > values;
    // Symbol remamence
    mutable Symbols symbols;
    // Bundling mirror
    mutable Bundling bundling;
    mutable bool values_changed = false;
public:
    AssociativeMap() : Symbol("", associativemap) {}
    AssociativeMap(String name) : Symbol(name, associativemap) {}
    AssociativeMap(const AssociativeMap&);
    virtual ~AssociativeMap() {}
    virtual const Belief& getBelief() const;
    virtual void setBelief(double tau, double sigma);
    virtual bool equals(const Symbol& symbol, char what = 'i') const;
    virtual void setVector(double *vector) const;

    /**
     * @function add
     * @memberof AssociativeMap
     * @instance
     * @description Adds a new symbol pair to the container.
     * - Adding twice the same key/value pair corresponds to adding their belief level `tau`.
     * @param {Symbol} key The symbol key to add or modify.
     * @param {Symbol} value The symbol value to add.
     */
    void add(const Symbol& key, const Symbol& value);

    /**
     * @function erase
     * @memberof AssociativeMap
     * @instance
     * @description Erases a symbol in the container.
     * @param {Symbol} [key] The symbol key to add or modify.
     * - Without key argument erases all keys.
     */
    virtual void erase(const Symbol& key);
    virtual void clear();

    /**
     * @function get
     * @memberof AssociativeMap
     * @instance
     * @description Returns an approximate value of the associative map by unbinding.
     * - For a map with `>_i B_(y_i) x_i` returns
     *    - `x_i` if `y_i` is a map key mapping only one symbol.
     *    - `>_(i_j) x_(i_j)` if `y_i` is a map key mapping several symbols `x_(i_j)`.
     *    - `B(y_i~) >_j B_(y_j) x_j` if `y_i` is not a map key.
     * @param {Symbol|String} key The symbol key `y_i`.
     * @return {Symbol} value A reference to the stored value, available until program end.
     * - If several values associated to a key, it is returned as a bundling.
     */
    const Symbol& get(const Symbol& key) const;
    const Symbol& get(String key) const
    {
      Symbol *skey = new Symbol(key);
      const Symbol& result = get(*skey);
      delete skey;
      return result;
    }
    /**
     * @function get
     * @memberof AssociativeMap
     * @instance
     * @description Defines an iterator over the associative map symbols, used in a construct of the form:
     * ```
     *  for(auto it = associativeMap.get().cbegin(); it != associativeMap.get().cend(); it++) {
     *    const Symbol& key = *(it->second.first);
     *     for(auto jt = it->second.second.cbegin(); jt != it->second.second.cend(); jt++) {
     *       const Symbol& value = *(jt->second);
     *    ../..
     *  }
     * ```
     * - This is NOT a VSA plausible operation (unless another List data structure is used) by a debugging function.
     * - A map can have several values for one key, combined in the values bundling.
     * @return A `const std::unordered_map < unsigned int, std::pair < const Symbol *, std::unordered_map < unsigned int, Symbol * >>> &` reference for associative map iteration.
     */
    const std::unordered_map < unsigned int, std::pair < const Symbol *, std::unordered_map < unsigned int, Symbol * >> >& get() const {
      return values;
    }

    /**
     * @function getBundling
     * @memberof AssociativeMap
     * @instance
     * @description Returns the bundling representation of this associative map.
     * @return {Bundling} A reference to the bundling representation.
     */
    const Bundling& getBundling() const;

    /**
     * @function getSize
     * @memberof AssociativeMap
     * @instance
     * @description Returns the number of key-value pairs this associative map.
     * @return {uint} The number of key-value pairs.
     */
    unsigned int getSize() const;

    /**
     * @function asString
     * @memberof AssociativeMap
     * @instance
     * @description Returns the value as a string.
     * @return {String} A string of the form `{ key: value ...}_<belief>`, omitting the belief if `tau=1, sigma=0`.
     */
    virtual std::string asString() const;
  };
}

#endif

back to top

Software Heritage — Copyright (C) 2015–2026, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API