// 3. Process each step (schedule or skip based on reactor failure behavior)
                plan.sortedNodes().stream()
                        // 1. Filter steps that are in CREATED state
                        .filter(BuildStep::isCreated)
                        // 2. Check if all predecessors are in a terminal state

        // After failure, state should be reset to disconnected
        assertEquals(0, tree.connectionState);
    }

    @Test
    void testSend() throws SmbException {
        SmbTree tree = new SmbTree(session, "testShare", "A:");
        tree.connectionState = 2; // Connected state
        tree.tid = 123;

  public HttpUrl authorizeUrl(String scopes, HttpUrl redirectUrl, ByteString state, String team) {
    HttpUrl.Builder builder = baseUrl.newBuilder("/oauth/authorize")
        .addQueryParameter("client_id", clientId)
        .addQueryParameter("scope", scopes)
        .addQueryParameter("redirect_uri", redirectUrl.toString())
        .addQueryParameter("state", state.base64());

    if (team != null) {

    }

    @Test
    @DisplayName("Test response state transitions")
    void testResponseStateTransitions() {
        // Test initial state
        assertTrue(response.hasMoreElements());

        // Test state after nextElement call
        response.nextElement();
        // Response behavior may change after nextElement

        // Test state after error (using errorCode, not status)

        System.arraycopy(buffer, 24, encodedKey, 0, 16);
        assertArrayEquals(testKey.getKey(), encodedKey);

        // Verify lease state at offset 40 (24 + 16 for key)
        assertEquals(testState, SMBUtil.readInt4(buffer, 40));

        // Verify lease flags at offset 44 (40 + 4 for state)
        assertEquals(0, SMBUtil.readInt4(buffer, 44));

	typedef struct {
		uint32_t count;
		[size_is(count)] DfsInfo1 *s;
	} DfsEnumArray1;

	typedef struct {
		uint32_t state;
		[string] wchar_t *server_name;
		[string] wchar_t *share_name;
	} DfsStorageInfo;

	typedef struct {
		[string] wchar_t *path;
		[string] wchar_t *comment;
		uint32_t state;
		uint32_t num_stores;
		[size_is(num_stores)] DfsStorageInfo *stores;
	} DfsInfo3;

	typedef struct {

# computes a hash of a remote repo's tag state.
# Tag definitions can come from the .hgtags file stored in
# any head of any branch, and the server protocol does not
# expose the tags directly. However, the protocol does expose
# the hashes of all the branch heads, so we can use a hash of
# all those branch names and heads as a conservative snapshot
# of the entire remote repo state, and use that as the tag sum.

else:
    logging.basicConfig(level=logging.INFO)
logging.debug(f"Using config: {settings.model_dump_json()}")
g = Github(settings.token.get_secret_value())
repo = g.get_repo(settings.github_repository)
for pr in repo.get_pulls(state="open"):
    logging.info(f"Checking PR: #{pr.number}")
    pr_labels = list(pr.get_labels())
    pr_label_by_name = {label.name: label for label in pr_labels}
    reviews = list(pr.get_reviews())

      for any such Derivative Works as a whole, provided Your use,
      reproduction, and distribution of the Work otherwise complies with
      the conditions stated in this License.

   5. Submission of Contributions. Unless You explicitly state otherwise,
      any Contribution intentionally submitted for inclusion in the Work
      by You to the Licensor shall be under the terms and conditions of

            Map<String, DfsState> stateMap,
            LinkedList<String> cycle) {
        if (children != null) {
            for (String v : children) {
                DfsState state = stateMap.putIfAbsent(v, DfsState.VISITING);
                if (state == null) {
                    cycle.addLast(v);
                    List<String> ret = visitCycle(graph, graph.get(v), stateMap, cycle);
                    if (ret != null) {