<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[museyouxia的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/museyouxia</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; museyouxia]]></copyright><item><title><![CDATA[java.util.Stack类]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/109157294</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/109157294</guid><author>museyouxia</author><pubDate>Mon, 19 Oct 2020 11:25:40 +0800</pubDate><description><![CDATA[/**
 * The &lt;code&gt;Stack&lt;/code&gt; class represents a last-in-first-out
 * (LIFO) stack of objects. It extends class &lt;tt&gt;Vector&lt;/tt&gt; with five
 * operations that allow a vector to be treated as a stack. The usual
 * &lt;tt&gt;push&lt;/tt]]></description><category></category></item><item><title><![CDATA[java.util.Queue接口]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/109156710</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/109156710</guid><author>museyouxia</author><pubDate>Mon, 19 Oct 2020 11:16:33 +0800</pubDate><description><![CDATA[/**
 * A collection designed for holding elements prior to processing.
 * Besides basic {@link java.util.Collection Collection} operations,
 * queues provide additional insertion, extraction, and inspection
 * operations.  Each of these methods exists in t]]></description><category></category></item><item><title><![CDATA[java.util.Deque接口]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106647613</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106647613</guid><author>museyouxia</author><pubDate>Mon, 19 Oct 2020 10:19:54 +0800</pubDate><description><![CDATA[支持在两端插入和删除元素的线性集合。大多数Deque实现对它们可能包含的元素数量没有固定的限制，
 但是此接口支持容量受限的双端队列以及没有固定大小限制的双端队列。
 * A linear collection that supports element insertion and removal at
 * both ends.  The name &lt;i&gt;deque&lt;/i&gt; is short for "double ended queue"
 * and is usually p.]]></description><category></category></item><item><title><![CDATA[java.util.AbstractSequentialList抽象类]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106647054</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106647054</guid><author>museyouxia</author><pubDate>Tue, 09 Jun 2020 17:32:29 +0800</pubDate><description><![CDATA[此类提供了List接口的基本实现，以最大程度地减少实现由“顺序访问”数据存储（例如链表）支持的该接口所需的工作。 
 对于随机访问数据（例如数组），应优先使用AbstractList来代替此类。
 * This class provides a skeletal implementation of the &lt;tt&gt;List&lt;/tt&gt;
 * interface to minimize the effort required to implement this interface
 *.]]></description><category></category></item><item><title><![CDATA[java.util.ListIterator接口]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106646641</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106646641</guid><author>museyouxia</author><pubDate>Tue, 09 Jun 2020 17:19:11 +0800</pubDate><description><![CDATA[* An iterator for lists that allows the programmer
 * to traverse the list in either direction, modify
 * the list during iteration, and obtain the iterator's
 * current position in the list. A {@code ListIterator}
 * has no current element; its &lt;I&gt;.]]></description><category></category></item><item><title><![CDATA[java.util.ArrayDeque类]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106619504</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106619504</guid><author>museyouxia</author><pubDate>Mon, 08 Jun 2020 17:35:34 +0800</pubDate><description><![CDATA[Deque接口的可调整大小的数组实现。 阵列双端队列没有容量限制。 它们会根据需要增长以支持使用。 
 它们不是线程安全的。 在没有外部同步的情况下，它们不支持多个线程的并发访问。 空元素是禁止的。 
 用作堆栈时，此类可能比Stack更快，而用作队列时，此类可能比LinkedList更快。
 * Resizable-array implementation of the {@link Deque} interface.  Array
 * deques have no capacity restrict.]]></description><category></category></item><item><title><![CDATA[java.util.ArrayList类]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106542973</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106542973</guid><author>museyouxia</author><pubDate>Mon, 08 Jun 2020 14:54:31 +0800</pubDate><description><![CDATA[* Resizable-array implementation of the &lt;tt&gt;List&lt;/tt&gt; interface.  Implements
 * all optional list operations, and permits all elements, including
 * &lt;tt&gt;null&lt;/tt&gt;.  In addition to implementing the &lt;tt&gt;List&lt;/tt&gt; interfac.]]></description><category></category></item><item><title><![CDATA[java.util.AbstractList抽象类]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106498795</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106498795</guid><author>museyouxia</author><pubDate>Thu, 04 Jun 2020 11:31:55 +0800</pubDate><description><![CDATA[List接口的骨架实现
 * This class provides a skeletal implementation of the {@link List}
 * interface to minimize the effort required to implement this interface
 * backed by a "random access" data store (such as an array).  For sequential
 * access data (such as.]]></description><category></category></item><item><title><![CDATA[java.util.List接口]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106497334</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106497334</guid><author>museyouxia</author><pubDate>Tue, 02 Jun 2020 16:08:48 +0800</pubDate><description><![CDATA[有序，通过index查找
 * An ordered collection (also known as a &lt;i&gt;sequence&lt;/i&gt;).  The user of this
 * interface has precise control over where in the list each element is
 * inserted.  The user can access elements by their integer index (position in
 .]]></description><category></category></item><item><title><![CDATA[java.util.AbstractCollection抽象类]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106491922</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106491922</guid><author>museyouxia</author><pubDate>Tue, 02 Jun 2020 15:27:36 +0800</pubDate><description><![CDATA[package java.util;
为Collection接口提供了一个骨骼框架
最少只实现iterator和size即可
/**
 * This class provides a skeletal implementation of the &lt;tt&gt;Collection&lt;/tt&gt;
 * interface, to minimize the effort required to implement this interface. &lt;p&gt;
 *
 * To impleme]]></description><category></category></item><item><title><![CDATA[java.util.Collection接口]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106475505</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106475505</guid><author>museyouxia</author><pubDate>Tue, 02 Jun 2020 11:01:13 +0800</pubDate><description><![CDATA[package java.util;

import java.util.function.Predicate;
import java.util.stream.Stream;
import java.util.stream.StreamSupport;

/**
 * The root interface in the &lt;i&gt;collection hierarchy&lt;/i&gt;.  A collection
 * represents a group of objects, known]]></description><category></category></item><item><title><![CDATA[java.util.Iterator接口]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/106473343</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/106473343</guid><author>museyouxia</author><pubDate>Mon, 01 Jun 2020 15:31:37 +0800</pubDate><description><![CDATA[java.util.Iterator接口

]]></description><category></category></item><item><title><![CDATA[python 常用的匹配模式]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/92715136</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/92715136</guid><author>museyouxia</author><pubDate>Mon, 17 Jun 2019 21:26:13 +0800</pubDate><description><![CDATA[\w   匹配字母数字及下划线
\W   匹配f非字母数字下划线
\s   匹配任意空白字符，等价于[\t\n\r\f]
\S   匹配任意非空字符
\d   匹配任意数字
\D   匹配任意非数字
\A   匹配字符串开始
\Z   匹配字符串结束，如果存在换行，只匹配换行前的结束字符串
\z   匹配字符串结束
\G   匹配最后匹配...]]></description><category></category></item><item><title><![CDATA[Python Requests内置的状态码查询对象]]></title><link>https://blog.youkuaiyun.com/museyouxia/article/details/92707930</link><guid>https://blog.youkuaiyun.com/museyouxia/article/details/92707930</guid><author>museyouxia</author><pubDate>Mon, 17 Jun 2019 20:57:19 +0800</pubDate><description><![CDATA[100: ('continue',),
101: ('switching_protocols',),
102: ('processing',),
103: ('checkpoint',),
122: ('uri_too_long', 'request_uri_too_long'),
200: ('ok', 'okay', 'all_ok', 'all_okay', 'all_good', '\o/...]]></description><category></category></item></channel></rss>