Python: faster completion of loopData-pulling fuctionsLoop optimization for image processingNatural merge...
Accountant/ lawyer will not return my call
Am I not good enough for you?
Can I pump my MTB tire to max (55 psi / 380 kPa) without the tube inside bursting?
Conservation of Mass and Energy
Is it possible to avoid unpacking when merging Association?
What's the "normal" opposite of flautando?
How many characters using PHB rules does it take to be able to have access to any PHB spell at the start of an adventuring day?
Plausibility of Mushroom Buildings
Is it "Vierergruppe" or "Viergruppe", or is there a distinction?
Are tamper resistant receptacles really safer?
NASA's RS-25 Engines shut down time
How can I get players to stop ignoring or overlooking the plot hooks I'm giving them?
How to draw cubes in a 3 dimensional plane
When a wind turbine does not produce enough electricity how does the power company compensate for the loss?
Declaring and defining template, and specialising them
Do I really need to have a scientific explanation for my premise?
Do items de-spawn in Diablo?
Why does Captain Marvel assume the people on this planet know this?
Are there historical instances of the capital of a colonising country being temporarily or permanently shifted to one of its colonies?
Contract Factories
Word for a person who has no opinion about whether god exists
How to detect if C code (which needs 'extern C') is compiled in C++
Did Carol Danvers really receive a Kree blood tranfusion?
Makefile strange variable substitution
Python: faster completion of loop
Data-pulling fuctionsLoop optimization for image processingNatural merge sort in Java - follow-upVBA macro which filters and splits dataset into new workbooksIterate over million points to get unique closest pointCadbury problem solution in PythonGoogle FooBar XOR Checksum ChallengeIce Cream ParlorCount duplicates in a JavaScript arrayGrid search parameter combinations in Python
$begingroup$
I have a python code using which I need to count the number of ids in a a given range of timestamps as :
id_number=[]
for i in range(numbers):
indices=numpy.argwhere((a[i] >= dataset[:,0]) & (a[i] <= dataset[:,1]))
id_number.append(len(set(dataset[indices[:,0],2])))
Here, numbers is an integer indicating the length of the array (a) that has timestamps. dataset[:,0] and dataset[:,1] has starting and ending ranges for timestamps and I have to compute the unique ids for a timestamp from the dataset.
The issue is: it is taking approx 0.7 seconds for one loop iteration making it run for about 5 days based on the length of a.
Is there a way to optimize this code, for it to complete early.
python performance
New contributor
$endgroup$
add a comment |
$begingroup$
I have a python code using which I need to count the number of ids in a a given range of timestamps as :
id_number=[]
for i in range(numbers):
indices=numpy.argwhere((a[i] >= dataset[:,0]) & (a[i] <= dataset[:,1]))
id_number.append(len(set(dataset[indices[:,0],2])))
Here, numbers is an integer indicating the length of the array (a) that has timestamps. dataset[:,0] and dataset[:,1] has starting and ending ranges for timestamps and I have to compute the unique ids for a timestamp from the dataset.
The issue is: it is taking approx 0.7 seconds for one loop iteration making it run for about 5 days based on the length of a.
Is there a way to optimize this code, for it to complete early.
python performance
New contributor
$endgroup$
add a comment |
$begingroup$
I have a python code using which I need to count the number of ids in a a given range of timestamps as :
id_number=[]
for i in range(numbers):
indices=numpy.argwhere((a[i] >= dataset[:,0]) & (a[i] <= dataset[:,1]))
id_number.append(len(set(dataset[indices[:,0],2])))
Here, numbers is an integer indicating the length of the array (a) that has timestamps. dataset[:,0] and dataset[:,1] has starting and ending ranges for timestamps and I have to compute the unique ids for a timestamp from the dataset.
The issue is: it is taking approx 0.7 seconds for one loop iteration making it run for about 5 days based on the length of a.
Is there a way to optimize this code, for it to complete early.
python performance
New contributor
$endgroup$
I have a python code using which I need to count the number of ids in a a given range of timestamps as :
id_number=[]
for i in range(numbers):
indices=numpy.argwhere((a[i] >= dataset[:,0]) & (a[i] <= dataset[:,1]))
id_number.append(len(set(dataset[indices[:,0],2])))
Here, numbers is an integer indicating the length of the array (a) that has timestamps. dataset[:,0] and dataset[:,1] has starting and ending ranges for timestamps and I have to compute the unique ids for a timestamp from the dataset.
The issue is: it is taking approx 0.7 seconds for one loop iteration making it run for about 5 days based on the length of a.
Is there a way to optimize this code, for it to complete early.
python performance
python performance
New contributor
New contributor
New contributor
asked 8 mins ago
shaifali Guptashaifali Gupta
12
12
New contributor
New contributor
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
shaifali Gupta is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215234%2fpython-faster-completion-of-loop%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
shaifali Gupta is a new contributor. Be nice, and check out our Code of Conduct.
shaifali Gupta is a new contributor. Be nice, and check out our Code of Conduct.
shaifali Gupta is a new contributor. Be nice, and check out our Code of Conduct.
shaifali Gupta is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215234%2fpython-faster-completion-of-loop%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown