unsafe demo

using System;
using System.Collections.Generic;
using System.Linq;
using System.Runtime.InteropServices;
using System.Text;
using System.Threading.Tasks;

namespace UnsafeDemo
{
    class Program
    {
        //https://docs.microsoft.com/zh-CN/dotnet/csharp/language-reference/language-specification/unsafe-code
        unsafe static void Main(string[] args)
        {
            int i = 500;
            int* pi=&i; //&取内存地址
            int** ppi = π//**指针的指针  指向了i

            Console.WriteLine("i的值:" + i);
            Console.WriteLine("*pi的值:" + *pi);
            Console.WriteLine("*pi的值**(&pi):" + **(&pi));
            Console.WriteLine("**pi的值:" + **ppi);
            

            byte[] source = Encoding.UTF8.GetBytes("我是字节集");
            byte[] dest = new byte[source.Length];
            fixed(byte* pby = dest)//声明指针
            {
                IntPtr ptrdest = new IntPtr(pby); //转换为.net指针
                IntPtr ptrsource = Marshal.UnsafeAddrOfPinnedArrayElement(source, 0); //byte[] 转为 inptr

                Copy(ptrsource, ptrdest, source.Length);
            }
            Console.ReadKey();
        }
        unsafe static void Copy(IntPtr source, IntPtr dest, int length)
        {
            byte* psource = (byte*)source; // 转回unsfae指针
            byte* pdest = (byte*)dest;
            for (int i = 0; i < length; i++)
            {
                *(pdest + i) = *(psource + i);
            }
            Showstr(source, length);
            Showstr(dest, length);
            Console.WriteLine(*pdest);
            Console.ReadKey();
        }
        static void Showstr(IntPtr ptr,int length)
        {
            byte[] by = new byte[length];
            Marshal.Copy(ptr, by, 0, by.Length);
            Console.WriteLine(Encoding.UTF8.GetString(by));
        }
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是一个基于 ZooKeeper 实现分布式锁的 Java Demo: ```java import java.util.concurrent.CountDownLatch; import org.apache.zookeeper.CreateMode; import org.apache.zookeeper.KeeperException; import org.apache.zookeeper.WatchedEvent; import org.apache.zookeeper.Watcher; import org.apache.zookeeper.ZooDefs.Ids; import org.apache.zookeeper.ZooKeeper; import org.apache.zookeeper.data.Stat; public class DistributedLock implements Watcher { private static final String ZK_ADDRESS = "localhost:2181"; private static final int SESSION_TIMEOUT = 5000; private static final String LOCK_ROOT = "/locks"; private static final String LOCK_PREFIX = "lock_"; private String lockPath; private ZooKeeper zk; private CountDownLatch connectedSignal = new CountDownLatch(1); private CountDownLatch lockSignal = new CountDownLatch(1); public DistributedLock() throws Exception { zk = new ZooKeeper(ZK_ADDRESS, SESSION_TIMEOUT, this); connectedSignal.await(); Stat stat = zk.exists(LOCK_ROOT, false); if (stat == null) { zk.create(LOCK_ROOT, new byte[0], Ids.OPEN_ACL_UNSAFE, CreateMode.PERSISTENT); } } public boolean lock() throws Exception { lockPath = zk.create(LOCK_ROOT + "/" + LOCK_PREFIX, new byte[0], Ids.OPEN_ACL_UNSAFE, CreateMode.EPHEMERAL_SEQUENTIAL); while (true) { String prevLock = getPrevLock(); if (prevLock == null) { return true; } else { zk.exists(prevLock, true); lockSignal.await(); } } } public void unlock() throws Exception { zk.delete(lockPath, -1); } private String getPrevLock() throws KeeperException, InterruptedException { String prevLock = null; String[] nodes = zk.getChildren(LOCK_ROOT, false).toArray(new String[0]); for (int i = 0; i < nodes.length; i++) { if (lockPath.endsWith(nodes[i])) { if (i > 0) { prevLock = LOCK_ROOT + "/" + nodes[i - 1]; } break; } } return prevLock; } @Override public void process(WatchedEvent event) { if (event.getState() == Event.KeeperState.SyncConnected) { connectedSignal.countDown(); } else if (event.getType() == Event.EventType.NodeDeleted && event.getPath().equals(getPrevLock())) { lockSignal.countDown(); } } } ``` 这个 Demo 中,`DistributedLock` 类实现了分布式锁的基本操作。使用时,首先需要创建一个 `DistributedLock` 对象,然后调用 `lock` 方法获取锁,调用 `unlock` 方法释放锁。 这个 Demo 中使用 ZooKeeper 的 `EPHEMERAL_SEQUENTIAL` 模式创建了一个临时顺序节点,如果当前节点是序号最小的节点,则获取到锁。如果不是,则在当前节点的前一个节点上注册一个 Watcher,当前一个节点被删除时,当前节点就可以获取到锁了。 需要注意的是,这个 Demo 中的锁并没有考虑超时问题。在实际使用中,需要根据具体情况进行优化。

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值