<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[jangels的专栏]]></title><description><![CDATA[Practice makes perfect .]]></description><link>https://blog.youkuaiyun.com/jangels</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jangels]]></copyright><item><title><![CDATA[通用中间件模型]]></title><link>https://blog.youkuaiyun.com/jangels/article/details/115045516</link><guid>https://blog.youkuaiyun.com/jangels/article/details/115045516</guid><author>jangels</author><pubDate>Sun, 21 Mar 2021 11:04:21 +0800</pubDate><description><![CDATA[日常工作中, 后端常用的中间件有这么几种: 数据库/缓存/消息队列/搜索引擎, 这几种中间件在典型架构中的组合使用方式如下:





Arch



这几种中间件的常用实现有: MySQL/Redis/RocketMQ or Kafka/ElasticSearch, 那么通过每一种中间件的学习,我们经常有这种感觉: 这些东西有很多相似的地方,原理很相似,通过抽象总结, 我梳理了以下的通用中间件模型:





跳出来,在极大的尺度上考虑,中间件层可以抽象为一个全局的分布式存储系统, 在理想的系统里,...]]></description><category></category></item><item><title><![CDATA[11111]]></title><link>https://blog.youkuaiyun.com/jangels/article/details/76269740</link><guid>https://blog.youkuaiyun.com/jangels/article/details/76269740</guid><author>jangels</author><pubDate>Fri, 28 Jul 2017 17:06:34 +0800</pubDate><description><![CDATA[哈哈


































































































]]></description><category></category></item><item><title><![CDATA[扑克牌数组排序Pro]]></title><link>https://blog.youkuaiyun.com/jangels/article/details/17014437</link><guid>https://blog.youkuaiyun.com/jangels/article/details/17014437</guid><author>jangels</author><pubDate>Thu, 28 Nov 2013 23:17:19 +0800</pubDate><description><![CDATA[前面那个方法太傻太繁琐,,现改进如下
public class SortPokerPro{
	public static void main(String[] args){
		String[] str = {"2","Q","J","K","10","9","8","7","6","5","4","3","A"} ;
		for(int i = 0; i < str.length - 1; i]]></description><category></category></item><item><title><![CDATA[对扑克牌字符串数组进行排序]]></title><link>https://blog.youkuaiyun.com/jangels/article/details/16995387</link><guid>https://blog.youkuaiyun.com/jangels/article/details/16995387</guid><author>jangels</author><pubDate>Wed, 27 Nov 2013 23:40:39 +0800</pubDate><description><![CDATA[对于一个扑克牌字符串数组进行排序，这里使用的是一个笨办法，不管字符串是数字还是字母，转为char型数组后对每一个值进行加权，即设置一个映射值。通过对映射值得比较和冒泡排序，实现真实值的排序。代码如下：public class Sort{
	public static void main(String[] args){
		String[] str = {"2","Q","J","K","10","]]></description><category></category></item><item><title><![CDATA[百思为科面试题]]></title><link>https://blog.youkuaiyun.com/jangels/article/details/12835027</link><guid>https://blog.youkuaiyun.com/jangels/article/details/12835027</guid><author>jangels</author><pubDate>Thu, 17 Oct 2013 11:37:18 +0800</pubDate><description><![CDATA[1.assert什么时候使用

 断言是一个包含布尔表达式的语句，在执行这个语句时假定该表达式为 true。如果表达式计算为 false，那么系统会报告一个 Assertionerror。它用于调试目的： 


　　assert(a > 0); // throws an Assertionerror if a 
　　断言可以有两种形式： 
　　assert Expression1 ;]]></description><category></category></item><item><title><![CDATA[struts 读取配置文件顺序]]></title><link>https://blog.youkuaiyun.com/jangels/article/details/8790851</link><guid>https://blog.youkuaiyun.com/jangels/article/details/8790851</guid><author>jangels</author><pubDate>Thu, 11 Apr 2013 22:33:33 +0800</pubDate><description><![CDATA[1，stuts-default.xml
2，struts-plugin.xml
3，struts.xml
4，struts.properties
5，web.xml]]></description><category></category></item></channel></rss>