Macaulay2 / Macaulay2/M2

O(1) list and sequence operations

Open
#2,561 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Interpreter
Dominant language
Macaulay2
Stars
435
Forks
297
Avg merge
4d 20h
Merged PRs (30d)
11

Description

Here is an example of a simple operation involving lists and sequences which should really be an O(1) operation. There are many others like it.

i1 : elapsedTime(10^8:0);
 -- 0.466494 seconds elapsed
---
i1 : elapsedTime toList toSequence toList(10^8:0);
 -- 2.20352 seconds elapsed

Related: #1608, #1904, #1978

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by profiling the list and sequence conversions shown in the example, comparing the direct elapsedTime call with the chained toList/toSequence/toList operation. Review the related issues #1608, #1904, and #1978 to determine the intended scope; done should mean the identified operations have O(1) behavior without changing their results.

Written by the indexing model from the issue text.

Assessment

Domain
performance
Issue type
Refactor
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.