zoukankan      html  css  js  c++  java
  • java工程中如何连接redis数据库?

    java连接redis数据库主要使用Jedis这么一个jar包,Jedis是Redis官方推荐的用于java访问redis的客户端,如果你的是maven工程,在pom.xml文件添加以下依赖:

    <dependency>
        <groupId>redis.clients</groupId>
        <artifactId>jedis</artifactId>
        <version>2.9.0</version>
        <type>jar</type>
        <scope>compile</scope>
    </dependency>
    

    如果不是maven工程,可以下载jar包加入自己工程即可,下载地址:https://github.com/xetorthio/jedis

    加入自己工程后,新建类redisTest.java:代码简单如下:启动redis服务后即可连接redis

    package test.com.cn;
    import redis.clients.jedis.Jedis;
    
    public class redisTest {
        public static void main(String[] args) {
            //Connecting to Redis server on localhost
            Jedis jedis = new Jedis("127.0.0.1",6378);
            System.out.println("Connection to server sucessfully");
    
            String a = jedis.set("name","zhangsan");
            String b = jedis.get("name");
           System.out.print("name的值:"+b);
        }
    }
    

    注意点:Jedis()构造方法有5个,如果你启动的redis服务是默认配置(端口6379),可以只传入ip即可,若不是默认的6379,需传入端口号,
    5个构造方法介绍:(1)默认配置,传入IP即可;(2)修改了端口,传入IP+端口;(3)ip+端口+超时时间(多久没活动自动断开连接);(4)ip、端口、用户名,密码,超时时间等全部装入JedisShardInfo对象传入;(5)比较复杂,把很多值(包括用户信息、授权信息、操作语句等)装入URI对象传入。

        public Jedis(String host) {
            super(host);
        }
    
        public Jedis(String host, int port) {
            super(host, port);
        }
    
        public Jedis(String host, int port, int timeout) {
            super(host, port, timeout);
        }
    
        public Jedis(String host, int port, int connectionTimeout, int soTimeout) {
            super(host, port, connectionTimeout, soTimeout);
        }
    
        public Jedis(JedisShardInfo shardInfo) {
            super(shardInfo);
        }
    
        public Jedis(URI uri) {
            super(uri);
        }
    
        public Jedis(URI uri, int timeout) {
            super(uri, timeout);
        }
    
        public Jedis(URI uri, int connectionTimeout, int soTimeout) {
            super(uri, connectionTimeout, soTimeout);
        }
    

    运行结果如下:

      

      

  • 相关阅读:
    Single Number II
    Pascal's Triangle
    Remove Duplicates from Sorted Array
    Populating Next Right Pointers in Each Node
    Minimum Depth of Binary Tree
    Unique Paths
    Sort Colors
    Swap Nodes in Pairs
    Merge Two Sorted Lists
    Climbing Stairs
  • 原文地址:https://www.cnblogs.com/aaaazzzz/p/14609011.html
Copyright © 2011-2022 走看看