424242

#include <stdio.h>

#include <stdlib.h>

#include <pthread.h>

#define NUM_PHILOSOPHERS 5

pthread_mutex_t chopsticks[NUM_PHILOSOPHERS];

pthread_t philosophers[NUM_PHILOSOPHERS];

void *philosopher(void *arg) {

    int philosopher_id = *((int *)arg);

    int left_chopstick = philosopher_id;

    int right_chopstick = (philosopher_id + 1) % NUM_PHILOSOPHERS;

    while (1) {

        // Try to acquire the left chopstick

        if (pthread_mutex_trylock(&chopsticks[left_chopstick]) == 0) {

            printf("Philosopher %d picks up left chopstick\n", philosopher_id);

            // Try to acquire the right chopstick

            if (pthread_mutex_trylock(&chopsticks[right_chopstick]) == 0) {

                printf("Philosopher %d picks up right chopstick\n", philosopher_id);

                // Philosopher is eating

                printf("Philosopher %d is eating\n", philosopher_id);

                // Release the chopsticks

                pthread_mutex_unlock(&chopsticks[left_chopstick]);

                printf("Philosopher %d releases left chopstick\n", philosopher_id);

                pthread_mutex_unlock(&chopsticks[right_chopstick]);

                printf("Philosopher %d releases right chopstick\n", philosopher_id);

                // Philosopher is thinking

                printf("Philosopher %d is thinking\n", philosopher_id);

            } else {

                // Release the left chopstick if failed to acquire the right one

                pthread_mutex_unlock(&chopsticks[left_chopstick]);

            }

        }

        // Let other threads run before retrying

        sched_yield();

    }

    return NULL;

}

int main() {

    int i;

    // Initialize the chopsticks (mutexes)

    for (i = 0; i < NUM_PHILOSOPHERS; i++) {

        pthread_mutex_init(&chopsticks[i], NULL);

    }

    // Create philosopher threads

    for (i = 0; i < NUM_PHILOSOPHERS; i++) {

        int *philosopher_id = malloc(sizeof(int));

        *philosopher_id = i;

        pthread_create(&philosophers[i], NULL, philosopher, philosopher_id);

    }

    // Wait for philosopher threads to finish (will never happen in this case)

    for (i = 0; i < NUM_PHILOSOPHERS; i++) {

        pthread_join(philosophers[i], NULL);

    }

    // Cleanup

    for (i = 0; i < NUM_PHILOSOPHERS; i++) {

        pthread_mutex_destroy(&chopsticks[i]);

    }

    return 0;

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8" /> <meta http-equiv="X-UA-Compatible" content="IE=edge" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> <title>Document</title> <style> * { margin: 0; padding: 0; box-sizing: border-box; } ul { list-style: none; } .mi { position: relative; width: 223px; margin: 100px auto; } .mi input { width: 223px; height: 48px; padding: 0 10px; font-size: 14px; line-height: 48px; border: 1px solid #e0e0e0; outline: none; } .mi .search { border: 1px solid #ff6700; } .result-list { display: none; position: absolute; left: 0; top: 48px; width: 223px; border: 1px solid #ff6700; border-top: 0; background: #fff; } .result-list a { display: block; padding: 6px 15px; font-size: 12px; color: #424242; text-decoration: none; } .result-list a:hover { background-color: #eee; } </style> </head> <body> <div class="mi"> <input type="search" placeholder="小米笔记本" /> <ul class="result-list"> <li><a href="#">全部商品</a></li> <li><a href="#">小米11</a></li> <li><a href="#">小米10S</a></li> <li><a href="#">小米笔记本</a></li> <li><a href="#">小米手机</a></li> <li><a href="#">黑鲨4</a></li> <li><a href="#">空调</a></li> </ul> </div> <script> // 获取元素 const input = document.querySelector("[type=search]"); const ul = document.querySelector(".result-list"); // 监听事件 获取焦点 input.addEventListener("focus", function () { ul.style.display = "block"; // 添加一个带有颜色边框的类名 input.classList.add("search"); }); // 监听事件 失去焦点 input.addEventListener("blur", function () { ul.style.display = "none"; // 移除 input.classList.remove("search"); }); </script> </body> </html> 鼠标点击下拉框里面的内容时,上面的搜索框出现鼠标点击的内容
07-08

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值