


PHP+redis method to implement registration, deletion, editing, paging, login, following and other functions
This article mainly introduces the functions of registration, deletion, editing, paging, login, and following in PHP redis. It analyzes the registration, deletion, editing, paging, login, and following functions commonly used in PHP redis project development in the form of examples. For related implementation skills, friends in need can refer to
. This article describes how to implement registration, deletion, editing, paging, login, follow and other functions in php redis. Share it with everyone for your reference, the details are as follows:
Main interface
##Connect to redis
redis.php<?php //实例化 $redis = new Redis(); //连接服务器 $a=$redis->connect("localhost",6379); //var_dump($a); //授权 $redis->auth("107lab");
Registration interface
add.php<form action="reg.php" method="post"> 用户名:<input type="text" name="username"><br> 密码:<input type="password" name="password"><br> 年龄:<input type="text" name="age"><br> <input type="submit" value="注册"> <input type="reset" value="重填"> </form>
Registration Implementation
reg.php<?php require("redis.php"); $username = $_POST['username']; $password = md5($_POST['password']); $age = $_POST['age']; //echo $username.$password.$age; $uid = $redis->incr("userid");//设置自增id,相当于主键 $redis->hMset("user:".$uid,array("uid"=>$uid,"username"=>$username,"password"=>$password,"age"=>$age));//用hash类型存储用户比较方便 //将用户id存入一个链表中,便于统计数据 $redis->rpush("uid",$uid); //将用id存入以用户名为键的字符类型中,便于查看用户是否存在。 $redis->set("username:".$username,$uid); header('location:list.php');
List page
list.php<a href="add.php" rel="external nofollow" >注册</a> <?php require("redis.php"); if(!empty($_COOKIE['auth'])){ $id = $redis->get("auth:".$_COOKIE['auth']); $name = $redis->hget("user:".$id,"username"); ?> 欢迎您:<?php echo $name;?> <a href="logout.php" rel="external nofollow" >退出</a> <?php } else { ?> <a href="login.php" rel="external nofollow" >登录</a> <?php } ?> <?php require("redis.php"); //用户总数 $count = $redis->lsize("uid");//获取链表的长度 //echo $count; //页大小 $page_size = 3; //当前页码 $page_num=(!empty($_GET['page']))?$_GET['page']:1; //页总数 $page_count = ceil($count/$page_size); $ids = $redis->lrange("uid",($page_num-1)*$page_size,(($page_num-1)*$page_size+$page_size-1)); //var_dump($ids); foreach($ids as $v){ $data[]=$redis->hgetall("user:".$v); } /* //以下为最初想到的分页处理,放入一个数组中,根据uid的最大值来当总个数,但是删除个别用户以后,uid不会变小,所以建议用链表,因为他有个lsize函数可以求出链表长度 //根据userid获取所有用户 for($i=1;$i<=($redis->get("userid"));$i++){ $data[]=$redis->hgetall("user:".$i); } //过滤空值 $data = array_filter($data); //var_dump($data); */ ?> <table border=1> <tr> <th>uid</th> <th>username</th> <th>age</th> <th>操作</th> </tr> <?php foreach($data as $v){ ?> <tr> <td><?php echo $v['uid']?></td> <td><?php echo $v['username']?></td> <td><?php echo $v['age']?></td> <td> <a href="del.php?id=<?php echo $v['uid'];?>" rel="external nofollow" >删除</a> <a href="mod.php?id=<?php echo $v['uid'];?>" rel="external nofollow" >编辑</a> <?php if(!empty($_COOKIE['auth']) && $id != $v['uid']){ ?> <a href="addfans.php?id=<?php echo $v['uid'];?>&uid=<?php echo $id;?>" rel="external nofollow" >加关注</a> <?php } ?> </td> </tr> <?php } ?> <tr> <td colspan="4"> <?php if(($page_num-1)>=1){ ?> <a href="?page=<?php echo ($page_num-1);?>" rel="external nofollow" >上一页</a> <?php } ?> <?php if(($page_num+1)<=$page_count){ ?> <a href="?page=<?php echo ($page_num+1);?>" rel="external nofollow" >下一页</a> <?php } ?> <a href="?page=1" rel="external nofollow" >首页</a> <a href="?page=<?php echo ($page_count);?>" rel="external nofollow" >尾页</a> 当前<?php echo $page_num;?>页 总共<?php echo $page_count;?>页 总共<?php echo $count;?>个用户 </td> </tr> </table> <!--关注功能,建议用集合实现,因为集合元素唯一,并且可以容易求出两个用户粉丝之间交集与差集,进而进行好友推荐功能--> <table border=1> <caption>我关注了谁</caption> <?php $data = $redis->smembers("user:".$id.":following"); foreach($data as $v){ $row = $redis->hgetall("user:".$v); ?> <tr> <td><?php echo $row['uid'];?></td> <td><?php echo $row['username'];?></td> <td><?php echo $row['age'];?></td> </tr> <?php } ?> <table> <table border=1> <caption>我的粉丝</caption> <?php $data = $redis->smembers("user:".$id.":followers"); foreach($data as $v){ $row = $redis->hgetall("user:".$v); ?> <tr> <td><?php echo $row['uid'];?></td> <td><?php echo $row['username'];?></td> <td><?php echo $row['age'];?></td> </tr> <?php } ?> <table>
logout.php
<?php setcookie("auth","",time()-1); header("location:list.php");
login.php
<?php require("redis.php"); $username = $_POST['username']; $pass = $_POST['password']; //根据注册时存储的以用户名为键的字符类型中查找用户id $id = $redis->get("username:".$username); if(!empty($id)){ $password = $redis->hget("user:".$id,"password"); if(md5($pass) == $password){ $auth = md5(time().$username.rand()); $redis->set("auth:".$auth,$id); setcookie("auth",$auth,time()+86400); header("location:list.php"); } } ?> <form action="" method="post"> 用户名:<input type="text" name="username"/><br> 密码:<input type="password" name="password"><br> <input type="submit" value="登录"/> </form>
del.php
<?php require("redis.php"); $uid = $_GET['id']; //echo $uid; $username = $redis->hget("user:".$id,"username"); $a=$redis->del("user:".$uid); $redis->del("username:".$username); $redis->lrem("uid",$uid); //var_dump($a); header("location:list.php");
mod.php
<?php require("redis.php"); $uid = $_GET['id']; $data=$redis->hgetall("user:".$uid); ?> <form action="doedit.php" method="post"> <input type="hidden" value="<?php echo $data['uid'];?>" name="uid"> 用户名:<input type="text" name="username" value="<?php echo $data['username'];?>"><br> 年龄:<input type="text" name="age" value="<?php echo $data['age'];?>"><br> <input type="submit" value="提交"> <input type="reset" value="重填"> </form>
doedit.php
<?php require('redis.php'); $uid = $_POST['uid']; $username = $_POST['username']; $age = $_POST['age']; $a=$redis->hmset("user:".$uid,array("username"=>$username,"age"=>$age)); if($a){ header("location:list.php"); }else{ header("location:mod.php?id=".$uid); }
addfans.php
<?php //关注功能,建议用集合实现,因为集合元素唯一,并且可以容易求出两个用户粉丝之间交集与差集,进而进行好友推荐功能 $id = $_GET['id']; $uid = $_GET['uid']; require("redis.php"); $redis->sadd("user:".$uid.":following",$id); $redis->sadd("user:".$id.":followers",$uid); header("location:list.php");
The above is the entire content of this article, I hope it will be helpful to everyone's study.
Related recommendations:
The above is the detailed content of PHP+redis method to implement registration, deletion, editing, paging, login, following and other functions. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

