🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 14 (from laksa002)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa014.int.ahrefs:8124/' \
  -H 'Content-Type: text/plain' \
  -H 'X-ClickHouse-Database: crawler3' \
  -H 'Authorization: Basic YXBpOg==' \
  -d 'SELECT getAhrefsURLFromUnparsed(src_unparsed) AS found_url, ifNull(toUnixTimestamp(download_stamp), 0) AS crawl_time, ifNull(toUnixTimestamp(props_url_first_seen), 0) AS first_indexed_time, download_http_code AS http_code, src_unparsed AS src_unparsed, src_root_hash AS src_root_hash, history_drop_reason AS history_drop_reason, meta_title AS meta_title, meta_descriptions AS meta_descriptions, attrs_boilerpipe_text AS attrs_boilerpipe_text, attrs_markdown AS attrs_markdown, attrs_readable_markdown AS attrs_readable_markdown, meta_canonical AS meta_canonical FROM crawler3.page_info_local FINAL PREWHERE (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://cplusplus.com/forum/beginner/30696/\')), getAhrefsUnparsedNoserviceFromURL(\'https://cplusplus.com/forum/beginner/30696/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/cplusplus.com\/forum\/beginner\/30696\/","crawl_time":1774275098,"first_indexed_time":1731898835,"http_code":200,"src_unparsed":"com,cplusplus!\/forum\/beginner\/30696\/ s443","src_root_hash":"7671136614093794214","history_drop_reason":null,"meta_title":"Queues, adding and deleting elements - C++ Forum","meta_descriptions":[],"attrs_boilerpipe_text":"Forum\nBeginners\nQueues, adding and deleting elements\nQueues, adding and deleting elements\nHello all,\nI have a quiz regarding queues tomorrow and am still questions the notation for a given addElement & deleteElement function. I understand the concept behind queues but am stuck on how to turn it into code. For example, in order to add an element to a given queue would you write a function something like this?:\naddElement (int & rear, int jeffsQ[], int newEl)\n{\nif (!fullStack())\n{ rear ++; \/\/this is where confusion arises\nQ[rear] = newEl;\n}\nelse\ncout << \"The stack is full\" << endl;\n}\nI know the syntax might not be correct but I am confused on whether or not I just need to increase the rear by 1 or to use the modular formula (because of the specific problem of the front being the same as the rear in some cases) which looks like this..\nrear = (rear+1) % maxQueueSize;\nThe computer science-y definition of a queue is a FIFO.  Implemented as an array, you need two \"pointers\": one\nthat \"points\" to the first used index and one that \"points\" to the last used index.  This, with just a little bit\nof thought, should give you the answer.\nIf not, consider a simple example.  Suppose the array has 5 elements.  What should the queue look like after\neach of the following steps:\nadd element (value = 42)\nadd element (value = 999)\nadd element (value = 36)\nremove element [value returned is 42]\nadd element (value = 64)\nadd element (value = 100)\nadd element (value = 123456789)\nThat makes much more sense. Thank you. However, what should I code in order to make a boolean function that returns whether the queue is full. Would it be?:\nbool fullQueue(int &front, int &front)\n{\nreturn rear == front - 1;\n}\nWhat is rear and front set to when the queue is empty?\nStarting with those values, if you run the above steps I gave you with pencil and paper, you end up with the queue being\nfull.  What are the values of rear and front at that time?\nOh I see, my teacher had us initialize the front and rear to -1 for some reason. Is that a problem or should I set them to 0 each?\nIt's not a problem.\nSo, if rear == front == -1 (not C++ expression!), then the queue is empty.\nAfter the first line above (add element), what will rear and front be set to?\nTopic archived. No new replies allowed.","attrs_markdown":"[cplusplus .com](https:\/\/cplusplus.com\/)\n\n- [TUTORIALS](https:\/\/cplusplus.com\/doc\/)\n- [REFERENCE](https:\/\/cplusplus.com\/reference\/)\n- [ARTICLES](https:\/\/cplusplus.com\/articles\/)\n- [FORUM](https:\/\/cplusplus.com\/forum\/)\n\n### **[C++](https:\/\/cplusplus.com\/)**\n- [Tutorials](https:\/\/cplusplus.com\/doc\/)\n- [Reference](https:\/\/cplusplus.com\/reference\/)\n- [Articles](https:\/\/cplusplus.com\/articles\/)\n- [Forum](https:\/\/cplusplus.com\/forum\/)\n\n### **[Forum](https:\/\/cplusplus.com\/forum\/)**\n- [**Beginners**](https:\/\/cplusplus.com\/forum\/beginner\/)\n- [**Windows Programming**](https:\/\/cplusplus.com\/forum\/windows\/)\n- [**UNIX\/Linux Programming**](https:\/\/cplusplus.com\/forum\/unices\/)\n- [**General C++ Programming**](https:\/\/cplusplus.com\/forum\/general\/)\n- [**Lounge**](https:\/\/cplusplus.com\/forum\/lounge\/)\n- [**Jobs**](https:\/\/cplusplus.com\/forum\/jobs\/)\n\n- [Forum](https:\/\/cplusplus.com\/forum\/)\n- [Beginners](https:\/\/cplusplus.com\/forum\/beginner\/)\n- Queues, adding and deleting elements\n\n### Queues, adding and deleting elements\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/beginner\/30696\/#msg166334 \"Link to this post\")\n\nOct 28, 2010 at 9:14pm UTC\n\n[**jheffer44** (4)](https:\/\/cplusplus.com\/user\/jheffer44\/)\n\nHello all,   \n I have a quiz regarding queues tomorrow and am still questions the notation for a given addElement & deleteElement function. I understand the concept behind queues but am stuck on how to turn it into code. For example, in order to add an element to a given queue would you write a function something like this?:   \n   \n addElement (int & rear, int jeffsQ\\[\\], int newEl)  \n {  \n if (!fullStack())  \n { rear ++; \/\/this is where confusion arises  \n Q\\[rear\\] = newEl;  \n }  \n else   \n cout \\<\\< \"The stack is full\" \\<\\< endl;  \n }  \n   \n I know the syntax might not be correct but I am confused on whether or not I just need to increase the rear by 1 or to use the modular formula (because of the specific problem of the front being the same as the rear in some cases) which looks like this..   \n rear = (rear+1) % maxQueueSize;\n\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/beginner\/30696\/#msg166359 \"Link to this post\")\n\nOct 28, 2010 at 10:17pm UTC\n\n[**jsmith** (5804)](https:\/\/cplusplus.com\/user\/jsmith\/)\n\nThe computer science-y definition of a queue is a FIFO. Implemented as an array, you need two \"pointers\": one  \n that \"points\" to the first used index and one that \"points\" to the last used index. This, with just a little bit  \n of thought, should give you the answer.  \n   \n If not, consider a simple example. Suppose the array has 5 elements. What should the queue look like after  \n each of the following steps:  \n   \n add element (value = 42)  \n add element (value = 999)  \n add element (value = 36)  \n remove element \\[value returned is 42\\]  \n add element (value = 64)  \n add element (value = 100)  \n add element (value = 123456789)\n\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/beginner\/30696\/#msg166370 \"Link to this post\")\n\nOct 28, 2010 at 10:55pm UTC\n\n[**jheffer44** (4)](https:\/\/cplusplus.com\/user\/jheffer44\/)\n\nThat makes much more sense. Thank you. However, what should I code in order to make a boolean function that returns whether the queue is full. Would it be?:  \n   \n bool fullQueue(int \\&front, int \\&front)  \n {  \n return rear == front - 1;  \n }\n\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/beginner\/30696\/#msg166374 \"Link to this post\")\n\nOct 28, 2010 at 11:19pm UTC\n\n[**jsmith** (5804)](https:\/\/cplusplus.com\/user\/jsmith\/)\n\nWhat is rear and front set to when the queue is empty?  \n   \n Starting with those values, if you run the above steps I gave you with pencil and paper, you end up with the queue being  \n full. What are the values of rear and front at that time?\n\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/beginner\/30696\/#msg166384 \"Link to this post\")\n\nOct 29, 2010 at 12:30am UTC\n\n[**jheffer44** (4)](https:\/\/cplusplus.com\/user\/jheffer44\/)\n\nOh I see, my teacher had us initialize the front and rear to -1 for some reason. Is that a problem or should I set them to 0 each?\n\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/beginner\/30696\/#msg166493 \"Link to this post\")\n\nOct 29, 2010 at 1:48pm UTC\n\n[**jsmith** (5804)](https:\/\/cplusplus.com\/user\/jsmith\/)\n\nIt's not a problem.  \n   \n So, if rear == front == -1 (not C++ expression!), then the queue is empty.  \n   \n After the first line above (add element), what will rear and front be set to?\n\nTopic archived. No new replies allowed.\n\n[Home page](https:\/\/cplusplus.com\/) \\| [Privacy policy](https:\/\/cplusplus.com\/privacy.do)  \n© cplusplus.com, 2000-2025 - All rights reserved - *v3.3.3*  \n[Spotted an error? contact us](https:\/\/cplusplus.com\/contact.do?referrer=cplusplus.com%2Fforum%2Fbeginner%2F30696%2F)","attrs_readable_markdown":null,"meta_canonical":null}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📄

INDEXABLE

✅

CRAWLED

14 days ago

🤖

ROBOTS ALLOWED

Page Info Filters

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	PASS	`download_stamp > now() - 6 MONTH`	0.5 months ago
History drop	PASS	`isNull(history_drop_reason)`	No drop reason
Spam/ban	PASS	`fh_dont_index != 1 AND ml_spam_score = 0`	ml_spam_score=0
Canonical	PASS	`meta_canonical IS NULL OR = '' OR = src_unparsed`	Not set

Page Details

Property	Value
URL	https://cplusplus.com/forum/beginner/30696/
Last Crawled	2026-03-23 14:11:38 (14 days ago)
First Indexed	2024-11-18 03:00:35 (1 year ago)
HTTP Status Code	200
Meta Title	Queues, adding and deleting elements - C++ Forum
Meta Description	null
Meta Canonical	null
Boilerpipe Text	Forum Beginners Queues, adding and deleting elements Queues, adding and deleting elements Hello all, I have a quiz regarding queues tomorrow and am still questions the notation for a given addElement & deleteElement function. I understand the concept behind queues but am stuck on how to turn it into code. For example, in order to add an element to a given queue would you write a function something like this?: addElement (int & rear, int jeffsQ[], int newEl) { if (!fullStack()) { rear ++; //this is where confusion arises Q[rear] = newEl; } else cout << "The stack is full" << endl; } I know the syntax might not be correct but I am confused on whether or not I just need to increase the rear by 1 or to use the modular formula (because of the specific problem of the front being the same as the rear in some cases) which looks like this.. rear = (rear+1) % maxQueueSize; The computer science-y definition of a queue is a FIFO. Implemented as an array, you need two "pointers": one that "points" to the first used index and one that "points" to the last used index. This, with just a little bit of thought, should give you the answer. If not, consider a simple example. Suppose the array has 5 elements. What should the queue look like after each of the following steps: add element (value = 42) add element (value = 999) add element (value = 36) remove element [value returned is 42] add element (value = 64) add element (value = 100) add element (value = 123456789) That makes much more sense. Thank you. However, what should I code in order to make a boolean function that returns whether the queue is full. Would it be?: bool fullQueue(int &front, int &front) { return rear == front - 1; } What is rear and front set to when the queue is empty? Starting with those values, if you run the above steps I gave you with pencil and paper, you end up with the queue being full. What are the values of rear and front at that time? Oh I see, my teacher had us initialize the front and rear to -1 for some reason. Is that a problem or should I set them to 0 each? It's not a problem. So, if rear == front == -1 (not C++ expression!), then the queue is empty. After the first line above (add element), what will rear and front be set to? Topic archived. No new replies allowed.
Markdown	[cplusplus .com](https://cplusplus.com/) - [TUTORIALS](https://cplusplus.com/doc/) - [REFERENCE](https://cplusplus.com/reference/) - [ARTICLES](https://cplusplus.com/articles/) - [FORUM](https://cplusplus.com/forum/) ### [C++](https://cplusplus.com/) - [Tutorials](https://cplusplus.com/doc/) - [Reference](https://cplusplus.com/reference/) - [Articles](https://cplusplus.com/articles/) - [Forum](https://cplusplus.com/forum/) ### [Forum](https://cplusplus.com/forum/) - [Beginners](https://cplusplus.com/forum/beginner/) - [Windows Programming](https://cplusplus.com/forum/windows/) - [UNIX/Linux Programming](https://cplusplus.com/forum/unices/) - [General C++ Programming](https://cplusplus.com/forum/general/) - [Lounge](https://cplusplus.com/forum/lounge/) - [Jobs](https://cplusplus.com/forum/jobs/) - [Forum](https://cplusplus.com/forum/) - [Beginners](https://cplusplus.com/forum/beginner/) - Queues, adding and deleting elements ### Queues, adding and deleting elements [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/beginner/30696/#msg166334 "Link to this post") Oct 28, 2010 at 9:14pm UTC [jheffer44 (4)](https://cplusplus.com/user/jheffer44/) Hello all, I have a quiz regarding queues tomorrow and am still questions the notation for a given addElement & deleteElement function. I understand the concept behind queues but am stuck on how to turn it into code. For example, in order to add an element to a given queue would you write a function something like this?: addElement (int & rear, int jeffsQ\[\], int newEl) { if (!fullStack()) { rear ++; //this is where confusion arises Q\[rear\] = newEl; } else cout \<\< "The stack is full" \<\< endl; } I know the syntax might not be correct but I am confused on whether or not I just need to increase the rear by 1 or to use the modular formula (because of the specific problem of the front being the same as the rear in some cases) which looks like this.. rear = (rear+1) % maxQueueSize; [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/beginner/30696/#msg166359 "Link to this post") Oct 28, 2010 at 10:17pm UTC [jsmith (5804)](https://cplusplus.com/user/jsmith/) The computer science-y definition of a queue is a FIFO. Implemented as an array, you need two "pointers": one that "points" to the first used index and one that "points" to the last used index. This, with just a little bit of thought, should give you the answer. If not, consider a simple example. Suppose the array has 5 elements. What should the queue look like after each of the following steps: add element (value = 42) add element (value = 999) add element (value = 36) remove element \[value returned is 42\] add element (value = 64) add element (value = 100) add element (value = 123456789) [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/beginner/30696/#msg166370 "Link to this post") Oct 28, 2010 at 10:55pm UTC [jheffer44 (4)](https://cplusplus.com/user/jheffer44/) That makes much more sense. Thank you. However, what should I code in order to make a boolean function that returns whether the queue is full. Would it be?: bool fullQueue(int \&front, int \&front) { return rear == front - 1; } [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/beginner/30696/#msg166374 "Link to this post") Oct 28, 2010 at 11:19pm UTC [jsmith (5804)](https://cplusplus.com/user/jsmith/) What is rear and front set to when the queue is empty? Starting with those values, if you run the above steps I gave you with pencil and paper, you end up with the queue being full. What are the values of rear and front at that time? [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/beginner/30696/#msg166384 "Link to this post") Oct 29, 2010 at 12:30am UTC [jheffer44 (4)](https://cplusplus.com/user/jheffer44/) Oh I see, my teacher had us initialize the front and rear to -1 for some reason. Is that a problem or should I set them to 0 each? [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/beginner/30696/#msg166493 "Link to this post") Oct 29, 2010 at 1:48pm UTC [jsmith (5804)](https://cplusplus.com/user/jsmith/) It's not a problem. So, if rear == front == -1 (not C++ expression!), then the queue is empty. After the first line above (add element), what will rear and front be set to? Topic archived. No new replies allowed. [Home page](https://cplusplus.com/) \\| [Privacy policy](https://cplusplus.com/privacy.do) © cplusplus.com, 2000-2025 - All rights reserved - v3.3.3 [Spotted an error? contact us](https://cplusplus.com/contact.do?referrer=cplusplus.com%2Fforum%2Fbeginner%2F30696%2F)
Readable Markdown	null
Shard	14 (laksa)
Root Hash	7671136614093794214
Unparsed URL	com,cplusplus!/forum/beginner/30696/ s443