這篇文章主要介紹“python怎么實現(xiàn)redis雙鏈表 ”，在日常操作中，相信很多人在python怎么實現(xiàn)redis雙鏈表 問題上存在疑惑，小編查閱了各式資料，整理出簡單好用的操作方法，希望對大家解答”python怎么實現(xiàn)redis雙鏈表 ”的疑惑有所幫助！接下來，請跟著小編一起來學(xué)習(xí)吧！
10年的朗縣網(wǎng)站建設(shè)經(jīng)驗，針對設(shè)計、前端、開發(fā)、售后、文案、推廣等六對一服務(wù)，響應(yīng)快，48小時及時工作處理。成都營銷網(wǎng)站建設(shè)的優(yōu)勢是能夠根據(jù)用戶設(shè)備顯示端的尺寸不同，自動調(diào)整朗縣建站的顯示方式，使網(wǎng)站能夠適用不同顯示終端，在瀏覽器中調(diào)整網(wǎng)站的寬度，無論在任何一種瀏覽器上瀏覽網(wǎng)站，都能展現(xiàn)優(yōu)雅布局與設(shè)計，從而大程度地提升瀏覽體驗。創(chuàng)新互聯(lián)建站從事“朗縣網(wǎng)站設(shè)計”,“朗縣網(wǎng)站推廣”以來，每個客戶項目都認(rèn)真落實執(zhí)行。
特點:
len: O(1)，獲取鏈表長度
head: O(1), 頭部第一個節(jié)點
tail: O(1) 尾部第一個節(jié)點
無環(huán): 非循環(huán)鏈表
void *: 存儲任意類型數(shù)據(jù)。 (動態(tài)語言天然自帶)
創(chuàng)建/銷毀/初始化:
listCreate
listEmpty
listRelease
添加節(jié)點/刪除節(jié)點:
listAddNodeHead
listAddNodeTail
listInsertNode
listDelNode
實現(xiàn)迭代器/正向/反向遍歷:
listGetIterator
listReleaseIterator
listRewind
listRewindTail
listNext
list復(fù)制，查找，旋轉(zhuǎn)合并操作:
listDup
listSearchKey
listIndex
listRotateTailToHead
listRotateHeadToTail
listJoin
源碼
參考redis list定義節(jié)點和DLinkList
python動態(tài)語言需要手動管理內(nèi)存申請釋放.
使用生成器, 偷懶式實現(xiàn)正向反向遍歷.
重慶分公司
重慶分公司
"""
參考redis adlist.c. 實現(xiàn)雙鏈表相關(guān)的api
head tail
None <- <- <-
1 2 3
-> -> -> None
len:3
"""
import copy
from typing import Any
class Node(object):
def __init__(self, data) -> None:
self.next = None
self.pre = None
self.data = data
def __str__(self) -> str:
return f"{self.data}"
class DLinkList(object):
def __init__(self) -> None:
self.head = None
self.tail = None
self.len = 0
def empty(self) -> None:
self.head = None
self.tail = None
self.len = 0
def add_node_head(self, data=None) -> Node:
"""[頭插法]
Args:
data ([type], optional): [description]. Defaults to None.
"""
new_node = Node(data=data)
if self.len == 0:
# 鏈表為空. 處理頭/尾指針
self.tail = new_node
self.head = new_node
else:
# 插入新節(jié)點
new_node.next = self.head
self.head.pre = new_node
self.head = new_node
self.len += 1
return new_node
def add_node_tail(self, data: Any=None) -> Node:
"""[尾插法]
Args:
data ([type], optional): [description]. Defaults to None.
"""
new_node = Node(data=data)
if self.len == 0:
# 鏈表為空. 處理頭/尾指針
self.tail = new_node
self.head = new_node
else:
# 插入新節(jié)點
new_node.pre = self.tail
new_node.next = self.tail.next
self.tail.next = new_node
# 更新尾指針
self.tail = new_node
self.len += 1
return new_node
def insert_node(self, old_node: Node=None, data: Any=None, after: bool=False) -> None:
"""[插入新節(jié)點, 在舊節(jié)點的前/后]
Args:
old_node (Node, optional): [舊節(jié)點]. Defaults to None.
data (Any, optional): [新數(shù)據(jù)]. Defaults to None.
after (Bool, optional): [是否在之后插入]. Defaults to False.
"""
assert self.len, f"self.len({self.len}) must > 0"
new_node = Node(data=data)
if after:
new_node.pre = old_node
new_node.next = old_node.next
old_node.next.pre = new_node
old_node.next = new_node
if self.tail == old_node:
self.tail = new_node
else:
new_node.pre = old_node.pre
new_node.next = old_node
old_node.pre.next = new_node
old_node.pre = new_node
if self.head == old_node:
self.head = new_node
self.len += 1
def del_node(self, node: Node) -> None:
"""[刪除節(jié)點]
Args:
node (Node): [description]
"""
assert self.len, "DLinklist is None"
if not node:
return
if node == self.head:
self.head = node.next
else:
# 1.處理next
node.pre.next = node.next
if node == self.tail:
self.tail = node.pre
else:
# 2.處理pre
node.next.pre = node.pre
node.pre = None
node.next = None
del node
self.len -= 1
def next(self, reversed:bool=False):
"""[獲取生成器]
Args:
reversed (bool, optional): [description]. Defaults to False.
Returns:
[type]: [description]
"""
if reversed:
return self._reverse_next()
return self._next()
def _reverse_next(self):
"""[反向迭代, 使用生成器記錄狀態(tài)]
Yields:
[type]: [description]
"""
cur = self.tail
idx = self.len - 1
while cur:
yield (idx, cur)
idx -= 1
cur = cur.pre
def _next(self):
"""[正向迭代, 使用生成器記錄狀態(tài)]]
Yields:
[type]: [description]
"""
cur = self.head
idx = 0
while cur:
yield (idx, cur)
idx += 1
cur = cur.next
def dup(self):
return copy.deepcopy(self)
def find(self, key: Any=None) -> tuple:
if not key:
return
g = self.next()
for idx, node in g:
if node.data == key:
return idx, node
return -1, None
def rotate_tail_to_head(self) -> None:
"""[正向旋轉(zhuǎn)節(jié)點]
移動尾節(jié)點，插入到頭部
"""
assert self.len >= 2, "dlist len must >=2"
head = self.head
tail = self.tail
# remove tail
self.tail = tail.pre
self.tail.next = None
# move to head
tail.next = head
tail.pre = head.pre
self.head = tail
def rotate_head_to_tail(self) -> None:
"""[反向旋轉(zhuǎn)節(jié)點]
移動頭點，插入到尾部
"""
assert self.len >= 2, "dlist len must >=2"
head = self.head
tail = self.tail
# remove head
self.head = head.next
self.head.pre = None
# move to tail
tail.next = head
head.pre = tail
self.tail = head
self.tail.next = None
def join(self, dlist: Any=None):
"""[合并雙鏈表]
Args:
dlist (Any, optional): [description]. Defaults to None.
"""
pass
def __str__(self) -> str:
ans = ""
for idx, node in self.next(reversed=False):
ans += f"idx:({idx}) data:({node.data})n"
return ans
def test_add_node(dlist:DLinkList=None):
n = 5
for i in range(n):
dlist.add_node_tail(data=i)
# dlist.add_node_head(data=i)
print(dlist)
def test_del_node(dlist:DLinkList=None):
i = dlist.len
while i:
node = None
dlist.del_node(node)
i -= 1
print(dlist)
def test_insert_node(dlist:DLinkList=None):
# dlist.insert_node(old_node=old_node, data=100, after=True)
# print(dlist, id(dlist))
# nlist = dlist.dup()
# print(nlist, id(nlist))
idx, fnode = dlist.find(1)
print('find node:', idx, fnode)
dlist.insert_node(fnode, 100, after=True)
print("insert after")
print(dlist)
dlist.insert_node(fnode, 200, after=False)
print("insert before")
print(dlist)
def test_rotate(dlist:DLinkList=None):
print("move head to tail")
dlist.rotate_head_to_tail()
print(dlist)
print("move tail to head")
dlist.rotate_tail_to_head()
print(dlist)
def test_join(dlist:DLinkList=None, olist:DLinkList=None):
print("join list")
nlist = dlist.join(olist)
print(nlist)
def main():
dlist = DLinkList()
test_add_node(dlist)
# test_del_node(dlist)
# test_insert_node(dlist)
test_rotate(dlist)
if __name__ == "__main__":
main()到此，關(guān)于“python怎么實現(xiàn)redis雙鏈表 ”的學(xué)習(xí)就結(jié)束了，希望能夠解決大家的疑惑。理論與實踐的搭配能更好的幫助大家學(xué)習(xí)，快去試試吧！若想繼續(xù)學(xué)習(xí)更多相關(guān)知識，請繼續(xù)關(guān)注創(chuàng)新互聯(lián)網(wǎng)站，小編會繼續(xù)努力為大家?guī)砀鄬嵱玫奈恼拢?/p>
網(wǎng)站題目：python怎么實現(xiàn)redis雙鏈表
網(wǎng)站網(wǎng)址：http://weahome.cn/article/ieioje.html
