zoukankan      html  css  js  c++  java
  • 游标遍历

    -- 将user_tables的所有table_name以逗号间隔作为一个字符串输出 -- 通过for循环 显示游标 遍历 declare var_sql varchar2(32767) := ''; cursor cur is select table_name from user_tables order by table_name; begin for rec in cur loop var_sql := var_sql || rec.table_name || ','; end loop; var_sql := substr(var_sql, 1, length(var_sql) - 1); dbms_output.put_line(var_sql); end; -- 通过for循环 隐式游标 遍历 declare var_sql varchar2(32767) := ''; begin for rec in (select table_name from user_tables order by table_name) loop var_sql := var_sql || rec.table_name || ','; end loop; var_sql := substr(var_sql, 1, length(var_sql) - 1); dbms_output.put_line(var_sql); end; -- 通过loop..if遍历 declare cursor cur is select table_name from user_tables order by table_name; var_sql varchar2(32767) := ''; var_table_name user_tables.table_name%type; begin open cur; loop fetch cur into var_table_name; if cur%notfound then var_sql := substr(var_sql, 1, length(var_sql) - 1); exit; else var_sql := var_sql || var_table_name || ','; end if; end loop; close cur; dbms_output.put_line(var_sql); end; -- 通过loop..exit when遍历 declare cursor cur is select table_name from user_tables order by table_name; var_sql varchar2(32767) := ''; var_table_name user_tables.table_name%type; begin open cur; loop fetch cur into rec; exit when cur%notfound; var_sql := var_sql || var_table_name || ','; end loop; close cur; var_sql := substr(var_sql, 1, length(var_sql) - 1); dbms_output.put_line(var_sql); end; -- 通过loop..record类型遍历 declare cursor cur is select table_name from user_tables order by table_name; type type_rec is record( table_name user_tables.table_name%type); rec type_rec; var_sql varchar2(32767) := ''; begin open cur; loop fetch cur into rec; exit when cur%notfound; var_sql := var_sql || rec.table_name || ','; end loop; close cur; var_sql := substr(var_sql, 1, length(var_sql) - 1); dbms_output.put_line(var_sql); end;
  • 相关阅读:
    卡特兰数
    poj3461 字符串匹配 熟悉kmp算法第一题
    hdu1018
    poj 1088
    Linux / OS X 实用命令
    Mac/Linux 定时运行命令行
    在Mac安装Scheme
    如何判断无向图有环
    Prime算法生成最小生成树
    无向图的深度优先与广度优先搜索代码实现
  • 原文地址:https://www.cnblogs.com/aspsmile/p/1676474.html
Copyright © 2011-2022 走看看