1. 24 Mar, 2023 1 commit
  2. 22 Mar, 2023 2 commits
  3. 05 Mar, 2023 2 commits
  4. 01 Mar, 2023 4 commits
  5. 27 Feb, 2023 1 commit
  6. 24 Feb, 2023 1 commit
  7. 23 Feb, 2023 1 commit
  8. 15 Feb, 2023 1 commit
  9. 23 Jan, 2023 1 commit
  10. 19 Jan, 2023 2 commits
  11. 17 Jan, 2023 2 commits
  12. 11 Jan, 2023 4 commits
  13. 10 Jan, 2023 4 commits
  14. 09 Jan, 2023 3 commits
  15. 06 Jan, 2023 1 commit
  16. 02 Jan, 2023 1 commit
  17. 30 Dec, 2022 1 commit
  18. 21 Dec, 2022 1 commit
  19. 20 Dec, 2022 2 commits
    • Ivan Tyagov's avatar
      Relicense to GPLv3+ with wide exception for all Free Software / Open Source... · bbbbbf07
      Ivan Tyagov authored
      Relicense to GPLv3+ with wide exception for all Free Software / Open Source projects + Business options.
      
      See merge request !105
      bbbbbf07
    • Kirill Smelkov's avatar
      Relicense to GPLv3+ with wide exception for all Free Software / Open Source... · 542dacba
      Kirill Smelkov authored
      Relicense to GPLv3+ with wide exception for all Free Software / Open Source projects + Business options.
      
      Nexedi stack is licensed under Free Software licenses with various exceptions
      that cover three business cases:
      
      - Free Software
      - Proprietary Software
      - Rebranding
      
      As long as one intends to develop Free Software based on Nexedi stack, no
      license cost is involved. Developing proprietary software based on Nexedi stack
      may require a proprietary exception license. Rebranding Nexedi stack is
      prohibited unless rebranding license is acquired.
      
      Through this licensing approach, Nexedi expects to encourage Free Software
      development without restrictions and at the same time create a framework for
      proprietary software to contribute to the long term sustainability of the
      Nexedi stack.
      
      Please see https://www.nexedi.com/licensing for details, rationale and options.
      542dacba
  20. 19 Dec, 2022 1 commit
  21. 15 Dec, 2022 3 commits
    • Xiaowu Zhang's avatar
      Data mapping · 072d0780
      Xiaowu Zhang authored
      See merge request nexedi/wendelin!104
      072d0780
    • Xiaowu Zhang's avatar
      erp5_wendelin: set business_application/big_data to data mapping · 09f481a6
      Xiaowu Zhang authored
      same as others
      09f481a6
    • Xiaowu Zhang's avatar
      erp5_wendelin: add data mapping · ed280d8d
      Xiaowu Zhang authored
      data mapping is used to map complex data into a single value
      
      the idea is if an object has complet data to process, like (object, value1, value2, value3,value4....), we can mapping (object, value1, value2, value3,value4....) into a single value X, then we process only X to make it faster
      
      here is an use case:
      
      we have two 2D data arrays with 5 columns, the first column is the name of object, the other fours are the differents value of this object
      
      Data ArrayA:
      
      | object | value1 | value2 | value3 | value4 |
      | ------ | ------ | ------ | ------ | ------ |
      | X | 1 | 2 | 3 | 4 |
      | Y | 5 |  6 | 7 | 8 |
      | Z | 9 |  10 | 11 | 12 |
      
      Data ArrayB:
      
      | object | value1 | value2 | value3 | value4 |
      | ------ | ------ | ------ | ------ | ------ |
      | X | 1 | 2 | 3 | 4 |
      | Y | 5 |  8 | 7 | 8 |
      | Z | 9 |  10 | 192 | 12 |
      
      now we need to compare data array A to data array B to find which object inside A has different value.
      
      without data mapping, we need to compare each object's 4 values, the complexity is O(2^n)
      
      with data mapping:
      
      we map those values:
      
      (X, 1, 2, 3, 4)  ==> 1
      
      (Y, 5, 6, 7, 8)  ==> 2
      
      (Z, 9, 10, 11,12) ==>3
      
      (Y, 5, 8, 7, 8) ==> 4
      
      (Z, 9, 10, 192, 12) ==> 5
      
      Data ArrayA:
      
      | object |
      | ------ |
      | 1 |
      | 2 |
      | 3 |
      
      Data ArrayB:
      
      | object |
      | ------ |
      | 1 |
      | 4 |
      | 5 |
      
      then compare 1D array is fast, the complexity is O(n)
      ed280d8d
  22. 14 Dec, 2022 1 commit