The yield keyword in Python is used in a function to turn it into a generator. A generator is a type of iterable, like a list or tuple, but it does not store its values in memory all at once. Instead, it generates each value on the fly, one at a time, as needed, using the yield statement.<\/p>\n
When a function contains yield, it becomes a generator function, which doesn’t return a value all at once. Instead, it produces a sequence of results lazily, one at a time, each time the yield statement is encountered. This is a powerful tool for handling large data sets or streams of data where you don’t want to store everything in memory at once.<\/p>\n
Common Simple Example of yield:<\/strong><\/p>\n Output:<\/strong><\/p>\n Here, count_up_to yields values from 1 to max, one at a time. The function pauses after each yield and resumes when the next value is requested in the loop.<\/p>\n Consider the following method with yield:<\/p>\n What happens here? Example of How the Caller Interacts with yield:<\/strong><\/p>\n Here, candidates.extend() calls _get_child_candidates and collects nodes one at a time through the generator\u2019s yield.<\/p>\n The yield keyword in Python is used in a function to turn it into a generator. A generator is a type of iterable, like a list or tuple, but it does not store its values in memory all at once. Instead, it generates each value on the fly, one at a time, as needed, using […]<\/p>\n","protected":false},"author":1,"featured_media":11794,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"inline_featured_image":false,"footnotes":""},"categories":[16],"tags":[],"class_list":["post-11793","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-python"],"acf":[],"_links":{"self":[{"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/posts\/11793"}],"collection":[{"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/comments?post=11793"}],"version-history":[{"count":1,"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/posts\/11793\/revisions"}],"predecessor-version":[{"id":11795,"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/posts\/11793\/revisions\/11795"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/media\/11794"}],"wp:attachment":[{"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/media?parent=11793"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/categories?post=11793"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.bacancytechnology.com\/qanda\/wp-json\/wp\/v2\/tags?post=11793"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}def count_up_to(max):\r\n count = 1\r\n while count <= max:\r\n yield count\r\n count += 1\r\n\r\ncounter = count_up_to(5)\r\nfor num in counter:\r\n print(num)<\/pre>\n
\r\n1\r\n2\r\n3\r\n4\r\n5\r\n<\/pre>\n
Another Example Breakdown:<\/h3>\n
\r\ndef _get_child_candidates(self, distance, min_dist, max_dist):\r\n if self._leftchild and distance - max_dist < self._median:\r\n yield self._leftchild\r\n if self._rightchild and distance + max_dist >= self._median:\r\n yield self._rightchild\r\n<\/pre>\n
\nInstead of returning a list of child nodes, the function yields each child node one by one based on the conditions.
\nEach call to _get_child_candidates will return a single child node when the conditions are met, and the function pauses until the next call.<\/p>\n\r\nresult, candidates = [], [self]\r\nwhile candidates:\r\n node = candidates.pop()\r\n distance = node._get_dist(obj)\r\n if distance <= max_dist and distance >= min_dist:\r\n result.extend(node._values)\r\n candidates.extend(node._get_child_candidates(distance, min_dist, max_dist))\r\nreturn result\r\n<\/pre>\n
What Happens When _get_child_candidates is Called?<\/h3>\n
\n