execute ->> code: gib das Resultat zurück
    end

    rect rgba(0, 255, 0, .1)
        code ->> function: say_hi(name="Rick", salutation="Mr.")
        function ->> execute: führe Code der Funktion aus
        execute ->> code: gib das Resultat zurück
    end

    rect rgba(0, 255, 255, .1)
        code ->> function: say_hi(name="Rick")
        function ->> code: gib das gespeicherte Resultat zurück
    end

labels.footer.copyright=&copy;2024 <a href="https://github.com/codelibs">CodeLibs Project</a>.
labels.search=Search
labels.similar_doc_result_status=Showing similar results.
labels.search_result_status=Results <b>{2}</b> - <b>{3}</b> of <b>{1}</b> for <b>{0}</b>
labels.search_result_status_over=Results <b>{2}</b> - <b>{3}</b> of over <b>{1}</b> for <b>{0}</b>
labels.search_result_time=({0} seconds)
labels.prev_page=Prev
labels.next_page=Next

        // Default constructor
    }

    /**
     * Executes the search log aggregation job.
     * Stores search logs using the SearchLogHelper and returns execution results.
     *
     * @return execution result message, empty if successful or error message if failed
     */
    public String execute() {
        final SearchLogHelper searchLogHelper = ComponentUtil.getSearchLogHelper();

                        if (file.exists()) {
                            results.add(file);
                        }
                    } catch (IOException e) {
                        log.debug("Error checking existence of: " + path, e);
                    }
                }
            }
        }
        
        return results;
    }
}
```

### 7.2 Hierarchical Cache Management
```java

/**
 * Implementation of HappyEyeballs Sorting Addresses.
 *
 * The current implementation does not address any of:
 *  - Async DNS split by IP class
 *  - Stateful handling of connectivity results
 *  - The prioritisation of addresses
 *
 * https://datatracker.ietf.org/doc/html/rfc8305#section-4
 */
internal fun reorderForHappyEyeballs(addresses: List<InetAddress>): List<InetAddress> {
  if (addresses.size < 2) {

  /**
   * Verify that the listener completes in a reasonable amount of time, and Asserts that the future
   * returns the expected data.
   *
   * @throws Throwable if the listener isn't called or if it resulted in a throwable or if the
   *     result doesn't match the expected value.
   */
  public void assertSuccess(Object expectedData) throws Throwable {
    // Verify that the listener executed in a reasonable amount of time.

	// Do a full recursive scan.
	Recursive bool

	// ReportNotFound will return errFileNotFound if all disks reports the BaseDir cannot be found.
	ReportNotFound bool

	// FilterPrefix will only return results with given prefix within folder.
	// Should never contain a slash.
	FilterPrefix string

	// ForwardTo will forward to the given object path.
	ForwardTo string

	// Limit the number of returned objects if > 0.

        PACDecodingException e = new PACDecodingException(cause);
        // When constructed with only a cause, the implementation passes (null, cause) to super
        // which results in a null message rather than deriving it from the cause
        assertNull(e.getMessage());
        assertSame(cause, e.getCause());
    }

    /**
     * Test the constructor with both a message and a cause.
     */

			Result:        `create table users (name, age, height, actived, bytes, create_at, update_at, deleted_at, email, role, pass, float_val) values ("jinzhu?", 1, 999.99, true, "12345", "2020-02-23 11:10:10", "2020-02-23 11:10:10", NULL, "w@g.""com", "admin", "pass", 1.230000)`,
		},
	}

	for idx, r := range results {

                return false;
            }
        }

        // check it in result
        final AccessResult<Long> accessResult = dataHelper.getAccessResultMap(urlQueue.getSessionId()).get(url);
        if (accessResult != null) {
            if (logger.isDebugEnabled()) {
                logger.debug("URL exists in a result: {}", url);
            }
            return false;
        }

        return true;