🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 14 (from laksa192)

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/general/279537/\')), getAhrefsUnparsedNoserviceFromURL(\'https://cplusplus.com/forum/general/279537/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/cplusplus.com\/forum\/general\/279537\/","crawl_time":1767196857,"first_indexed_time":1629331897,"http_code":200,"src_unparsed":"com,cplusplus!\/forum\/general\/279537\/ s443","src_root_hash":"7671136614093794214","history_drop_reason":null,"meta_title":"Remove 2 elements from a queue - C++ Forum","meta_descriptions":[],"attrs_boilerpipe_text":"\nUnfortunately I can’t post all the code because it’s from a big exam theme from 4 years ago and the first step was about to open a text file and create a queue of items, too big to post it. I already made these 2 points and I need help for this third. \nI have this queue of items. Every item into the queue have a name and an height  \n(United States,127.2) (United States,120.1) (United States,100.2)  \n(United States,98.8 ) (United States,91.1) (United States,91.5) (United  \nStates,91.6) (United States,126.7) (United States,55.5) (United States,50.6) (United States,48.9) (United States,41.2) (United States,39.1) (United  \nStates,49.4) (United States,46.3) (United States,43.8 ) \nMy output should be : \nThat’s because I dequeue 2 elements from the queue i and j. If i <92 I have to remove it from the queue and if j > i I also have to remove j from the queue. This because i and j rapresents the height of the items. I have to analyse 2 items from the queue every time , If the height of the second item is bigger than the height of the first item , I have to cancel j. \n(United States,91.1) (United States,91.5) (United States,91.6)  \n(United States,126.7) (United States,55.5) (United States,50.6) (United  \nStates,48.9) (United States,41.2) (United States,39.1) (United States,49.4) (United States,46.3) (United States,43.8 ) \nThe operations I can do it are enqueue ( insert a element from the top ) , dequeue ( remove an element from the bottom ) and I have length that’s the length of the queue. I hope , this time , to be more specific. Sorry for my terrible English, I’m Italian \n","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- [General C++ Programming](https:\/\/cplusplus.com\/forum\/general\/)\n- Remove 2 elements from a queue\n\n### Remove 2 elements from a queue\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/general\/279537\/#msg1207815 \"Link to this post\")\n\nAug 18, 2021 at 5:01am UTC\n\n[**ellosma** (3)](https:\/\/cplusplus.com\/user\/ellosma\/)\n\nI have a Lqueue queue from which I have to remove all elements (of type Item) with a height\\> 92 and also I have to remove all elements that have a greater height than the previous element (it does not apply to the first element). for example if I have:  \n   \n (United States,127.2) (United States,120.1) (United States,100.2)   \n (United States,98.8 ) (United States,91.1) (United States,91.5) (United   \n States,91.6) (United States,126.7) (United States,55.5) (United States,50.6) (United States,48.9) (United States,41.2) (United States,39.1) (United   \n States,49.4) (United States,46.3) (United States,43.8 )  \n   \n My output should be :  \n   \n (United States,91.1) (United States,91.5) (United States,91.6)   \n (United States,126.7) (United States,55.5) (United States,50.6) (United   \n States,48.9) (United States,41.2) (United States,39.1) (United States,49.4) (United States,46.3) (United States,43.8 )  \n   \n   \n For the first part I tried made  \n   \n for (int i = 0; i \\< Q1.length(); i++) {  \n   \n if (temp.getcode() \\< '92') {  \n   \n Q1.dequeue();  \n   \n }  \n }  \n   \n But in this case I made the opposite I should. The program print some ( and not all ) of the elements that it should cancel. The second part I have no idea how to do it because i can only use enqueue (inserting an element, but from the head), dequeue (removing an element, from the queue), length (indicating the length of the queue), frontValue (indicating the first element of the queue), clear to clear all elements present in the queue.\n\nLast edited on\n\nAug 18, 2021 at 5:12am UTC\n\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/general\/279537\/#msg1207832 \"Link to this post\")\n\nAug 18, 2021 at 8:41am UTC\n\n[**lastchance** (6980)](https:\/\/cplusplus.com\/user\/lastchance\/)\n\nYou haven't shown remotely enough code and your Lqueue (linked-list queue) seems a bit of a weird data structure; we have no details of it or how to test it.  \n   \n In the minimal loop you have shown:  \n - what is the variable\n\ntemp\n\n?  \n - why do you suppose\n\ndequeue()\n\n(which presumably removes something from the front of the queue) should act on the element you are trying to get rid of?  \n - for something based on a linked list it is unusual to use an index-based loop counter ... especially one terminating at a value that keeps changing, as you would not then cover all elements of the data structure.  \n   \n It may be simpler to construct a new Lqueue from the elements that you wish to keep. However, you haven't given enough code to provide much of an answer to your question.  \n   \n   \n BTW. Get used to using code tags.\n\nLast edited on\n\nAug 18, 2021 at 8:46am UTC\n\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/general\/279537\/#msg1207834 \"Link to this post\")\n\nAug 18, 2021 at 9:12am UTC\n\n[**ellosma** (3)](https:\/\/cplusplus.com\/user\/ellosma\/)\n\nUnfortunately I can’t post all the code because it’s from a big exam theme from 4 years ago and the first step was about to open a text file and create a queue of items, too big to post it. I already made these 2 points and I need help for this third.  \n   \n I have this queue of items. Every item into the queue have a name and an height   \n (United States,127.2) (United States,120.1) (United States,100.2)   \n (United States,98.8 ) (United States,91.1) (United States,91.5) (United   \n States,91.6) (United States,126.7) (United States,55.5) (United States,50.6) (United States,48.9) (United States,41.2) (United States,39.1) (United   \n States,49.4) (United States,46.3) (United States,43.8 )  \n   \n My output should be :  \n   \n That’s because I dequeue 2 elements from the queue i and j. If i \\<92 I have to remove it from the queue and if j \\> i I also have to remove j from the queue. This because i and j rapresents the height of the items. I have to analyse 2 items from the queue every time , If the height of the second item is bigger than the height of the first item , I have to cancel j.  \n   \n (United States,91.1) (United States,91.5) (United States,91.6)   \n (United States,126.7) (United States,55.5) (United States,50.6) (United   \n States,48.9) (United States,41.2) (United States,39.1) (United States,49.4) (United States,46.3) (United States,43.8 )  \n   \n   \n The operations I can do it are enqueue ( insert a element from the top ) , dequeue ( remove an element from the bottom ) and I have length that’s the length of the queue. I hope , this time , to be more specific. Sorry for my terrible English, I’m Italian\n\nLast edited on\n\nAug 18, 2021 at 9:14am UTC\n\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/general\/279537\/#msg1207842 \"Link to this post\")\n\nAug 18, 2021 at 10:41am UTC\n\n[**lastchance** (6980)](https:\/\/cplusplus.com\/user\/lastchance\/)\n\n|   |\n|---|\n| This because i and j rapresents the height of the items. |\n\nNot if i is a loop variable it isn't.  \n   \n   \n The simplest way using only enqueue, dequeue, frontvalue and length is to traverse your original loop from the front (using frontvalue and dequeue) and construct a new queue with the desired elements (using enqueue).\n\n[![](https:\/\/cplusplus.com\/img\/link.png)](https:\/\/cplusplus.com\/forum\/general\/279537\/#msg1207845 \"Link to this post\")\n\nAug 18, 2021 at 11:42am UTC\n\n[**ellosma** (3)](https:\/\/cplusplus.com\/user\/ellosma\/)\n\nThis is what I wrote , the output is correct only partially. This print all the correct items but also some items that are not correct. I have to use only one queue. I have to insert some loop at the end of if but with break I obtained the same things\n\nLast edited on\n\nAug 20, 2021 at 7:49am UTC\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%2Fgeneral%2F279537%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

3 months 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`	3.3 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/general/279537/
Last Crawled	2025-12-31 16:00:57 (3 months ago)
First Indexed	2021-08-19 00:11:37 (4 years ago)
HTTP Status Code	200
Meta Title	Remove 2 elements from a queue - C++ Forum
Meta Description	null
Meta Canonical	null
Boilerpipe Text	Unfortunately I can’t post all the code because it’s from a big exam theme from 4 years ago and the first step was about to open a text file and create a queue of items, too big to post it. I already made these 2 points and I need help for this third. I have this queue of items. Every item into the queue have a name and an height (United States,127.2) (United States,120.1) (United States,100.2) (United States,98.8 ) (United States,91.1) (United States,91.5) (United States,91.6) (United States,126.7) (United States,55.5) (United States,50.6) (United States,48.9) (United States,41.2) (United States,39.1) (United States,49.4) (United States,46.3) (United States,43.8 ) My output should be : That’s because I dequeue 2 elements from the queue i and j. If i <92 I have to remove it from the queue and if j > i I also have to remove j from the queue. This because i and j rapresents the height of the items. I have to analyse 2 items from the queue every time , If the height of the second item is bigger than the height of the first item , I have to cancel j. (United States,91.1) (United States,91.5) (United States,91.6) (United States,126.7) (United States,55.5) (United States,50.6) (United States,48.9) (United States,41.2) (United States,39.1) (United States,49.4) (United States,46.3) (United States,43.8 ) The operations I can do it are enqueue ( insert a element from the top ) , dequeue ( remove an element from the bottom ) and I have length that’s the length of the queue. I hope , this time , to be more specific. Sorry for my terrible English, I’m Italian
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/) - [General C++ Programming](https://cplusplus.com/forum/general/) - Remove 2 elements from a queue ### Remove 2 elements from a queue [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/general/279537/#msg1207815 "Link to this post") Aug 18, 2021 at 5:01am UTC [ellosma (3)](https://cplusplus.com/user/ellosma/) I have a Lqueue queue from which I have to remove all elements (of type Item) with a height\> 92 and also I have to remove all elements that have a greater height than the previous element (it does not apply to the first element). for example if I have: (United States,127.2) (United States,120.1) (United States,100.2) (United States,98.8 ) (United States,91.1) (United States,91.5) (United States,91.6) (United States,126.7) (United States,55.5) (United States,50.6) (United States,48.9) (United States,41.2) (United States,39.1) (United States,49.4) (United States,46.3) (United States,43.8 ) My output should be : (United States,91.1) (United States,91.5) (United States,91.6) (United States,126.7) (United States,55.5) (United States,50.6) (United States,48.9) (United States,41.2) (United States,39.1) (United States,49.4) (United States,46.3) (United States,43.8 ) For the first part I tried made for (int i = 0; i \< Q1.length(); i++) { if (temp.getcode() \< '92') { Q1.dequeue(); } } But in this case I made the opposite I should. The program print some ( and not all ) of the elements that it should cancel. The second part I have no idea how to do it because i can only use enqueue (inserting an element, but from the head), dequeue (removing an element, from the queue), length (indicating the length of the queue), frontValue (indicating the first element of the queue), clear to clear all elements present in the queue. Last edited on Aug 18, 2021 at 5:12am UTC [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/general/279537/#msg1207832 "Link to this post") Aug 18, 2021 at 8:41am UTC [lastchance (6980)](https://cplusplus.com/user/lastchance/) You haven't shown remotely enough code and your Lqueue (linked-list queue) seems a bit of a weird data structure; we have no details of it or how to test it. In the minimal loop you have shown: - what is the variable temp ? - why do you suppose dequeue() (which presumably removes something from the front of the queue) should act on the element you are trying to get rid of? - for something based on a linked list it is unusual to use an index-based loop counter ... especially one terminating at a value that keeps changing, as you would not then cover all elements of the data structure. It may be simpler to construct a new Lqueue from the elements that you wish to keep. However, you haven't given enough code to provide much of an answer to your question. BTW. Get used to using code tags. Last edited on Aug 18, 2021 at 8:46am UTC [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/general/279537/#msg1207834 "Link to this post") Aug 18, 2021 at 9:12am UTC [ellosma (3)](https://cplusplus.com/user/ellosma/) Unfortunately I can’t post all the code because it’s from a big exam theme from 4 years ago and the first step was about to open a text file and create a queue of items, too big to post it. I already made these 2 points and I need help for this third. I have this queue of items. Every item into the queue have a name and an height (United States,127.2) (United States,120.1) (United States,100.2) (United States,98.8 ) (United States,91.1) (United States,91.5) (United States,91.6) (United States,126.7) (United States,55.5) (United States,50.6) (United States,48.9) (United States,41.2) (United States,39.1) (United States,49.4) (United States,46.3) (United States,43.8 ) My output should be : That’s because I dequeue 2 elements from the queue i and j. If i \<92 I have to remove it from the queue and if j \> i I also have to remove j from the queue. This because i and j rapresents the height of the items. I have to analyse 2 items from the queue every time , If the height of the second item is bigger than the height of the first item , I have to cancel j. (United States,91.1) (United States,91.5) (United States,91.6) (United States,126.7) (United States,55.5) (United States,50.6) (United States,48.9) (United States,41.2) (United States,39.1) (United States,49.4) (United States,46.3) (United States,43.8 ) The operations I can do it are enqueue ( insert a element from the top ) , dequeue ( remove an element from the bottom ) and I have length that’s the length of the queue. I hope , this time , to be more specific. Sorry for my terrible English, I’m Italian Last edited on Aug 18, 2021 at 9:14am UTC [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/general/279537/#msg1207842 "Link to this post") Aug 18, 2021 at 10:41am UTC [lastchance (6980)](https://cplusplus.com/user/lastchance/) \| \| \|---\| \| This because i and j rapresents the height of the items. \| Not if i is a loop variable it isn't. The simplest way using only enqueue, dequeue, frontvalue and length is to traverse your original loop from the front (using frontvalue and dequeue) and construct a new queue with the desired elements (using enqueue). [![](https://cplusplus.com/img/link.png)](https://cplusplus.com/forum/general/279537/#msg1207845 "Link to this post") Aug 18, 2021 at 11:42am UTC [ellosma (3)](https://cplusplus.com/user/ellosma/) This is what I wrote , the output is correct only partially. This print all the correct items but also some items that are not correct. I have to use only one queue. I have to insert some loop at the end of if but with break I obtained the same things Last edited on Aug 20, 2021 at 7:49am UTC 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%2Fgeneral%2F279537%2F)
Readable Markdown	null
Shard	14 (laksa)
Root Hash	7671136614093794214
Unparsed URL	com,cplusplus!/forum/general/279537/ s443