首页
学习
活动
专区
圈层
工具
发布
    • 综合排序
    • 最热优先
    • 最新优先
    时间不限
  • 来自专栏狗哥的 Java 世界

    啥?小胖连公平锁 & 非公平锁都不知道?真的菜!

    printQueue; public Job(PrintQueue printQueue) { this.printQueue = printQueue; } has been printed Thread 2: PrintQueue: Printing a Job during 6 seconds Thread 2: PrintQueue: Printing printed Thread 4: PrintQueue: Printing a Job during 4 seconds Thread 4: PrintQueue: Printing a Job during 6: PrintQueue: Printing a Job during 2 seconds Thread 6: PrintQueue: Printing a Job during 6 seconds document has been printed Thread 9: PrintQueue: Printing a Job during 3 seconds Thread 9: PrintQueue

    61910发布于 2020-12-17
  • 来自专栏JAVA乐园

    java并发之同步辅助类semaphore

    import java.util.concurrent.locks.Lock; import java.util.concurrent.locks.ReentrantLock; public class PrintQueue semaphore; //是否空闲打印机 private boolean freePrinters[]; private Lock lockPrinters; public PrintQueue printQueue; public Job(PrintQueue printQueue){ this.printQueue=printQueue; } printQueue=new PrintQueue(); //启动12个打印线程 Thread thread[]=new Thread[12]; for (int i =0; i<12; i++){ thread[i]=new Thread(new Job(printQueue),"Thread "+i); }

    32810编辑于 2022-06-30
  • 来自专栏历史专栏

    【愚公系列】2023年11月 WPF控件专题 PrintDialog控件详解

    printQueue = printDialog.PrintQueue; // 使用打印参数打印文档 // ...}需要注意的是,PrintDialog控件是一个模态对话框,即当它弹出时, 另外,该控件提供了一些常用的打印设置,但如果需要更精细的控制,可以使用PrintTicket和PrintQueue对象自己进行参数的设置。 1.属性介绍WPF中PrintDialog控件有以下属性:PrintQueue:获取或设置当前打印任务的打印队列。PrintTicket:获取或设置用于打印任务的打印机设置。 (printDialog.ShowDialog() == true) { // Set printer and page settings printDialog.PrintQueue = new PrintQueue(new PrintServer(), "Microsoft Print to PDF"); printDialog.PrintTicket = printDialog.PrintQueue.DefaultPrintTicket

    1.3K11编辑于 2023-11-16
  • 来自专栏hbbliyong

    WPF备忘录(6)WPF实现打印功能

    其中设置打印属性的是PrintTicket,管理打印机的是PrintQueue。 FrameworkElement element) { var printDialog = new PrintDialog(); SetPrintProperty(printDialog); var printQueue = SelectedPrintServer(PrintServerName, PrintName); if (printQueue ! = null) { printDialog.PrintQueue = printQueue; printDialog.PrintVisual(element, ""); } } /// <summary = printServer.GetPrintQueue(printerName); return printQueue; } catch (Exception) { return null;//没有找到打印机

    2.8K50发布于 2018-03-05
  • 来自专栏IT架构圈

    java并发之辅助类semaphore

    import java.util.concurrent.locks.Lock; import java.util.concurrent.locks.ReentrantLock; public class PrintQueue private Semaphore semaphore; //是否空闲打印机 private boolean freePrinters[]; private Lock lockPrinters; public PrintQueue printQueue; public Job(PrintQueue printQueue){ this.printQueue=printQueue; } printQueue=new PrintQueue(); //启动12个打印线程 Thread thread[]=new Thread[12]; for (int i=0; i <12; i++){ thread[i]=new Thread(new Job(printQueue),"Thread "+i); } for (int i=0; i<12

    58330发布于 2018-06-01
  • 来自专栏总栏目

    队列(顺序存储结构)

    初始化队列 :initqueue  ,  销毁队列: destroyqueue  ,  判断为空: emptyqueue //  进队列 enqueue   , 出队列  dequeueu   打印队列 printqueue >front=(q->front+1)%maxsize; e=q->data[q->front];//因为队列中必须空一个数,空的数我们让front指向 return true; } void printqueue } int main(){ squeue *q; elemtype e; initqueue(q); for(elemtype i=1;i<=10;i++) enqueue(q,i); printqueue (q); enqueue(q,5); enqueue(q,7); printqueue(q); dequeue(q,e); dequeue(q,e); dequeue(q,e); printqueue

    75230编辑于 2022-09-05
  • 来自专栏静默虚空的博客

    队列

    } qu.front = (qu.front + 1) % MAXSIZE; data = qu.data[qu.front]; return 0; } void PrintQueue (i = 0; i < sizeof(array)/sizeof(ElemType); i++) { InQueue(queue, array[i]); } PrintQueue (queue); OutQueue(queue, data); OutQueue(queue, data); PrintQueue(queue); InQueue(queue , 11); InQueue(queue, 12); PrintQueue(queue); return 0; }

    68980发布于 2018-01-05
  • 来自专栏python3

    Python: ping网段内所有ip并

    subprocess.PIPE)     out=p.stdout.read()     result=regex.findall(out.decode(decoding))     if result:         printQueue.put (result[0][0]),int(result[0][1]),int(result[0][2])))         return (ip,result[0]) def resultPrint(printQueue ):     while True:         try:             data=printQueue.get()         except queue.Empty:              pass         else:             with safeprint:                 print(data) printQueue=queue.Queue() safeprint=_thread.allocate_lock() thread=threading.Thread(target=resultPrint,args=(printQueue,)) thread.daemon

    2.6K10发布于 2020-01-08
  • 来自专栏JAVA乐园

    java并发之同步辅助类CountDownLatch

    import java.util.concurrent.locks.Lock; import java.util.concurrent.locks.ReentrantLock; public class PrintQueue semaphore; //是否空闲打印机 private boolean freePrinters[]; private Lock lockPrinters; public PrintQueue getPrinter(); Long duration=(long)(Math.random()*10); System.out.printf("%s: PrintQueue

    33420编辑于 2022-06-30
  • 来自专栏.NET开发那点事

    WPF PrintDialog 支持选择打印范围

                    var fdsCopy = xpsDoc.GetFixedDocumentSequence();                 var xdw =System.Printing.PrintQueue.CreateXpsDocumentWriter (this.PrintQueue);                 var vtxd = (VisualsToXpsDocument)xdw.CreateVisualsCollator();                 

    63020编辑于 2022-05-07
  • 来自专栏总栏目

    队列(链式存储结构)

    ->rear=q->front=NULL; else q->front=q->front->next; e=p->data; free(p); return true; } void printqueue cout<<endl; } int main(){ int e; squeue * q; initqueue(q); for(int i=1;i<10;i++) enqueue(q,i); printqueue (q); dequeue(q,e); dequeue(q,e); printqueue(q); } 教材标准队列 //链队运算算法 #include <stdio.h> #include <malloc.h ->rear=q->front=NULL; else q->front=q->front->next; e=p->data; free(p); return true; } void printqueue { squeue *q; initqueue(q); int n;//声明n个人 n=8;//因为题目中是8个人 for(int i=1;i<=n;i++) enqueue(q,i); printqueue

    74020编辑于 2022-09-05
  • 来自专栏小洁叫你mysql

    c语言数据结构栈和队列代码实现

    else Q->next = node->next; free(node); node = NULL; Q->data--; } // 打印函数 void printQueue ) { Node* Q = initQueue(); enQueue(Q, 1); enQueue(Q, 2); deQueue(Q); printf("%d\n", Q->data); printQueue

    36010编辑于 2023-10-10
  • 来自专栏全栈程序员必看

    python解析xps文件_xps文件的基本操作

    / 打印 /// /// 打印机名称 /// 打印文件路径 public static void PrintXPS(string strPrint, string xpsFilePath) { PrintQueue defaultPrintQueue = new PrintQueue(new PrintServer(), strPrint); string filename = Path.GetFileName(

    1K20编辑于 2022-09-06
  • 数据结构实验之操作系统打印机管理器问题

    则更新头指针和尾指针,使二者均置为空       e = s->data;//返回值       delete s;//释放临时结点       return e;//返回    } } //打印 void printQueue temp;       EnQueue(Q, temp);       break;    case 2:       cout << "---获取当前已有任务列表---" << endl;       printQueue

    16300编辑于 2025-05-28
  • 来自专栏半生瓜のblog

    【数据结构】队列(C++)

    return true; } //输出 void printQueue(SeqQueue* SQ) { if (isEmpty(SQ)) { return; } int LQ->front) { LQ->rear = NULL; } return true; } //打印输出 void printQueue(LinkQueue* LQ) { if (! 队首指针后移 SQ->front = (SQ->front + 1) % MAX_SIZE; return true; } //打印输出 //从第一个位置之后,rear都指向一个空的位置 bool printQueue recvPrev->next = deleteTmp->next; delete deleteTmp; Q->length--; return true; } //打印 bool printQueue

    81330编辑于 2023-05-13
  • 来自专栏MiningAlgorithms

    Data Structures and Algorithms Basics(007):Stack-Queue

    _front = 0 def printqueue(self): for i in range(self. () myqueue.dequeue() myqueue.dequeue() print ('size was: ', str(len(myqueue))) myqueue.printqueue () myqueue.enqueue(6) myqueue.enqueue(7) myqueue.printqueue() myqueue.dequeue() myqueue.dequeue () print ('size was: ', str(len(myqueue))) myqueue.printqueue() myqueue.dequeue() myqueue.dequeue () myqueue.dequeue() print ('size was: ', str(len(myqueue))) myqueue.printqueue() #myqueue.dequeue

    44020发布于 2019-08-08
  • 使用React如何静默打印页面:完整的前端打印解决方案

    打印性能优化// utils/printOptimizer.jsexport class PrintOptimizer { constructor() { this.printQueue = [ (printTask); this.processQueue(); } async processQueue() { if (this.isProcessing || this.printQueue.length const concurrentTasks = []; // 控制并发数量 for (let i = 0; i < Math.min(this.maxConcurrent, this.printQueue.length ); i++) { const task = this.printQueue.shift(); concurrentTasks.push(this.executeTask(task) await Promise.allSettled(concurrentTasks); this.isProcessing = false; // 继续处理剩余任务 if (this.printQueue.length

    40010编辑于 2025-10-24
  • 前端打印插件Lodop与web-print-pdf npm包的深度对比分析

    原生异步语法支持// web-print-pdf npm包:完全支持现代JavaScript异步语法class PrintService { constructor() { this.printQueue content, options, status: 'pending' }; this.printQueue.push return; } this.isProcessing = true; try { while (this.printQueue.length > 0) { const task = this.printQueue.shift(); task.status = 'processing false; } } // 异步获取打印状态 async getPrintStatus(taskId) { const task = this.printQueue.find

    85010编辑于 2025-08-11
  • 来自专栏Java

    synchronized关键字与ReentrantLock的区别和应用

    import java.util.concurrent.locks.Lock; import java.util.concurrent.locks.ReentrantLock; public class PrintQueue long) (Math.random() * 10000); System.out.println(Thread.currentThread().getName() + ": PrintQueue } finally { queueLock.unlock(); // 确保锁被释放 } } } 代码的运行过程: 首先,我们定义了一个名为 PrintQueue

    27710编辑于 2025-01-21
  • 来自专栏技术之路

    c#获取打印机状态

    我在下面只取了其中的几个值,可以根据你的需要获取状态 using System.Printing; public static void GetPrintStatus() { PrintQueue

    61210编辑于 2024-04-23
领券