AI Hentai Generator
Generate AI Hentai for free.

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics



PHP 8.4 brings several new features, security improvements, and performance improvements with healthy amounts of feature deprecations and removals. This guide explains how to install PHP 8.4 or upgrade to PHP 8.4 on Ubuntu, Debian, or their derivati

Visual Studio Code, also known as VS Code, is a free source code editor — or integrated development environment (IDE) — available for all major operating systems. With a large collection of extensions for many programming languages, VS Code can be c

If you are an experienced PHP developer, you might have the feeling that you’ve been there and done that already.You have developed a significant number of applications, debugged millions of lines of code, and tweaked a bunch of scripts to achieve op

This tutorial demonstrates how to efficiently process XML documents using PHP. XML (eXtensible Markup Language) is a versatile text-based markup language designed for both human readability and machine parsing. It's commonly used for data storage an

JWT is an open standard based on JSON, used to securely transmit information between parties, mainly for identity authentication and information exchange. 1. JWT consists of three parts: Header, Payload and Signature. 2. The working principle of JWT includes three steps: generating JWT, verifying JWT and parsing Payload. 3. When using JWT for authentication in PHP, JWT can be generated and verified, and user role and permission information can be included in advanced usage. 4. Common errors include signature verification failure, token expiration, and payload oversized. Debugging skills include using debugging tools and logging. 5. Performance optimization and best practices include using appropriate signature algorithms, setting validity periods reasonably,

A string is a sequence of characters, including letters, numbers, and symbols. This tutorial will learn how to calculate the number of vowels in a given string in PHP using different methods. The vowels in English are a, e, i, o, u, and they can be uppercase or lowercase. What is a vowel? Vowels are alphabetic characters that represent a specific pronunciation. There are five vowels in English, including uppercase and lowercase: a, e, i, o, u Example 1 Input: String = "Tutorialspoint" Output: 6 explain The vowels in the string "Tutorialspoint" are u, o, i, a, o, i. There are 6 yuan in total

Static binding (static::) implements late static binding (LSB) in PHP, allowing calling classes to be referenced in static contexts rather than defining classes. 1) The parsing process is performed at runtime, 2) Look up the call class in the inheritance relationship, 3) It may bring performance overhead.

What are the magic methods of PHP? PHP's magic methods include: 1.\_\_construct, used to initialize objects; 2.\_\_destruct, used to clean up resources; 3.\_\_call, handle non-existent method calls; 4.\_\_get, implement dynamic attribute access; 5.\_\_set, implement dynamic attribute settings. These methods are automatically called in certain situations, improving code flexibility and efficiency.
