Definition: Near the extreme
I came across this sentence in Tech article which describes a feature of List element:
Accessing elements is very fast near the extremes of the list
What does near the extremes mean in this sentence?
meaning
add a comment |
I came across this sentence in Tech article which describes a feature of List element:
Accessing elements is very fast near the extremes of the list
What does near the extremes mean in this sentence?
meaning
Extreme: 'furthest from the centre or a given point'
– marcellothearcane
5 hours ago
add a comment |
I came across this sentence in Tech article which describes a feature of List element:
Accessing elements is very fast near the extremes of the list
What does near the extremes mean in this sentence?
meaning
I came across this sentence in Tech article which describes a feature of List element:
Accessing elements is very fast near the extremes of the list
What does near the extremes mean in this sentence?
meaning
meaning
asked 6 hours ago
Sarvar NishonboevSarvar Nishonboev
1062
1062
Extreme: 'furthest from the centre or a given point'
– marcellothearcane
5 hours ago
add a comment |
Extreme: 'furthest from the centre or a given point'
– marcellothearcane
5 hours ago
Extreme: 'furthest from the centre or a given point'
– marcellothearcane
5 hours ago
Extreme: 'furthest from the centre or a given point'
– marcellothearcane
5 hours ago
add a comment |
1 Answer
1
active
oldest
votes
as far as i can tell this must come from a programming context and near the extremes may from my understanding only mean near the outer boundaries:
reason:
in programming a list could be represented with Arrays.
at least in c Arrays are just pointers to the first Array element.
accessing the first element is therefor very fast (no Need to add an Offset to the address of the list to get to the list element's address before dereferencing the pointer)
why accessing the say last element should be fast as well i can not tell may be a feature of the language used.
why accessing the say 3rd list element should be easy (in say a 50 List-Elements long list ) should be fast as well i can only wonder About (Maybe a Thing with caches)
where as i can understand that accessing the say 25th list element may require a) math to get to the address and b) may require a read from Memory because of a so called Cache-miss. this then takes compareably longer …
Hope this answers the Question.
New contributor
der bender is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "97"
};
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
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2fenglish.stackexchange.com%2fquestions%2f487961%2fdefinition-near-the-extreme%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
as far as i can tell this must come from a programming context and near the extremes may from my understanding only mean near the outer boundaries:
reason:
in programming a list could be represented with Arrays.
at least in c Arrays are just pointers to the first Array element.
accessing the first element is therefor very fast (no Need to add an Offset to the address of the list to get to the list element's address before dereferencing the pointer)
why accessing the say last element should be fast as well i can not tell may be a feature of the language used.
why accessing the say 3rd list element should be easy (in say a 50 List-Elements long list ) should be fast as well i can only wonder About (Maybe a Thing with caches)
where as i can understand that accessing the say 25th list element may require a) math to get to the address and b) may require a read from Memory because of a so called Cache-miss. this then takes compareably longer …
Hope this answers the Question.
New contributor
der bender is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
as far as i can tell this must come from a programming context and near the extremes may from my understanding only mean near the outer boundaries:
reason:
in programming a list could be represented with Arrays.
at least in c Arrays are just pointers to the first Array element.
accessing the first element is therefor very fast (no Need to add an Offset to the address of the list to get to the list element's address before dereferencing the pointer)
why accessing the say last element should be fast as well i can not tell may be a feature of the language used.
why accessing the say 3rd list element should be easy (in say a 50 List-Elements long list ) should be fast as well i can only wonder About (Maybe a Thing with caches)
where as i can understand that accessing the say 25th list element may require a) math to get to the address and b) may require a read from Memory because of a so called Cache-miss. this then takes compareably longer …
Hope this answers the Question.
New contributor
der bender is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
as far as i can tell this must come from a programming context and near the extremes may from my understanding only mean near the outer boundaries:
reason:
in programming a list could be represented with Arrays.
at least in c Arrays are just pointers to the first Array element.
accessing the first element is therefor very fast (no Need to add an Offset to the address of the list to get to the list element's address before dereferencing the pointer)
why accessing the say last element should be fast as well i can not tell may be a feature of the language used.
why accessing the say 3rd list element should be easy (in say a 50 List-Elements long list ) should be fast as well i can only wonder About (Maybe a Thing with caches)
where as i can understand that accessing the say 25th list element may require a) math to get to the address and b) may require a read from Memory because of a so called Cache-miss. this then takes compareably longer …
Hope this answers the Question.
New contributor
der bender is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
as far as i can tell this must come from a programming context and near the extremes may from my understanding only mean near the outer boundaries:
reason:
in programming a list could be represented with Arrays.
at least in c Arrays are just pointers to the first Array element.
accessing the first element is therefor very fast (no Need to add an Offset to the address of the list to get to the list element's address before dereferencing the pointer)
why accessing the say last element should be fast as well i can not tell may be a feature of the language used.
why accessing the say 3rd list element should be easy (in say a 50 List-Elements long list ) should be fast as well i can only wonder About (Maybe a Thing with caches)
where as i can understand that accessing the say 25th list element may require a) math to get to the address and b) may require a read from Memory because of a so called Cache-miss. this then takes compareably longer …
Hope this answers the Question.
New contributor
der bender is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
der bender is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 5 hours ago
der benderder bender
292
292
New contributor
der bender is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
der bender is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
der bender is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
Thanks for contributing an answer to English Language & Usage 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.
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%2fenglish.stackexchange.com%2fquestions%2f487961%2fdefinition-near-the-extreme%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
Extreme: 'furthest from the centre or a given point'
– marcellothearcane
5 hours ago