关于IDEA的Incoming窗口的问题 5C

IDEA集成SVN插件,用的是TortoiseSVN,SVN上明明有别人提交的内容,但是我这里点击
Incoming确显示不出来,为什么,有人知道吗?图片说明

4个回答

刷新一下试试。clean project

srjzh
sunruijie01 试过了,没用的
大约 2 年之前 回复

1、确保提交和更新的是同一个目录
2、确保代码真的提交到SVN上了,可让其他人试试能否同步到代码
3、网络正常
若以上都确保没问题,则可能是svn版本有问题

1、安装tortoiseSVN时必须选择command line client tools,否则就不会安装支持命令行的svn.exe等插件
2、配置svn的环境变量,如果svn的安装目录是:D:\Program Files\TortoiseSVN,则在path变量后知己增加 ;D:\Program Files\TortoiseSVN\bin
检查cmd ,svn help 如果提示如下,就安装成功
3、在Settings 里面检查Intellij IDEA的svn命令配置,一般默认就行

srjzh
sunruijie01 你说的这些都有...
接近 2 年之前 回复

如果别人提交的东西你没有更新下来,那这里就会显示,如果你已经更新下来了,这里就不会显示了,可以在repository里面看提交记录

Lidong_USMC
Lidong_USMC 回复srjzh: 兄dei 问题解决了吗
一年多之前 回复
srjzh
sunruijie01 这个我知道,但是明显有人家提交的,我自己这里没更新,还是不显示出来
接近 2 年之前 回复
Csdn user default icon
上传中...
上传图片
插入图片
抄袭、复制答案,以达到刷声望分或其他目的的行为,在CSDN问答是严格禁止的,一经发现立刻封号。是时候展现真正的技术了!
其他相关推荐
IDEA 2019.2.2 版本 使用svn时 version control中的incoming不显示服务器上有更新的数据
### 可以确定有别人提交了代码,可是我这里什么都不显示 ![图片说明](https://img-ask.csdn.net/upload/201910/16/1571188554_208278.png) ### 另外,Local Changes 和Repository窗口是可以显示的 V●ᴥ●V
idea svn there are no incoming changes
idea svn 没法像eclipse 一样,与资源库同步,查看资源库修改的内容,每次更新只能更新所有的内容![图片说明](https://img-ask.csdn.net/upload/201607/20/1469000904_768116.jpg)
这边有个prosody关于启动的问题不知道哪位大神,知道如何解决?感谢了
``` Dec 25 15:30:08 startup info Hello and welcome to Prosody version 0.11.3 Dec 25 15:30:08 startup info Prosody is using the select backend for connection handling Dec 25 15:30:08 portmanager info Activated service 'component' on [127.0.0.1]:5347, [::1]:5347 Dec 25 15:30:08 portmanager info Activated service 's2s' on [::]:5269, [*]:5269 Dec 25 15:30:08 portmanager info Activated service 'http' on [::]:5280, [*]:5280 Dec 25 15:30:08 portmanager error Error binding encrypted port for https: No certificate present in SSL/TLS configuration for https port 5281 Dec 25 15:30:08 portmanager error Error binding encrypted port for https: No certificate present in SSL/TLS configuration for https port 5281 Dec 25 15:30:08 portmanager info Activated service 'https' on no ports Dec 25 15:30:08 portmanager info Activated service 'c2s' on [::]:5222, [*]:5222 Dec 25 15:30:08 portmanager info Activated service ' ' on no ports Dec 25 15:30:08 mod_posix info Prosody is about to detach from the console, disabling further console output Dec 25 15:30:08 mod_posix info Successfully daemonized to PID 9750 Dec 25 15:30:19 jcp164f750 info Incoming Jabber component connection Dec 25 15:30:19 jitsi-videobridge.xxxx.xxxx.xx.xxxx:component info External component successfully authenticated**** ```
mac idea进去没多久就闪退
进idea没怎样就闪退,然后弹出这个 Process: idea [829] Path: /Applications/IntelliJ IDEA.app/Contents/MacOS/idea Identifier: com.jetbrains.intellij Version: 2019.1.3 (IU-191.7479.19) Code Type: X86-64 (Native) Parent Process: ??? [762] Responsible: idea [829] User ID: 501 Date/Time: 2019-07-02 09:37:20.989 +0800 OS Version: Mac OS X 10.14.3 (18D109) Report Version: 12 Bridge OS Version: 3.3 (16P3133) Anonymous UUID: D6A9AD59-F31C-E5FC-F80F-6AF70E8FF5B4 Time Awake Since Boot: 290 seconds System Integrity Protection: enabled Crashed Thread: 34 Java: AWT-EventQueue-0 2019.1.3#IU-191.7479.19 IDEA, eap:false, Exception Type: EXC_BAD_ACCESS (SIGABRT) Exception Codes: KERN_PROTECTION_FAILURE at 0x00000001023fa100 Exception Note: EXC_CORPSE_NOTIFY VM Regions Near 0x1023fa100: __LINKEDIT 00000001023f7000-00000001023fa000 [ 12K] r--/rwx SM=COW /Applications/IntelliJ IDEA.app/Contents/jdk/Contents/Home/jre/lib/jli/libjli.dylib --> VM_ALLOCATE 00000001023fa000-00000001023fb000 [ 4K] r--/rwx SM=COW VM_ALLOCATE 00000001023fb000-00000001023fc000 [ 4K] r--/r-- SM=PRV Application Specific Information: abort() called Thread 0:: AppKit Thread Dispatch queue: com.apple.main-thread 0 libsystem_kernel.dylib 0x00007fff7702a17a mach_msg_trap + 10 1 libsystem_kernel.dylib 0x00007fff7702a6d0 mach_msg + 60 2 com.apple.CoreFoundation 0x00007fff49ca3fde __CFRunLoopServiceMachPort + 337 3 com.apple.CoreFoundation 0x00007fff49ca352d __CFRunLoopRun + 1654 4 com.apple.CoreFoundation 0x00007fff49ca2c64 CFRunLoopRunSpecific + 463 5 com.apple.Foundation 0x00007fff4c0094aa -[NSRunLoop(NSRunLoop) runMode:beforeDate:] + 280 6 libawt_lwawt.dylib 0x000000010a86de27 Java_sun_lwawt_macosx_LWCToolkit_doAWTRunLoopImpl + 256 7 ??? 0x000000010b7ac3a7 0 + 4487562151 8 ??? 0x000000010b79bffd 0 + 4487495677 9 ??? 0x000000010b79bffd 0 + 4487495677 10 ??? 0x000000010b79bffd 0 + 4487495677 11 ??? 0x000000010b79bffd 0 + 4487495677 12 ??? 0x000000010b7944e7 0 + 4487464167 13 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 14 libjvm.dylib 0x00000001048e052a jni_invoke_nonstatic(JNIEnv_*, JavaValue*, _jobject*, JNICallType, _jmethodID*, JNI_ArgumentPusher*, Thread*) + 748 15 libjvm.dylib 0x00000001048d0758 jni_CallObjectMethodV + 248 16 JavaNativeFoundation 0x00007fff4de68758 JNFCallObjectMethod + 175 17 libawt_lwawt.dylib 0x000000010a83bfaf -[AWTView selectedRange] + 102 18 com.apple.AppKit 0x00007fff47597ca5 -[NSTextInputContext(NSInputContext_WithCompletion) selectedRangeWithCompletionHandler:] + 95 19 com.apple.AppKit 0x00007fff4751d7f3 -[NSTextInputContext handleTSMEvent:completionHandler:] + 1528 20 com.apple.AppKit 0x00007fff4751d185 _NSTSMEventHandler + 306 21 com.apple.HIToolbox 0x00007fff48f37af9 DispatchEventToHandlers(EventTargetRec*, OpaqueEventRef*, HandlerCallRec*) + 1502 22 com.apple.HIToolbox 0x00007fff48f36e36 SendEventToEventTargetInternal(OpaqueEventRef*, OpaqueEventTargetRef*, HandlerCallRec*) + 371 23 com.apple.HIToolbox 0x00007fff48f36cbc SendEventToEventTargetWithOptions + 45 24 com.apple.HIToolbox 0x00007fff48f9f730 SendTSMEvent_WithCompletionHandler + 383 25 com.apple.HIToolbox 0x00007fff49142433 __SendTextInputEvent_WithCompletionHandler_block_invoke + 489 26 com.apple.HIToolbox 0x00007fff4914081c SendTextInputEvent_WithCompletionHandler + 1130 27 com.apple.HIToolbox 0x00007fff491a651f -[IMKInputSession _postEvent:completionHandler:] + 170 28 com.apple.HIToolbox 0x00007fff491bb49a -[IMKInputSession selectedRange_withCompletionHandler:] + 288 29 com.apple.HIToolbox 0x00007fff491a6e3f __49-[IMKInputSession imkxpc_selectedRangeWithReply:]_block_invoke + 470 30 com.apple.CoreFoundation 0x00007fff49ce0c37 __CFRUNLOOP_IS_CALLING_OUT_TO_A_BLOCK__ + 12 31 com.apple.CoreFoundation 0x00007fff49ca3c6d __CFRunLoopDoBlocks + 395 32 com.apple.CoreFoundation 0x00007fff49ca39c9 __CFRunLoopRun + 2834 33 com.apple.CoreFoundation 0x00007fff49ca2c64 CFRunLoopRunSpecific + 463 34 com.apple.HIToolbox 0x00007fff48f85883 -[IMKInputSessionXPCInvocation invocationAwaitXPCReply] + 551 35 com.apple.HIToolbox 0x00007fff49187e8f -[IMKClient menuWithCompletionHandler:] + 2658 36 com.apple.HIToolbox 0x00007fff491519f7 IMKInputSessionGetMenuIntoMenuWithCompletionHandler + 132 37 com.apple.HIToolbox 0x00007fff491510e9 GetInputMethodInstanceMenu_IntoMenu_WithCompletionHandler + 122 38 com.apple.HIToolbox 0x00007fff49144eb6 utTryToSetupInputMethodMenu + 292 39 com.apple.HIToolbox 0x00007fff49144d04 __utSetupInputMethodMenuFromDeferredBlock_block_invoke + 196 40 com.apple.CoreFoundation 0x00007fff49ce0c37 __CFRUNLOOP_IS_CALLING_OUT_TO_A_BLOCK__ + 12 41 com.apple.CoreFoundation 0x00007fff49ca3c6d __CFRunLoopDoBlocks + 395 42 com.apple.CoreFoundation 0x00007fff49ca336b __CFRunLoopRun + 1204 43 com.apple.CoreFoundation 0x00007fff49ca2c64 CFRunLoopRunSpecific + 463 44 com.apple.HIToolbox 0x00007fff48f39ab5 RunCurrentEventLoopInMode + 293 45 com.apple.HIToolbox 0x00007fff48f396f4 ReceiveNextEventCommon + 371 46 com.apple.HIToolbox 0x00007fff48f39568 _BlockUntilNextEventMatchingListInModeWithFilter + 64 47 com.apple.AppKit 0x00007fff471f4363 _DPSNextEvent + 997 48 com.apple.AppKit 0x00007fff471f3102 -[NSApplication(NSEvent) _nextEventMatchingEventMask:untilDate:inMode:dequeue:] + 1362 49 libosxapp.dylib 0x000000010a8f82dc -[NSApplicationAWT nextEventMatchingMask:untilDate:inMode:dequeue:] + 124 50 com.apple.AppKit 0x00007fff471ed165 -[NSApplication run] + 699 51 libosxapp.dylib 0x000000010a8f7f26 +[NSApplicationAWT runAWTLoopWithApp:] + 156 52 libawt_lwawt.dylib 0x000000010a87ee5b -[AWTStarter starter:] + 905 53 com.apple.Foundation 0x00007fff4c09ebab __NSThreadPerformPerform + 327 54 com.apple.CoreFoundation 0x00007fff49cc0395 __CFRUNLOOP_IS_CALLING_OUT_TO_A_SOURCE0_PERFORM_FUNCTION__ + 17 55 com.apple.CoreFoundation 0x00007fff49cc033b __CFRunLoopDoSource0 + 108 56 com.apple.CoreFoundation 0x00007fff49ca3dd1 __CFRunLoopDoSources0 + 195 57 com.apple.CoreFoundation 0x00007fff49ca337a __CFRunLoopRun + 1219 58 com.apple.CoreFoundation 0x00007fff49ca2c64 CFRunLoopRunSpecific + 463 59 com.jetbrains.intellij 0x000000010237ee0d main + 336 60 libdyld.dylib 0x00007fff76ef0ed9 start + 1 Thread 35:: Java: TimerQueue 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a409e9 Parker::park(bool, long) + 527 3 libjvm.dylib 0x0000000104b3865f Unsafe_Park + 126 4 ??? 0x000000010c12992a 0 + 4497512746 5 ??? 0x000000010c29890c 0 + 4499015948 6 ??? 0x000000010b79c042 0 + 4487495746 7 ??? 0x000000010b7944e7 0 + 4487464167 8 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 9 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 10 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 11 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 12 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 13 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 14 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 15 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 16 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 17 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 36:: Java: AWT-SelectorPerformer pool-1-thread-1 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a409d8 Parker::park(bool, long) + 510 3 libjvm.dylib 0x0000000104b3865f Unsafe_Park + 126 4 ??? 0x000000010c12992a 0 + 4497512746 5 ??? 0x000000010c8ddabc 0 + 4505590460 6 ??? 0x000000010cd06374 0 + 4509950836 7 ??? 0x000000010b79bffd 0 + 4487495677 8 ??? 0x000000010b79c042 0 + 4487495746 9 ??? 0x000000010b79bd80 0 + 4487495040 10 ??? 0x000000010b7944e7 0 + 4487464167 11 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 12 libjvm.dylib 0x00000001049097fa JVM_DoPrivileged + 1208 13 ??? 0x000000010b7ac3a7 0 + 4487562151 14 ??? 0x000000010b79bd80 0 + 4487495040 15 ??? 0x000000010b79c042 0 + 4487495746 16 ??? 0x000000010b7944e7 0 + 4487464167 17 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 18 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 19 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 20 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 21 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 22 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 23 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 24 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 25 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 26 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 37:: Java: fsnotifier 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a3fd12 os::PlatformEvent::park() + 192 3 libjvm.dylib 0x0000000104a380f5 ObjectMonitor::wait(long, bool, Thread*) + 763 4 libjvm.dylib 0x0000000104aeff88 ObjectSynchronizer::wait(Handle, long, Thread*) + 202 5 libjvm.dylib 0x000000010490abbb JVM_MonitorWait + 156 6 ??? 0x000000010ba02468 0 + 4490011752 7 ??? 0x000000010b79bffd 0 + 4487495677 8 ??? 0x000000010b79bffd 0 + 4487495677 9 ??? 0x000000010b79ba40 0 + 4487494208 10 ??? 0x000000010b79bffd 0 + 4487495677 11 ??? 0x000000010b79c042 0 + 4487495746 12 ??? 0x000000010b79bffd 0 + 4487495677 13 ??? 0x000000010b79bffd 0 + 4487495677 14 ??? 0x000000010b79c042 0 + 4487495746 15 ??? 0x000000010b79be54 0 + 4487495252 16 ??? 0x000000010b79c042 0 + 4487495746 17 ??? 0x000000010b79bffd 0 + 4487495677 18 ??? 0x000000010b79c042 0 + 4487495746 19 ??? 0x000000010b7944e7 0 + 4487464167 20 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 21 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 22 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 23 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 24 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 25 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 26 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 27 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 28 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 29 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 38:: Java: BaseDataReader: output stream of fsnotifier 0 libsystem_kernel.dylib 0x00007fff7702be5e read + 10 1 libjava.dylib 0x0000000105101621 handleRead + 34 2 libjava.dylib 0x00000001051012cb readBytes + 395 3 ??? 0x000000010bf19e42 0 + 4495351362 4 ??? 0x000000010befba64 0 + 4495227492 Thread 39:: Java: BaseDataReader: error stream of fsnotifier 0 libsystem_kernel.dylib 0x00007fff7702be5e read + 10 1 libjava.dylib 0x0000000105101621 handleRead + 34 2 libjava.dylib 0x00000001051012cb readBytes + 395 3 ??? 0x000000010b7ac3a7 0 + 4487562151 4 ??? 0x000000010b79ba40 0 + 4487494208 5 ??? 0x000000010c13eaa4 0 + 4497599140 6 ??? 0x000000010b79b7d0 0 + 4487493584 7 ??? 0x000000010b79b7d0 0 + 4487493584 8 ??? 0x000000010b79bffd 0 + 4487495677 9 ??? 0x000000010b79c042 0 + 4487495746 10 ??? 0x000000010b79bffd 0 + 4487495677 11 ??? 0x000000010b79bffd 0 + 4487495677 12 ??? 0x000000010b79c042 0 + 4487495746 13 ??? 0x000000010b79be54 0 + 4487495252 14 ??? 0x000000010b79c042 0 + 4487495746 15 ??? 0x000000010b79bffd 0 + 4487495677 16 ??? 0x000000010b79c042 0 + 4487495746 17 ??? 0x000000010b7944e7 0 + 4487464167 18 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 19 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 20 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 21 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 22 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 23 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 24 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 25 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 26 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 27 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 40:: Java: FeatureUsageFileEventLogger 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a409d8 Parker::park(bool, long) + 510 3 libjvm.dylib 0x0000000104b3865f Unsafe_Park + 126 4 ??? 0x000000010c12992a 0 + 4497512746 5 ??? 0x000000010c28760c 0 + 4498945548 6 ??? 0x000000010cd06374 0 + 4509950836 7 ??? 0x000000010b79bffd 0 + 4487495677 8 ??? 0x000000010b79c042 0 + 4487495746 9 ??? 0x000000010b7944e7 0 + 4487464167 10 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 11 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 12 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 13 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 14 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 15 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 16 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 17 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 18 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 19 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 41:: Java: Netty Builtin Server 2 0 libsystem_kernel.dylib 0x00007fff77030716 kevent + 10 1 libnio.dylib 0x000000010a4679e8 Java_sun_nio_ch_KQueueArrayWrapper_kevent0 + 98 2 ??? 0x000000010b7ac3a7 0 + 4487562151 3 ??? 0x000000010b79ba40 0 + 4487494208 4 ??? 0x000000010b79ba40 0 + 4487494208 5 ??? 0x000000010b79ba40 0 + 4487494208 6 ??? 0x000000010b79ba40 0 + 4487494208 7 ??? 0x000000010b79ba40 0 + 4487494208 8 ??? 0x000000010b79ba40 0 + 4487494208 9 ??? 0x000000010b79bffd 0 + 4487495677 10 ??? 0x000000010b79bffd 0 + 4487495677 11 ??? 0x000000010b79c042 0 + 4487495746 12 ??? 0x000000010b7944e7 0 + 4487464167 13 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 14 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 15 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 16 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 17 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 18 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 19 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 20 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 21 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 22 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 42:: Java: process reaper 0 libsystem_kernel.dylib 0x00007fff7702f2d2 __wait4 + 10 1 libjava.dylib 0x00000001050fe0db Java_java_lang_UNIXProcess_waitForProcessExit + 29 2 ??? 0x000000010b7ac3a7 0 + 4487562151 3 ??? 0x000000010b79ba40 0 + 4487494208 4 ??? 0x000000010b79bffd 0 + 4487495677 5 ??? 0x000000010b79c042 0 + 4487495746 6 ??? 0x000000010b79bffd 0 + 4487495677 7 ??? 0x000000010b79c042 0 + 4487495746 8 ??? 0x000000010b7944e7 0 + 4487464167 9 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 10 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 11 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 12 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 13 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 14 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 15 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 16 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 17 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 18 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 43:: Java: java 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a3fd12 os::PlatformEvent::park() + 192 3 libjvm.dylib 0x0000000104a380f5 ObjectMonitor::wait(long, bool, Thread*) + 763 4 libjvm.dylib 0x0000000104aeff88 ObjectSynchronizer::wait(Handle, long, Thread*) + 202 5 libjvm.dylib 0x000000010490abbb JVM_MonitorWait + 156 6 ??? 0x000000010ba02468 0 + 4490011752 7 ??? 0x000000010b79bffd 0 + 4487495677 8 ??? 0x000000010b79bffd 0 + 4487495677 9 ??? 0x000000010b79ba40 0 + 4487494208 10 ??? 0x000000010b79bffd 0 + 4487495677 11 ??? 0x000000010b79c042 0 + 4487495746 12 ??? 0x000000010b79bffd 0 + 4487495677 13 ??? 0x000000010b79bffd 0 + 4487495677 14 ??? 0x000000010b79c042 0 + 4487495746 15 ??? 0x000000010cb0c3d4 0 + 4507878356 16 ??? 0x000000010b79bffd 0 + 4487495677 17 ??? 0x000000010b79c042 0 + 4487495746 18 ??? 0x000000010b7944e7 0 + 4487464167 19 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 20 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 21 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 22 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 23 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 24 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 25 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 26 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 27 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 28 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 44:: Java: BaseDataReader: output stream of java 0 libsystem_kernel.dylib 0x00007fff7702be5e read + 10 1 libjava.dylib 0x0000000105101621 handleRead + 34 2 libjava.dylib 0x00000001051012cb readBytes + 395 3 ??? 0x000000010bf19e42 0 + 4495351362 4 ??? 0x000000010befba64 0 + 4495227492 Thread 45:: Java: BaseDataReader: error stream of java 0 libsystem_kernel.dylib 0x00007fff7702be5e read + 10 1 libjava.dylib 0x0000000105101621 handleRead + 34 2 libjava.dylib 0x00000001051012cb readBytes + 395 3 ??? 0x000000010bf19e42 0 + 4495351362 4 ??? 0x000000010befba64 0 + 4495227492 Thread 46:: Java: ApplicationImpl pooled thread 4 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a409e9 Parker::park(bool, long) + 527 3 libjvm.dylib 0x0000000104b3865f Unsafe_Park + 126 4 ??? 0x000000010c12992a 0 + 4497512746 5 ??? 0x000000010c8ddbc4 0 + 4505590724 6 ??? 0x000000010b79bffd 0 + 4487495677 7 ??? 0x000000010b79c042 0 + 4487495746 8 ??? 0x000000010b7944e7 0 + 4487464167 9 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 10 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 11 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 12 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 13 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 14 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 15 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 16 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 17 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 18 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 47:: Java: ApplicationImpl pooled thread 5 0 libsystem_kernel.dylib 0x00007fff7702a282 swtch_pri + 10 1 libsystem_pthread.dylib 0x00007fff770e6ebe sched_yield + 11 2 libjvm.dylib 0x0000000104903c49 JVM_Yield + 87 3 ??? 0x000000010cef682c 0 + 4511983660 4 ??? 0x000000010bcd9534 0 + 4492989748 Thread 48:: Java: JobScheduler FJ pool 1/3 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a409e9 Parker::park(bool, long) + 527 3 libjvm.dylib 0x0000000104b3865f Unsafe_Park + 126 4 ??? 0x000000010c12992a 0 + 4497512746 5 ??? 0x000000010b79bffd 0 + 4487495677 6 ??? 0x000000010b79b7d0 0 + 4487493584 7 ??? 0x000000010b79bffd 0 + 4487495677 8 ??? 0x000000010b7944e7 0 + 4487464167 9 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 10 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 11 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 12 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 13 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 14 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 15 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 16 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 17 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 18 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 49:: Java: ApplicationImpl pooled thread 6 0 libsystem_kernel.dylib 0x00007fff7702a282 swtch_pri + 10 1 libsystem_pthread.dylib 0x00007fff770e6ebe sched_yield + 11 2 libjvm.dylib 0x0000000104903c49 JVM_Yield + 87 3 ??? 0x000000010cef682c 0 + 4511983660 4 ??? 0x000000010bcd9534 0 + 4492989748 Thread 50:: Java: ApplicationImpl pooled thread 7 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a409e9 Parker::park(bool, long) + 527 3 libjvm.dylib 0x0000000104b3865f Unsafe_Park + 126 4 ??? 0x000000010c12992a 0 + 4497512746 5 ??? 0x000000010c8ddbc4 0 + 4505590724 6 ??? 0x000000010b79bffd 0 + 4487495677 7 ??? 0x000000010b79c042 0 + 4487495746 8 ??? 0x000000010b7944e7 0 + 4487464167 9 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 10 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 11 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 12 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 13 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 14 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 15 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 16 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 17 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 18 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 51:: Java: ApplicationImpl pooled thread 8 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a409e9 Parker::park(bool, long) + 527 3 libjvm.dylib 0x0000000104b3865f Unsafe_Park + 126 4 ??? 0x000000010c12992a 0 + 4497512746 5 ??? 0x000000010c8ddbc4 0 + 4505590724 6 ??? 0x000000010b79bffd 0 + 4487495677 7 ??? 0x000000010b79c042 0 + 4487495746 8 ??? 0x000000010b7944e7 0 + 4487464167 9 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 10 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 11 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 12 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 13 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 14 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 15 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 16 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 17 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 18 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Thread 52:: Java: ApplicationImpl pooled thread 9 0 libsystem_kernel.dylib 0x00007fff7702d3e6 __recvfrom + 10 1 libnet.dylib 0x000000010a47fa68 NET_Read + 152 2 libnet.dylib 0x000000010a47e83f Java_java_net_SocketInputStream_socketRead0 + 624 3 ??? 0x000000010b7ac3a7 0 + 4487562151 4 ??? 0x000000010b79ba40 0 + 4487494208 5 ??? 0x000000010b79ba40 0 + 4487494208 6 ??? 0x000000010b79ba40 0 + 4487494208 7 ??? 0x000000010cfde0c8 0 + 4512932040 Thread 53:: Java: ApplicationImpl pooled thread 10 0 libsystem_kernel.dylib 0x00007fff7702d7de __psynch_cvwait + 10 1 libsystem_pthread.dylib 0x00007fff770e7593 _pthread_cond_wait + 724 2 libjvm.dylib 0x0000000104a409e9 Parker::park(bool, long) + 527 3 libjvm.dylib 0x0000000104b3865f Unsafe_Park + 126 4 ??? 0x000000010c12992a 0 + 4497512746 5 ??? 0x000000010d6f9cbc 0 + 4520385724 6 ??? 0x000000010b79bffd 0 + 4487495677 7 ??? 0x000000010b79c042 0 + 4487495746 8 ??? 0x000000010b7944e7 0 + 4487464167 9 libjvm.dylib 0x00000001048c5b1a JavaCalls::call_helper(JavaValue*, methodHandle*, JavaCallArguments*, Thread*) + 1710 10 libjvm.dylib 0x00000001048c62be JavaCalls::call_virtual(JavaValue*, KlassHandle, Symbol*, Symbol*, JavaCallArguments*, Thread*) + 356 11 libjvm.dylib 0x00000001048c646a JavaCalls::call_virtual(JavaValue*, Handle, KlassHandle, Symbol*, Symbol*, Thread*) + 74 12 libjvm.dylib 0x00000001049040aa thread_entry(JavaThread*, Thread*) + 124 13 libjvm.dylib 0x0000000104b22335 JavaThread::thread_main_inner() + 155 14 libjvm.dylib 0x0000000104b239fa JavaThread::run() + 448 15 libjvm.dylib 0x0000000104a43ff2 java_start(Thread*) + 246 16 libsystem_pthread.dylib 0x00007fff770e4305 _pthread_body + 126 17 libsystem_pthread.dylib 0x00007fff770e726f _pthread_start + 70 18 libsystem_pthread.dylib 0x00007fff770e3415 thread_start + 13 Logical CPU: 0 Error Code: 0x00000000 Trap Number: 221 External Modification Summary: Calls made by other processes targeting this process: task_for_pid: 0 thread_create: 0 thread_set_state: 0 Calls made by this process: task_for_pid: 0 thread_create: 0 thread_set_state: 0 Calls made by all processes on this machine: task_for_pid: 113 thread_create: 0 thread_set_state: 0 VM Region Summary: ReadOnly portion of Libraries: Total=426.1M resident=0K(0%) swapped_out_or_unallocated=426.1M(100%) Writable regions: Total=828.4M written=0K(0%) resident=0K(0%) swapped_out=0K(0%) unallocated=828.4M(100%) VIRTUAL REGION REGION TYPE SIZE COUNT (non-coalesced) =========== ======= ======= ATS (font support) 32.0M 6 ATS (font support) (reserved) 4K 2 reserved VM address space (unallocated) Accelerate framework 384K 4 Activity Tracing 256K 2 CG backing stores 1056K 4 CG image 336K 5 CoreAnimation 588K 17 CoreGraphics 8K 2 CoreImage 24K 3 CoreUI image data 1656K 16 CoreUI image file 516K 8 Dispatch continuations 8192K 2 Foundation 4K 2 Image IO 256K 2 Kernel Alloc Once 8K 2 MALLOC 199.9M 89 MALLOC guard page 32K 8 Memory Tag 242 12K 2 OpenGL GLSL 128K 3 STACK GUARD 820K 78 Stack 83.6M 78 Stack Guard 56.2M 65 VM_ALLOCATE 2.1G 98 VM_ALLOCATE (reserved) 46.1M 3 reserved VM address space (unallocated) __DATA 28.9M 289 __FONT_DATA 4K 2 __GLSLBUILTINS 5176K 2 __LINKEDIT 220.3M 27 __TEXT 205.8M 288 __UNICODE 564K 2 mapped file 1.7G 835 shared memory 676K 14 =========== ======= ======= TOTAL 4.7G 1928 TOTAL, minus reserved VM space 4.7G 1928 Model: MacBookAir8,1, BootROM 220.240.2.0.0 (iBridge: 16.16.3133.0.0,0), 2 processors, Intel Core i5, 1.6 GHz, 8 GB, SMC Graphics: kHW_IntelUHDGraphics617Item, Intel UHD Graphics 617, Built-In Memory Module: BANK 0/DIMM0, 4 GB, LPDDR3, 2133 MHz, 0x802C, 0x4D5435324C3531324D3634443450512D3039 Memory Module: BANK 1/DIMM0, 4 GB, LPDDR3, 2133 MHz, 0x802C, 0x4D5435324C3531324D3634443450512D3039 AirPort: spairport_wireless_card_type_airport_extreme (0x14E4, 0x843), wl0: Oct 11 2018 22:36:55 version 9.141.4.0.32.6.23 FWID 01-3d163180 Bluetooth: Version 6.0.10f1, 3 services, 27 devices, 1 incoming serial ports Network Service: Wi-Fi, AirPort, en0 USB Device: USB 3.0 Bus USB Device: iBridge Bus USB Device: Apple Internal Keyboard / Trackpad USB Device: Headset USB Device: iBridge ALS USB Device: iBridge FaceTime HD Camera (Built-in) USB Device: iBridge Thunderbolt Bus: MacBook Air, Apple Inc., 34.6 用idea里MacOS下的idea打开,控制台输出的 2019-07-02 09:45:52.042 idea[1732:22393] allVms required 1.8*,1.8+ 2019-07-02 09:45:52.046 idea[1732:22396] Value of IDEA_VM_OPTIONS is (null) 2019-07-02 09:45:52.046 idea[1732:22396] fullFileName is: /Applications/IntelliJ IDEA.app/Contents/bin/idea.vmoptions 2019-07-02 09:45:52.046 idea[1732:22396] fullFileName exists: /Applications/IntelliJ IDEA.app/Contents/bin/idea.vmoptions 2019-07-02 09:45:52.046 idea[1732:22396] Processing VMOptions file at /Applications/IntelliJ IDEA.app/Contents/bin/idea.vmoptions 2019-07-02 09:45:52.047 idea[1732:22396] Done thread '<unnamed>' panicked at 'called `Result::unwrap()` on an `Err` value: ()', libcore/result.rs:945:5 note: Run with `RUST_BACKTRACE=1` for a backtrace. Abort trap: 6 logout Saving session... ...saving history...truncating history files... ...completed.
SVN上面有东西,但在incoming mode里面是空的,怎么解决啊?
我想更新别人的更改,但是incoming中是空的,不知道是不是我改错了什么东西,求助求助
The Screen Behind the Mirror 具体的编写思路
Problem Description Dr. Evil has contracted your valuable services to build for him the world's most powerful "laser". Of course before you spend one billion dollars building the thing, you want to run some simulations first to make sure everything will work as designed. For this phase of the project, you will be simulating part of the aiming system which uses mirrors and other optics to change the direction of the laser beam. The simulation consists of a flat square table with mirrors, beam splitters, and beam detectors arranged on the tabletop, and with each object represented by a one dimensional line segment. The list below describes each of the object types in detail: mirror : A mirror object will reflect any laser beam striking its surface. The reflected beam leaves at the same angle of incidence as the incoming beam. Note that both sides of a mirror object are reflective. detector : A detector is an opaque object which absorbs any laser beam striking it. The simulation must also keep track of which detectors are struck by a laser for program output purposes. Note that a laser beam strike on either side of a detector counts as a "hit". splitter : When a laser beam strikes a splitter, it divides into two beams. One of the new beams will reflect from the splitter surface (as with a mirror), and the other beam will pass through the splitter without changing direction. A splitter will function the same way regardless which side of it is struck by a laser beam. See the figures below for examples of a laser beam's interaction with each of the possible object types: For each simulation, a single laser beam enters the tabletop area. The program must compute the path taken by the laser beam (including secondary beams due to splitters), and it must determine which detectors are struck by a laser beam. You can make the following assumptions in the program: 1. The tabletop surface is a 100 by 100 square, and unless otherwise specified all coordinates in the program's input are given as integers within the tabletop area (i.e. between 0 and 100 inclusive). 2. There will be no overlaps between the line 2. segment objects. 3. The laser which enters the tabletop area always starts from the edge of the table. 4. The simulation of each data set ends when all laser beams have either exited the table top area or have terminated at a detector. 5. For each data set there will be no more than 100 total reflections among all laser beams in that data set. 6. A laser beam will never intersect any object on a vertex and will never be collinear with an object's line segment. 7. Each data set will contain at least one detector object. Input Input to this problem will begin with a line containing a single integer N (1 ≤ N ≤ 100) indicating the number of data sets. Each data set consists of the following components: A single line with four numbers "x,y i,j" where x,y is a point along the table edge at which the laser beam enters, and i,j is a vector with integer components(-1024 ≤ i,j ≤ 1024) specifying the direction of the incoming laser beam, where i corresponds to the x-axis direction and j corresponds to the y-axis direction. A line with a single integer P (1 ≤ P ≤ 100) giving the total number of objects in this data set. A series of P lines, each representing one object, with the first line describing object 1, the second line describing object 2, and so on. Each line begins with a single letter specifying the object type where a "M" indicates a mirror object, "S" a splitter, and "D" a detector. This is followed by two coordinate pairs of the form "x,y", specifying the two end points of the object's line segment. Output For each data set in the input, output the heading "DATA SET #k" where k is 1 for the first data set, 2 for the second, etc. If in this data set none of the detector objects are struck by any laser beams, output the message "NO BEAMS DETECTED". Otherwise, output the object number, one per line, of each detector struck by a laser beam. The list of detectors should be sorted by their object numbers and output in ascending order. If a detector is struck by more than one laser beam, it should only be listed once in the output. Sample Input 1 50,100 0,-1 6 D 0,40 20,20 M 40,20 60,40 D 80,20 100,40 D 0,70 20,90 S 40,90 60,70 D 80,90 100,70 Sample Output DATA SET #1 1 6
WSL里安装g++时遇到问题
在windows store里安装的“Ubuntu”,换了阿里源 在运行`sudo apt install g++`时出现如下报错信息: ``` Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation: The following packages have unmet dependencies: g++ : Depends: g++-5 (>= 5.3.1-3~) but it is not going to be installed E: Unable to correct problems, you have held broken packages. ``` 并且按照中间说的 g++-5 递归安装下去就会GG
The Screen Behind the Mirror
Problem Description Dr. Evil has contracted your valuable services to build for him the world's most powerful "laser". Of course before you spend one billion dollars building the thing, you want to run some simulations first to make sure everything will work as designed. For this phase of the project, you will be simulating part of the aiming system which uses mirrors and other optics to change the direction of the laser beam. The simulation consists of a flat square table with mirrors, beam splitters, and beam detectors arranged on the tabletop, and with each object represented by a one dimensional line segment. The list below describes each of the object types in detail: mirror : A mirror object will reflect any laser beam striking its surface. The reflected beam leaves at the same angle of incidence as the incoming beam. Note that both sides of a mirror object are reflective. detector : A detector is an opaque object which absorbs any laser beam striking it. The simulation must also keep track of which detectors are struck by a laser for program output purposes. Note that a laser beam strike on either side of a detector counts as a "hit". splitter : When a laser beam strikes a splitter, it divides into two beams. One of the new beams will reflect from the splitter surface (as with a mirror), and the other beam will pass through the splitter without changing direction. A splitter will function the same way regardless which side of it is struck by a laser beam. See the figures below for examples of a laser beam's interaction with each of the possible object types: For each simulation, a single laser beam enters the tabletop area. The program must compute the path taken by the laser beam (including secondary beams due to splitters), and it must determine which detectors are struck by a laser beam. You can make the following assumptions in the program: 1. The tabletop surface is a 100 by 100 square, and unless otherwise specified all coordinates in the program's input are given as integers within the tabletop area (i.e. between 0 and 100 inclusive). 2. There will be no overlaps between the line 2. segment objects. 3. The laser which enters the tabletop area always starts from the edge of the table. 4. The simulation of each data set ends when all laser beams have either exited the table top area or have terminated at a detector. 5. For each data set there will be no more than 100 total reflections among all laser beams in that data set. 6. A laser beam will never intersect any object on a vertex and will never be collinear with an object's line segment. 7. Each data set will contain at least one detector object. Input Input to this problem will begin with a line containing a single integer N (1 ≤ N ≤ 100) indicating the number of data sets. Each data set consists of the following components: A single line with four numbers "x,y i,j" where x,y is a point along the table edge at which the laser beam enters, and i,j is a vector with integer components(-1024 ≤ i,j ≤ 1024) specifying the direction of the incoming laser beam, where i corresponds to the x-axis direction and j corresponds to the y-axis direction. A line with a single integer P (1 ≤ P ≤ 100) giving the total number of objects in this data set. A series of P lines, each representing one object, with the first line describing object 1, the second line describing object 2, and so on. Each line begins with a single letter specifying the object type where a "M" indicates a mirror object, "S" a splitter, and "D" a detector. This is followed by two coordinate pairs of the form "x,y", specifying the two end points of the object's line segment. Output For each data set in the input, output the heading "DATA SET #k" where k is 1 for the first data set, 2 for the second, etc. If in this data set none of the detector objects are struck by any laser beams, output the message "NO BEAMS DETECTED". Otherwise, output the object number, one per line, of each detector struck by a laser beam. The list of detectors should be sorted by their object numbers and output in ascending order. If a detector is struck by more than one laser beam, it should only be listed once in the output. Sample Input 1 50,100 0,-1 6 D 0,40 20,20 M 40,20 60,40 D 80,20 100,40 D 0,70 20,90 S 40,90 60,70 D 80,90 100,70 Sample Output DATA SET #1 1 6
The Screen Behind the Mirror 具体思路
Problem Description Dr. Evil has contracted your valuable services to build for him the world's most powerful "laser". Of course before you spend one billion dollars building the thing, you want to run some simulations first to make sure everything will work as designed. For this phase of the project, you will be simulating part of the aiming system which uses mirrors and other optics to change the direction of the laser beam. The simulation consists of a flat square table with mirrors, beam splitters, and beam detectors arranged on the tabletop, and with each object represented by a one dimensional line segment. The list below describes each of the object types in detail: mirror : A mirror object will reflect any laser beam striking its surface. The reflected beam leaves at the same angle of incidence as the incoming beam. Note that both sides of a mirror object are reflective. detector : A detector is an opaque object which absorbs any laser beam striking it. The simulation must also keep track of which detectors are struck by a laser for program output purposes. Note that a laser beam strike on either side of a detector counts as a "hit". splitter : When a laser beam strikes a splitter, it divides into two beams. One of the new beams will reflect from the splitter surface (as with a mirror), and the other beam will pass through the splitter without changing direction. A splitter will function the same way regardless which side of it is struck by a laser beam. See the figures below for examples of a laser beam's interaction with each of the possible object types: For each simulation, a single laser beam enters the tabletop area. The program must compute the path taken by the laser beam (including secondary beams due to splitters), and it must determine which detectors are struck by a laser beam. You can make the following assumptions in the program: 1. The tabletop surface is a 100 by 100 square, and unless otherwise specified all coordinates in the program's input are given as integers within the tabletop area (i.e. between 0 and 100 inclusive). 2. There will be no overlaps between the line 2. segment objects. 3. The laser which enters the tabletop area always starts from the edge of the table. 4. The simulation of each data set ends when all laser beams have either exited the table top area or have terminated at a detector. 5. For each data set there will be no more than 100 total reflections among all laser beams in that data set. 6. A laser beam will never intersect any object on a vertex and will never be collinear with an object's line segment. 7. Each data set will contain at least one detector object. Input Input to this problem will begin with a line containing a single integer N (1 ≤ N ≤ 100) indicating the number of data sets. Each data set consists of the following components: A single line with four numbers "x,y i,j" where x,y is a point along the table edge at which the laser beam enters, and i,j is a vector with integer components(-1024 ≤ i,j ≤ 1024) specifying the direction of the incoming laser beam, where i corresponds to the x-axis direction and j corresponds to the y-axis direction. A line with a single integer P (1 ≤ P ≤ 100) giving the total number of objects in this data set. A series of P lines, each representing one object, with the first line describing object 1, the second line describing object 2, and so on. Each line begins with a single letter specifying the object type where a "M" indicates a mirror object, "S" a splitter, and "D" a detector. This is followed by two coordinate pairs of the form "x,y", specifying the two end points of the object's line segment. Output For each data set in the input, output the heading "DATA SET #k" where k is 1 for the first data set, 2 for the second, etc. If in this data set none of the detector objects are struck by any laser beams, output the message "NO BEAMS DETECTED". Otherwise, output the object number, one per line, of each detector struck by a laser beam. The list of detectors should be sorted by their object numbers and output in ascending order. If a detector is struck by more than one laser beam, it should only be listed once in the output. Sample Input 1 50,100 0,-1 6 D 0,40 20,20 M 40,20 60,40 D 80,20 100,40 D 0,70 20,90 S 40,90 60,70 D 80,90 100,70 Sample Output DATA SET #1 1 6
Air Strike 代码怎么解决
Problem Description General Gee is the commander of a military base. He has just received alarming news from one of his spies: the enemy's preparing an air missile strike. The base contains two magnetic towers. When activated and given sufficient power, each of the magnetic towers creates a powerful horizontal magnetic disk. If any missile passes through this disk it deflects away from the base. Although those towers seem to be an excellent air defense method, there is a problem: The area of the disk generated by a tower is proportional to the amount of energy it receives. The base has enough power plants to generate a certain amount of energy, which has to be divided among those two towers. That means that the total area of the two disks generated from the towers should not exceed the total energy generated by the power plants. Fortunately, the spy was able to know the exact target co-ordinates of the incoming missiles and he reported them to General Gee. The General needs your help in distributing the energy on the two magnetic towers to minimize the number of missiles that will not get deflected by the magnetic towers and therefore will hit the base. You may assume the following: 1. The towers have different heights and therefore there are no problems associated with the magnetic disks interfering with each other. 2. A missile will deflect if it passes through the magnetic disk of a tower or even if it just touches its boundary. 3. A missile hitting a tower (landing exactly on its location) will deflect, even if the tower is not given any energy. 4. All incoming missiles will go down simultaneously at the exact instant; therefore, there will not be any time available to redistribute the energy amongst the two towers during the strike. Input Input consists of several test cases. Each test case is specified on N+2 lines. The first line contains an integer (1 <= N <= 1, 000) representing the number of missiles. The second line contains 5 real numbers X1, Y1, X2, Y2 and T: (X1, Y1) is the coordinates of the first tower, (X2, Y2) is the coordinates of the second tower and (0 <= T) is the total amount of energy generated from the power plants (the total area of the two magnetic disks). Each line of the remaining N lines contains two real numbers representing the landing coordinates of a missile. The absolute value of all the given real numbers is less than or equal to 100 and may include a decimal point followed by up to 3 digits. Any two consecutive numbers on the same line are separated by one or more white-space characters. Zero or more blank lines may appear between test cases. The last line of the input file is made of a single zero. Output For each test case, print the following line: k. M Where k is the test case number (starting at one,) and M is the minimum number of missiles that will NOT be deflected in the best distribution of energy among the two towers. Use π = 3.141. Note: There is a blank space before M. Sample Input 6 -3 0 3 0 40.833 -1 4 -2 2.5 1 2 5 2 -4 0 -3 -1 2 0 0 1 1 0 0 0 1 1 0 Sample Output 1. 2 2. 0
寻求编程的思想The Screen Behind the Mirror
Problem Description Dr. Evil has contracted your valuable services to build for him the world's most powerful "laser". Of course before you spend one billion dollars building the thing, you want to run some simulations first to make sure everything will work as designed. For this phase of the project, you will be simulating part of the aiming system which uses mirrors and other optics to change the direction of the laser beam. The simulation consists of a flat square table with mirrors, beam splitters, and beam detectors arranged on the tabletop, and with each object represented by a one dimensional line segment. The list below describes each of the object types in detail: mirror : A mirror object will reflect any laser beam striking its surface. The reflected beam leaves at the same angle of incidence as the incoming beam. Note that both sides of a mirror object are reflective. detector : A detector is an opaque object which absorbs any laser beam striking it. The simulation must also keep track of which detectors are struck by a laser for program output purposes. Note that a laser beam strike on either side of a detector counts as a "hit". splitter : When a laser beam strikes a splitter, it divides into two beams. One of the new beams will reflect from the splitter surface (as with a mirror), and the other beam will pass through the splitter without changing direction. A splitter will function the same way regardless which side of it is struck by a laser beam. See the figures below for examples of a laser beam's interaction with each of the possible object types: For each simulation, a single laser beam enters the tabletop area. The program must compute the path taken by the laser beam (including secondary beams due to splitters), and it must determine which detectors are struck by a laser beam. You can make the following assumptions in the program: 1. The tabletop surface is a 100 by 100 square, and unless otherwise specified all coordinates in the program's input are given as integers within the tabletop area (i.e. between 0 and 100 inclusive). 2. There will be no overlaps between the line 2. segment objects. 3. The laser which enters the tabletop area always starts from the edge of the table. 4. The simulation of each data set ends when all laser beams have either exited the table top area or have terminated at a detector. 5. For each data set there will be no more than 100 total reflections among all laser beams in that data set. 6. A laser beam will never intersect any object on a vertex and will never be collinear with an object's line segment. 7. Each data set will contain at least one detector object. Input Input to this problem will begin with a line containing a single integer N (1 ≤ N ≤ 100) indicating the number of data sets. Each data set consists of the following components: A single line with four numbers "x,y i,j" where x,y is a point along the table edge at which the laser beam enters, and i,j is a vector with integer components(-1024 ≤ i,j ≤ 1024) specifying the direction of the incoming laser beam, where i corresponds to the x-axis direction and j corresponds to the y-axis direction. A line with a single integer P (1 ≤ P ≤ 100) giving the total number of objects in this data set. A series of P lines, each representing one object, with the first line describing object 1, the second line describing object 2, and so on. Each line begins with a single letter specifying the object type where a "M" indicates a mirror object, "S" a splitter, and "D" a detector. This is followed by two coordinate pairs of the form "x,y", specifying the two end points of the object's line segment. Output For each data set in the input, output the heading "DATA SET #k" where k is 1 for the first data set, 2 for the second, etc. If in this data set none of the detector objects are struck by any laser beams, output the message "NO BEAMS DETECTED". Otherwise, output the object number, one per line, of each detector struck by a laser beam. The list of detectors should be sorted by their object numbers and output in ascending order. If a detector is struck by more than one laser beam, it should only be listed once in the output. Sample Input 1 50,100 0,-1 6 D 0,40 20,20 M 40,20 60,40 D 80,20 100,40 D 0,70 20,90 S 40,90 60,70 D 80,90 100,70 Sample Output DATA SET #1 1 6
Outernet 网络的算法问题
Description A company named Outdaters is running a small computer wire line network, called Outernet. Not like Internet, Outernet is not base on the TCP/IP protocol. Due to lacking of money, not all the computers in Outernet can communicate with each other directly. Outdaters have already found the solution. They created a protocol to make all computers in the network become application proxies. An application proxy can receive data from a connected computer and send them out to another connected computer. Therefore, by using this protocol in Outernet, if a computer wants to send something to a computer not linked directly, it has to send them to a connected computer/application proxy and ask it to help sending them to the destination or another connected computer/application proxy. The protocol is described as A. Port Application proxies use port to indicate each connected computer. Port number is an integer number from 0 to 32,767. To an application proxy, 0 means the application proxy itself, each other port number represents a unique computer connected to the application proxy. B. Commands The application proxy accepts only 3 commands, case sensitive: TO, DATA, QUIT. To each incoming command, application proxy will response with 3-digit result code in a line to the incoming port after handled this command. Format: xxx< LF > xxx -- the 3-digit result code Result codes: 100: OK. No error/Data routed to destination 101: OK. Data routed to application. (Destination computer is application proxy itself.) 200: Session ends (Response to QUIT command) 300: Unknown command 301: Unknown destination 302: No session began 303: Looping not allowed (when incoming port = outgoing port) Details for each command: 1. TO:< destination computer name >< LF > Tell the application proxy, the following data need to be sent to < destination computer name > ,and cancel the last "TO" command's effect (send a "QUIT" command to the original destination computer). If TO command fails (result code is neither 100 nor 101), the state of the application proxy will not be changed. Possible result codes are: 100: The destination computer is found in routing table, and not the application proxy itself. 101: The destination computer is found in routing table, and IS the application proxy itself. 301: The destination computer is not found in routing table 303: The destination computer is found in routing table, but incoming port = outgoing port 2. DATA< LF >< the data >< a dot "." > < LF > Send < the data > to destination computer. < the data > will be regarded as a data stream, and sent to the destination without any alteration if the destination computer is not the application proxy itself. The backslash ("\") is the meta character, "\." means a simple dot ".", instead of then end indicator, and "\\" means "\". Possible result codes are: 100: The destination computer is found in routing table, and not the application proxy itself. The data is routed to the corresponding outgoing port. 101: The destination computer is found in routing table, and IS the application proxy itself.The data is routed to the application running on this application proxy. 302: No session began, this command is ignored. 3. QUIT< LF > End this communication session. Possible result codes are: 200: Session ends(Response to QUIT command) 302: No session began, this command is ignored. C. Session When a computer (the requester) sends a "TO" command to an application proxy, a communication session begins; when a "QUIT" command is sent to the application proxy, the session ends. In a session, the requester can send multiple "TO" and "DATA" commands to an application proxy to send out multiple messages. An application proxy is able to handle sessions simultaneously from different ports. D. Routing table Each application proxy holds a routing table. It uses this table to find which port should be used the destination computer name. Each line in the routing table contains 2 fields, the first is the destination computer name, and the second is the outgoing port number. It means, the data to be sent to a computer with the destination computer name, will be sent out via the port with the outgoing port number. Port number 0 means, the data should be routed to the application running on this application proxy; that destination computer name is actually the application proxy's name. E. Routing Application proxies use the same "TO", "DATA", "QUIT" commands to route the incoming data if the routing is possible. After searching on the routing table, if the outgoing port found, application proxies must create a complete session on the outgoing port for each valid incoming "TO" command: one "TO" command at the beginning, zero or more DATA commands to route the data, one "QUIT" command in the end if the incoming session ends or another incoming "TO" command is received. Port 0 is handled as same as other outgoing ports except that no actually outgoing command is sent , i.e. all the commands' result code will be sent to the incoming port, but no commands will be sent to any outgoing port. Now, Outdaters hires you to write the engine to implement the protocol for the application proxy. Input The input consists of a sequence of testcases. Each begins with a routing table of an application proxy and then the incoming requests of the application proxy. A routing table includes, in order, a line with an integer M (1 <= M <= 32,768), the number of lines in the routing table; M lines, each of which has a routing line. Each routing line contains a unique destination computer name (1 to 15 alphanumeric characters in the routing table), and then the outgoing port number (0 to 32,767 integer), separated by a space, and the computer names are case sensitive. The incoming requests of the application proxy include several request sessions from the connected computers. A line starts with a number sign "#" and then an integer P (-1, 1 to 32,767),means the following input is from port P, P < 0 means the testcase finishes. The commands in request sessions will not be broken by the "#" lines. To simplify the input handling, data commands in our input file will just contain "0"-"9", "a"-"z", "A"-"Z", "@", "#", "_", "+", "-", "*","/" , "\", "?", ",", "." and < LF >. The input is terminated by a single zero Output For each testcase, print all the outputs of the ports sending out data, in the order of the corresponding input. For each port's output, a line starts with a number sign "#" and then an integer P (-1, 1 to 32,767), means the following commands are output in port P, P=-1 means the output of the current testcase finishes. Following the "#" line is the commands output in this port till another "#" line. A "#" line is needed only when the port number need to be changed. #< port number >< LF > the commands output in this port #< another port number >< LF > the commands output in this port ... #-1< LF > Sample Input 5 RED 0 YELLOW 1 GREEN 2 BLUE 3 WHITE 3 #1 TO:GREEN DATA HELLO . #4 TO:WHITE #1 Quit QUIT #2 TO:GREEN DATA A JOKE to myself . QUIT #3 TO:ORANGE QUIT #4 QUIT #-1 0 Sample Output #2 TO:GREEN #1 100 #2 DATA HELLO . #1 100 #3 TO:WHITE #4 100 #1 300 #2 QUIT #1 200 #2 303 302 302 #3 301 302 QUIT #4 200
镜子的问题,The Screen Behind the Mirror
Problem Description Dr. Evil has contracted your valuable services to build for him the world's most powerful "laser". Of course before you spend one billion dollars building the thing, you want to run some simulations first to make sure everything will work as designed. For this phase of the project, you will be simulating part of the aiming system which uses mirrors and other optics to change the direction of the laser beam. The simulation consists of a flat square table with mirrors, beam splitters, and beam detectors arranged on the tabletop, and with each object represented by a one dimensional line segment. The list below describes each of the object types in detail: mirror : A mirror object will reflect any laser beam striking its surface. The reflected beam leaves at the same angle of incidence as the incoming beam. Note that both sides of a mirror object are reflective. detector : A detector is an opaque object which absorbs any laser beam striking it. The simulation must also keep track of which detectors are struck by a laser for program output purposes. Note that a laser beam strike on either side of a detector counts as a "hit". splitter : When a laser beam strikes a splitter, it divides into two beams. One of the new beams will reflect from the splitter surface (as with a mirror), and the other beam will pass through the splitter without changing direction. A splitter will function the same way regardless which side of it is struck by a laser beam. See the figures below for examples of a laser beam's interaction with each of the possible object types: For each simulation, a single laser beam enters the tabletop area. The program must compute the path taken by the laser beam (including secondary beams due to splitters), and it must determine which detectors are struck by a laser beam. You can make the following assumptions in the program: 1. The tabletop surface is a 100 by 100 square, and unless otherwise specified all coordinates in the program's input are given as integers within the tabletop area (i.e. between 0 and 100 inclusive). 2. There will be no overlaps between the line 2. segment objects. 3. The laser which enters the tabletop area always starts from the edge of the table. 4. The simulation of each data set ends when all laser beams have either exited the table top area or have terminated at a detector. 5. For each data set there will be no more than 100 total reflections among all laser beams in that data set. 6. A laser beam will never intersect any object on a vertex and will never be collinear with an object's line segment. 7. Each data set will contain at least one detector object. Input Input to this problem will begin with a line containing a single integer N (1 ≤ N ≤ 100) indicating the number of data sets. Each data set consists of the following components: A single line with four numbers "x,y i,j" where x,y is a point along the table edge at which the laser beam enters, and i,j is a vector with integer components(-1024 ≤ i,j ≤ 1024) specifying the direction of the incoming laser beam, where i corresponds to the x-axis direction and j corresponds to the y-axis direction. A line with a single integer P (1 ≤ P ≤ 100) giving the total number of objects in this data set. A series of P lines, each representing one object, with the first line describing object 1, the second line describing object 2, and so on. Each line begins with a single letter specifying the object type where a "M" indicates a mirror object, "S" a splitter, and "D" a detector. This is followed by two coordinate pairs of the form "x,y", specifying the two end points of the object's line segment. Output For each data set in the input, output the heading "DATA SET #k" where k is 1 for the first data set, 2 for the second, etc. If in this data set none of the detector objects are struck by any laser beams, output the message "NO BEAMS DETECTED". Otherwise, output the object number, one per line, of each detector struck by a laser beam. The list of detectors should be sorted by their object numbers and output in ascending order. If a detector is struck by more than one laser beam, it should only be listed once in the output. Sample Input 1 50,100 0,-1 6 D 0,40 20,20 M 40,20 60,40 D 80,20 100,40 D 0,70 20,90 S 40,90 60,70 D 80,90 100,70 Sample Output DATA SET #1 1 6
Hardware 硬件问题的实现
Problem Description Ola Clason’s Hardware store is an old company where most work is done “the old way”. Among other things, the company is the one and only provider of marble house numbers. These house numbers have become extremely popular among construction companies, especially the ones building luxury estates. This is of course great for Ola Clason, but also a small problem. Nisse, who has been managing the incoming orders has turned out to be a bottleneck in Ola’s business. Most orders are on the form “Coconut Drive 200, 202, 204, ..., 220”. This means every even number between 200 and 220. Nisse’s work is to transfer an order to a list of necessary digits and other symbols. Your assignment is to write a program that automates Nisse’s work with orders containing only positive integer house numbers. Nisse will still in the future process all special orders (those including non digit symbols) by hand. Input On the first line of input is a single positive integer n, specifying the number of orders that follow. The first line of each order contains the road name for that order. No road name is longer than 50 characters. The second line states the total number of buildings needing new marble numbers on that order. Then follows the different house number specifications on several lines. These lines are of two kinds: single number lines and multiple number lines. A single number line simply consists of the house number by itself, while a multiple number line starts with a “+”-sign, followed by three positive integer numbers: first number, last number and the interval between the house numbers. The distance between the first and last house number will always be a multiple of the house number interval. A house number will never have more than five digits. After the last house number specification line, the next order follows, if there is any. Output For each order, the output consists of 13 lines. The first and second lines should be identical with the first two input lines. Then, there follows 10 lines with information on how many marble digits of each kind the order consists of. These rows are on the format “Make X digit Y” where X is how many copies of digit Y they need to make. The last row states the total number Z of digits needed, on the format “In total Z digits”. If there is only one digit to produce, it should say “In total 1 digit”, in order to be grammatically correct. Sample Input 1 Short Street 23 addresses + 101 125 2 275 + 100 900 100 Sample Output Short Street 23 addresses Make 23 digit 0 Make 22 digit 1 Make 5 digit 2 Make 4 digit 3 Make 1 digit 4 Make 5 digit 5 Make 1 digit 6 Make 4 digit 7 Make 1 digit 8 Make 3 digit 9 In total 69 digits
spring boot整合rabbitmq ack出现异常
先贴一下我的代码,配置类 ``` @Configuration public class RabbitConfig { @Autowired RedisService redisService; @Bean public Queue queue() { return new Queue(MqConstant.QUEUE_NAME); } @Bean public Queue BQueue() { return new Queue(MqConstant.BQUEUE_NAME); } /** * 消费者数量,默认10 */ private static final int DEFAULT_CONCURRENT = 10; /** * 每个消费者获取最大投递数量,默认50 */ private static final int DEFAULT_PREFETCH_COUNT = 5; /** * 初始化环境参数 */ private void initEnv() { SwitchTool.initEnv(redisService); } @Bean public MessageConverter jsonMessageConverter(ObjectMapper objectMapper) { return new Jackson2JsonMessageConverter(objectMapper); } @Bean public RabbitTemplate rabbitTemplate(ConnectionFactory connectionFactory) { RabbitTemplate template = new RabbitTemplate(connectionFactory); template.setMessageConverter(new Jackson2JsonMessageConverter()); return template; } @Bean public SimpleRabbitListenerContainerFactory simpleRabbitListenerContainerFactory( SimpleRabbitListenerContainerFactoryConfigurer configurer, ConnectionFactory connectionFactory) { // 初始化环境参数 initEnv(); // 初始化环境参数-end SimpleRabbitListenerContainerFactory factory = new SimpleRabbitListenerContainerFactory(); factory.setPrefetchCount(DEFAULT_PREFETCH_COUNT); factory.setConcurrentConsumers(DEFAULT_CONCURRENT); factory.setAcknowledgeMode(AcknowledgeMode.MANUAL); configurer.configure(factory, connectionFactory); return factory; } } ``` 然后是消费者类,消费者1: ``` @RabbitListener(queues = MqConstant.QUEUE_NAME, containerFactory = "simpleRabbitListenerContainerFactory") @RabbitHandler public void process(@Payload MessageBody messageBody, @Headers Map<String, Object> headers, Channel channel) throws Exception {.....} ``` 消费者2: ``` @RabbitListener(queues = MqConstant.BQUEUE_NAME,containerFactory = "simpleRabbitListenerContainerFactory") @RabbitHandler public void process(@Payload MessageBody messageBody, @Headers Map<String, Object> headers, Channel channel) throws Exception { log.info("get enter msg:"+messageBody); Long deliveryTag = (Long) headers.get(AmqpHeaders.DELIVERY_TAG); channel.basicAck(deliveryTag,false); } ``` 如果我只写消费者1,不写消费者2的话是完全没有问题的,当我写两个消费者的时候,启动就报错了,如下: ``` 2019-09-29 14:35:48.307 WARN 4380 --- [cTaskExecutor-1] s.a.r.l.ConditionalRejectingErrorHandler : Execution of Rabbit message listener failed. org.springframework.amqp.rabbit.listener.exception.ListenerExecutionFailedException: Listener method could not be invoked with the incoming message Endpoint handler details: Method [public void com.chinamobile.cmic.rcsoa.wishsms.component.EnterClient.process(com.chinamobile.cmic.rcsoa.wishsms.dto.MessageBody,java.util.Map<java.lang.String, java.lang.Object>,com.rabbitmq.client.Channel) throws java.lang.Exception] Bean [com.chinamobile.cmic.rcsoa.wishsms.component.EnterClient@6fbfd28b] at org.springframework.amqp.rabbit.listener.adapter.MessagingMessageListenerAdapter.invokeHandler(MessagingMessageListenerAdapter.java:129) at org.springframework.amqp.rabbit.listener.adapter.MessagingMessageListenerAdapter.onMessage(MessagingMessageListenerAdapter.java:106) at org.springframework.amqp.rabbit.listener.AbstractMessageListenerContainer.doInvokeListener(AbstractMessageListenerContainer.java:856) at org.springframework.amqp.rabbit.listener.AbstractMessageListenerContainer.invokeListener(AbstractMessageListenerContainer.java:779) at org.springframework.amqp.rabbit.listener.SimpleMessageListenerContainer.access$001(SimpleMessageListenerContainer.java:105) at org.springframework.amqp.rabbit.listener.SimpleMessageListenerContainer$1.invokeListener(SimpleMessageListenerContainer.java:208) at org.springframework.amqp.rabbit.listener.SimpleMessageListenerContainer.invokeListener(SimpleMessageListenerContainer.java:1349) at org.springframework.amqp.rabbit.listener.AbstractMessageListenerContainer.executeListener(AbstractMessageListenerContainer.java:760) at org.springframework.amqp.rabbit.listener.SimpleMessageListenerContainer.doReceiveAndExecute(SimpleMessageListenerContainer.java:1292) at org.springframework.amqp.rabbit.listener.SimpleMessageListenerContainer.receiveAndExecute(SimpleMessageListenerContainer.java:1262) at org.springframework.amqp.rabbit.listener.SimpleMessageListenerContainer.access$1800(SimpleMessageListenerContainer.java:105) at org.springframework.amqp.rabbit.listener.SimpleMessageListenerContainer$AsyncMessageProcessingConsumer.run(SimpleMessageListenerContainer.java:1518) at java.lang.Thread.run(Thread.java:748) Caused by: org.springframework.amqp.support.converter.MessageConversionException: Cannot handle message ... 13 common frames omitted Caused by: org.springframework.messaging.converter.MessageConversionException: Cannot convert from [[B] to [com.chinamobile.cmic.rcsoa.wishsms.dto.MessageBody] for GenericMessage [payload=byte[298], headers={amqp_receivedDeliveryMode=PERSISTENT, amqp_receivedRoutingKey=legalize.enter.queue, amqp_deliveryTag=2, amqp_consumerQueue=legalize.enter.queue, amqp_redelivered=true, id=f8b6a47d-baa1-eded-60f9-0b83554c56c0, amqp_consumerTag=amq.ctag-QgKSp5nfJeTaRNyWogyBbw, contentType=application/x-java-serialized-object, timestamp=1569738948306}] at org.springframework.messaging.handler.annotation.support.PayloadArgumentResolver.resolveArgument(PayloadArgumentResolver.java:142) at org.springframework.messaging.handler.invocation.HandlerMethodArgumentResolverComposite.resolveArgument(HandlerMethodArgumentResolverComposite.java:112) at org.springframework.messaging.handler.invocation.InvocableHandlerMethod.getMethodArgumentValues(InvocableHandlerMethod.java:135) at org.springframework.messaging.handler.invocation.InvocableHandlerMethod.invoke(InvocableHandlerMethod.java:107) at org.springframework.amqp.rabbit.listener.adapter.HandlerAdapter.invoke(HandlerAdapter.java:49) at org.springframework.amqp.rabbit.listener.adapter.MessagingMessageListenerAdapter.invokeHandler(MessagingMessageListenerAdapter.java:126) ... 12 common frames omitted ``` 希望大佬们可以帮我看看这怎么解决。QAQ
Gargoyle 用一个程序来实现怎么写
Problem Description Gargoyles can trace their history back many thousands of years to ancient Egypt, Greece, and Rome. Terra cotta waterspouts were formed in the shapes of animals such as lions and birds to serve the physical function of running the rainwater away from the walls and foundations of buildings, and the spiritual function of protecting from evil forces. Have you ever dreamed of creating your own castle with a lot of beautiful gargoyles on the walls? To your knowledge, the speed of water coming out of each gargoyle should be identical, so an elaborately designed water system is required. The water system consists of a huge reservoir and several interconnecting water pipes. Pipes cannot save water, so the total incoming and outgoing speed of water should be equal at each connection. All the water from gargoyles flows into the reservoir, which is located at the bottom of the castle. Some pipes are connecting the reservoir, but water can only go from the reservoir to pipes, but never from pipes back to the reservoir. A micro-processor is installed inside each pipe, so the speed of water could easily be controlled. However, the microprocessors consume electricity. The exact cost in each pipe is proportional to the speed of water. If the cost constant in the i-th pipe is ci, the electricity cost in that pipe is civi, where vi is the speed of water in that pipe. Write a program to find the optimal configuration of the water system (i.e. the water speed in each pipe) of your dream castle, so that the total cost is minimized. It is always possible to build a water system. Input The input consists of several test cases. The first line of each case contains three integers n, m and k (1 ≤ n ≤ 25, 1 ≤ m ≤ 50, 1 ≤ k ≤ 1000), the number of gargoyles, the number of pipe connections and the number of pipes. The following k lines each contains five integers a, b, l, u, c (0 ≤ a, b ≤ n + m, 0 ≤ l ≤ u ≤ 100, 1 ≤ c ≤ 100), describing each pipe. a and b are the incoming and outgoing vertex number (reservoir is 0, gargoyles are numbered 1 to n, pipe connections are numbered n + 1 to n + m), lower-bound and upper-bound of water speed, and the cost constant. No pipe connects two identical vertices. For every pipe, the incoming vertex will never be a gargoyle, and the outgoing vertex will never be the reservoir. For every pair of vertices, there could be at most one pipe connecting them (if a pipe is going from a to b, no pipes can go from a to b, or from b to a). The last test case is followed by a single zero, which should not be processed. Output For each test case, print the case number and minimal cost to two decimal places. Sample Input 3 1 4 0 4 8 15 5 4 1 2 5 2 4 2 1 6 1 4 3 3 7 2 0 Sample Output Case 1: 60.00
Air Strike
Problem Description General Gee is the commander of a military base. He has just received alarming news from one of his spies: the enemy's preparing an air missile strike. The base contains two magnetic towers. When activated and given sufficient power, each of the magnetic towers creates a powerful horizontal magnetic disk. If any missile passes through this disk it deflects away from the base. Although those towers seem to be an excellent air defense method, there is a problem: The area of the disk generated by a tower is proportional to the amount of energy it receives. The base has enough power plants to generate a certain amount of energy, which has to be divided among those two towers. That means that the total area of the two disks generated from the towers should not exceed the total energy generated by the power plants. Fortunately, the spy was able to know the exact target co-ordinates of the incoming missiles and he reported them to General Gee. The General needs your help in distributing the energy on the two magnetic towers to minimize the number of missiles that will not get deflected by the magnetic towers and therefore will hit the base. You may assume the following: 1. The towers have different heights and therefore there are no problems associated with the magnetic disks interfering with each other. 2. A missile will deflect if it passes through the magnetic disk of a tower or even if it just touches its boundary. 3. A missile hitting a tower (landing exactly on its location) will deflect, even if the tower is not given any energy. 4. All incoming missiles will go down simultaneously at the exact instant; therefore, there will not be any time available to redistribute the energy amongst the two towers during the strike. Input Input consists of several test cases. Each test case is specified on N+2 lines. The first line contains an integer (1 <= N <= 1, 000) representing the number of missiles. The second line contains 5 real numbers X1, Y1, X2, Y2 and T: (X1, Y1) is the coordinates of the first tower, (X2, Y2) is the coordinates of the second tower and (0 <= T) is the total amount of energy generated from the power plants (the total area of the two magnetic disks). Each line of the remaining N lines contains two real numbers representing the landing coordinates of a missile. The absolute value of all the given real numbers is less than or equal to 100 and may include a decimal point followed by up to 3 digits. Any two consecutive numbers on the same line are separated by one or more white-space characters. Zero or more blank lines may appear between test cases. The last line of the input file is made of a single zero. Output For each test case, print the following line: k. M Where k is the test case number (starting at one,) and M is the minimum number of missiles that will NOT be deflected in the best distribution of energy among the two towers. Use π = 3.141. Note: There is a blank space before M. Sample Input 6 -3 0 3 0 40.833 -1 4 -2 2.5 1 2 5 2 -4 0 -3 -1 2 0 0 1 1 0 0 0 1 1 0 Sample Output 1. 2 2. 0
unity3d中加入shader后材质球的颜色变为黑色的问题
我想在unity中给cube添加轮廓线,从某个帖子中得知shader可以实现,还给了一段shader的代码,但是只要给材质球挂载上这个shader,轮廓是有了,但是材质球会变成黑色。麻烦各位大神给看看,是不是这个shader哪里写的有问题 ``` Shader "Custom/NewSurfaceShader" { Properties { //定义材质的颜色为白色 _Color ("Main Color", Color) = (1,1,1,1) //定义材质的轮廓线为黑色 _OutlineColor ("Outline Color", Color) = (0,0,0,1) //改变这个能改变轮廓边的颜色 //定义线宽 _Outline ("Outline width", Range (0.0, 0.03)) = 0.001 //改变这个能改变轮廓边的粗细 _MainTex ("Base (RGB)", 2D) = "white" { } } CGINCLUDE #include "UnityCG.cginc" struct appdata { float4 vertex : POSITION; float3 normal : NORMAL; }; struct v2f { float4 pos : POSITION; float4 color : COLOR; }; uniform float _Outline; uniform float4 _OutlineColor; v2f vert(appdata v) { // just make a copy of incoming vertex data but scaled according to normal direction v2f o; o.pos = mul(UNITY_MATRIX_MVP, v.vertex); float3 norm = mul ((float3x3)UNITY_MATRIX_IT_MV, v.normal); float2 offset = TransformViewToProjection(norm.xy); o.pos.xy += offset * o.pos.z * _Outline; o.color = _OutlineColor; return o; } ENDCG SubShader { Tags { "Queue" = "Transparent" } // note that a vertex shader is specified here but its using the one above Pass { Name "OUTLINE" Tags { "LightMode" = "Always" } Cull Off ZWrite Off ZTest Always ColorMask RGB // alpha not used // you can choose what kind of blending mode you want for the outline Blend SrcAlpha OneMinusSrcAlpha // Normal //Blend One One // Additive //Blend One OneMinusDstColor // Soft Additive //Blend DstColor Zero // Multiplicative //Blend DstColor SrcColor // 2x Multiplicative CGPROGRAM #pragma vertex vert #pragma fragment frag half4 frag(v2f i) :COLOR { return i.color; } ENDCG } Pass { Name "BASE" ZWrite On ZTest LEqual Blend SrcAlpha OneMinusSrcAlpha Material { Diffuse [_Color] Ambient [_Color] } Lighting On SetTexture [_MainTex] { ConstantColor [_Color] Combine texture * constant } SetTexture [_MainTex] { Combine previous * primary DOUBLE } } } SubShader { Tags { "Queue" = "Transparent" } Pass { Name "OUTLINE" Tags { "LightMode" = "Always" } Cull Front ZWrite Off ZTest Always ColorMask RGB // you can choose what kind of blending mode you want for the outline Blend SrcAlpha OneMinusSrcAlpha // Normal //Blend One One // Additive //Blend One OneMinusDstColor // Soft Additive //Blend DstColor Zero // Multiplicative //Blend DstColor SrcColor // 2x Multiplicative CGPROGRAM #pragma vertex vert #pragma exclude_renderers gles xbox360 ps3 ENDCG SetTexture [_MainTex] { combine primary } } Pass { Name "BASE" ZWrite On ZTest LEqual Blend SrcAlpha OneMinusSrcAlpha Material { Diffuse [_Color] Ambient [_Color] } Lighting On SetTexture [_MainTex] { ConstantColor [_Color] Combine texture * constant } SetTexture [_MainTex] { Combine previous * primary DOUBLE } } } Fallback "Diffuse" } ``` ![图片说明](https://img-ask.csdn.net/upload/201610/26/1477449766_40855.png)
android中clipboard broadcast接收器的问题
我想创建一个简单的在后台运行的 service。当有人从浏览器或sms中复制任何文本资料时,就会有一个toast显示该文本。 我用的以下代码来实现当有电话时,就会给出toast。 public class MyPhoneReceiver extends BroadcastReceiver { @Override public void onReceive(Context context, Intent intent) { Bundle extras = intent.getExtras(); if (extras != null) { // this code is for to accept the telephone call String state = extras.getString(TelephonyManager.EXTRA_STATE); if (state.equals(TelephonyManager.EXTRA_STATE_RINGING)) { String phoneNumber = extras.getString(TelephonyManager.EXTRA_INCOMING_NUMBER); Toast.makeText(context, phoneNumber, Toast.LENGTH_SHORT).show(); } } } } 在manifest.xml <action android:name="android.intent.action.PHONE_STATE"></action> 现在这段代码发送任何电话状态到myreciever类。我想从clipboard manager中获取文本。当有人复制一些文本时,是否有intent.action状态可以调用myreciever类? 请教这个问题,提供任何的代码或建议都非常感谢!
相见恨晚的超实用网站
相见恨晚的超实用网站 持续更新中。。。
爬虫福利二 之 妹子图网MM批量下载
爬虫福利一:27报网MM批量下载 点击 看了本文,相信大家对爬虫一定会产生强烈的兴趣,激励自己去学习爬虫,在这里提前祝:大家学有所成! 目标网站:妹子图网 环境:Python3.x 相关第三方模块:requests、beautifulsoup4 Re:各位在测试时只需要将代码里的变量path 指定为你当前系统要保存的路径,使用 python xxx.py 或IDE运行即可。 ...
字节跳动视频编解码面经
三四月份投了字节跳动的实习(图形图像岗位),然后hr打电话过来问了一下会不会opengl,c++,shador,当时只会一点c++,其他两个都不会,也就直接被拒了。 七月初内推了字节跳动的提前批,因为内推没有具体的岗位,hr又打电话问要不要考虑一下图形图像岗,我说实习投过这个岗位不合适,不会opengl和shador,然后hr就说秋招更看重基础。我当时想着能进去就不错了,管他哪个岗呢,就同意了面试...
开源一个功能完整的SpringBoot项目框架
福利来了,给大家带来一个福利。 最近想了解一下有关Spring Boot的开源项目,看了很多开源的框架,大多是一些demo或者是一个未成形的项目,基本功能都不完整,尤其是用户权限和菜单方面几乎没有完整的。 想到我之前做的框架,里面通用模块有:用户模块,权限模块,菜单模块,功能模块也齐全了,每一个功能都是完整的。 打算把这个框架分享出来,供大家使用和学习。 为什么用框架? 框架可以学习整体...
源码阅读(19):Java中主要的Map结构——HashMap容器(下1)
HashMap容器从字面的理解就是,基于Hash算法构造的Map容器。从数据结构的知识体系来说,HashMap容器是散列表在Java中的具体表达(并非线性表结构)。具体来说就是,利用K-V键值对中键对象的某个属性(默认使用该对象的“内存起始位置”这一属性)作为计算依据进行哈希计算(调用hashCode方法),然后再以计算后的返回值为依据,将当前K-V键值对在符合HashMap容器构造原则的基础上,放置到HashMap容器的某个位置上,且这个位置和之前添加的K-V键值对的存储位置完全独立,不一定构成连续的存储
c++制作的植物大战僵尸,开源,一代二代结合游戏
此游戏全部由本人自己制作完成。游戏大部分的素材来源于原版游戏素材,少部分搜集于网络,以及自己制作。 此游戏为同人游戏而且仅供学习交流使用,任何人未经授权,不得对本游戏进行更改、盗用等,否则后果自负。目前有六种僵尸和六种植物,植物和僵尸的动画都是本人做的。qq:2117610943 开源代码下载 提取码:3vzm 点击下载--&gt; 11月28日 新增四种植物 统一植物画风,全部修...
Java学习的正确打开方式
在博主认为,对于入门级学习java的最佳学习方法莫过于视频+博客+书籍+总结,前三者博主将淋漓尽致地挥毫于这篇博客文章中,至于总结在于个人,实际上越到后面你会发现学习的最好方式就是阅读参考官方文档其次就是国内的书籍,博客次之,这又是一个层次了,这里暂时不提后面再谈。博主将为各位入门java保驾护航,各位只管冲鸭!!!上天是公平的,只要不辜负时间,时间自然不会辜负你。 何谓学习?博主所理解的学习,它是一个过程,是一个不断累积、不断沉淀、不断总结、善于传达自己的个人见解以及乐于分享的过程。
程序员必须掌握的核心算法有哪些?
由于我之前一直强调数据结构以及算法学习的重要性,所以就有一些读者经常问我,数据结构与算法应该要学习到哪个程度呢?,说实话,这个问题我不知道要怎么回答你,主要取决于你想学习到哪些程度,不过针对这个问题,我稍微总结一下我学过的算法知识点,以及我觉得值得学习的算法。这些算法与数据结构的学习大多数是零散的,并没有一本把他们全部覆盖的书籍。下面是我觉得值得学习的一些算法以及数据结构,当然,我也会整理一些看过...
Python——画一棵漂亮的樱花树(不同种樱花+玫瑰+圣诞树喔)
最近翻到一篇知乎,上面有不少用Python(大多是turtle库)绘制的树图,感觉很漂亮,我整理了一下,挑了一些我觉得不错的代码分享给大家(这些我都测试过,确实可以生成) one 樱花树 动态生成樱花 效果图(这个是动态的): 实现代码 import turtle as T import random import time # 画樱花的躯干(60,t) def Tree(branch, ...
linux系列之常用运维命令整理笔录
本博客记录工作中需要的linux运维命令,大学时候开始接触linux,会一些基本操作,可是都没有整理起来,加上是做开发,不做运维,有些命令忘记了,所以现在整理成博客,当然vi,文件操作等就不介绍了,慢慢积累一些其它拓展的命令,博客不定时更新 free -m 其中:m表示兆,也可以用g,注意都要小写 Men:表示物理内存统计 total:表示物理内存总数(total=used+free) use...
Python 基础(一):入门必备知识
Python 入门必备知识,你都掌握了吗?
深度学习图像算法在内容安全领域的应用
互联网给人们生活带来便利的同时也隐含了大量不良信息,防范互联网平台有害内容传播引起了多方面的高度关注。本次演讲从技术层面分享网易易盾在内容安全领域的算法实践经验,包括深度...
程序员接私活怎样防止做完了不给钱?
首先跟大家说明一点,我们做 IT 类的外包开发,是非标品开发,所以很有可能在开发过程中会有这样那样的需求修改,而这种需求修改很容易造成扯皮,进而影响到费用支付,甚至出现做完了项目收不到钱的情况。 那么,怎么保证自己的薪酬安全呢? 我们在开工前,一定要做好一些证据方面的准备(也就是“讨薪”的理论依据),这其中最重要的就是需求文档和验收标准。一定要让需求方提供这两个文档资料作为开发的基础。之后开发...
网页实现一个简单的音乐播放器(大佬别看。(⊙﹏⊙))
今天闲着无事,就想写点东西。然后听了下歌,就打算写个播放器。 于是乎用h5 audio的加上js简单的播放器完工了。 演示地点演示 html代码如下` music 这个年纪 七月的风 音乐 ` 然后就是css`*{ margin: 0; padding: 0; text-decoration: none; list-...
Python十大装B语法
Python 是一种代表简单思想的语言,其语法相对简单,很容易上手。不过,如果就此小视 Python 语法的精妙和深邃,那就大错特错了。本文精心筛选了最能展现 Python 语法之精妙的十个知识点,并附上详细的实例代码。如能在实战中融会贯通、灵活使用,必将使代码更为精炼、高效,同时也会极大提升代码B格,使之看上去更老练,读起来更优雅。
数据库优化 - SQL优化
以实际SQL入手,带你一步一步走上SQL优化之路!
2019年11月中国大陆编程语言排行榜
2019年11月2日,我统计了某招聘网站,获得有效程序员招聘数据9万条。针对招聘信息,提取编程语言关键字,并统计如下: 编程语言比例 rank pl_ percentage 1 java 33.62% 2 cpp 16.42% 3 c_sharp 12.82% 4 javascript 12.31% 5 python 7.93% 6 go 7.25% 7 p...
通俗易懂地给女朋友讲:线程池的内部原理
餐盘在灯光的照耀下格外晶莹洁白,女朋友拿起红酒杯轻轻地抿了一小口,对我说:“经常听你说线程池,到底线程池到底是个什么原理?”
经典算法(5)杨辉三角
写在前面: 我是 扬帆向海,这个昵称来源于我的名字以及女朋友的名字。我热爱技术、热爱开源、热爱编程。技术是开源的、知识是共享的。 这博客是对自己学习的一点点总结及记录,如果您对 Java、算法 感兴趣,可以关注我的动态,我们一起学习。 用知识改变命运,让我们的家人过上更好的生活。 目录一、杨辉三角的介绍二、杨辉三角的算法思想三、代码实现1.第一种写法2.第二种写法 一、杨辉三角的介绍 百度
腾讯算法面试题:64匹马8个跑道需要多少轮才能选出最快的四匹?
昨天,有网友私信我,说去阿里面试,彻底的被打击到了。问了为什么网上大量使用ThreadLocal的源码都会加上private static?他被难住了,因为他从来都没有考虑过这个问题。无独有偶,今天笔者又发现有网友吐槽了一道腾讯的面试题,我们一起来看看。 腾讯算法面试题:64匹马8个跑道需要多少轮才能选出最快的四匹? 在互联网职场论坛,一名程序员发帖求助到。二面腾讯,其中一个算法题:64匹...
面试官:你连RESTful都不知道我怎么敢要你?
干货,2019 RESTful最贱实践
为啥国人偏爱Mybatis,而老外喜欢Hibernate/JPA呢?
关于SQL和ORM的争论,永远都不会终止,我也一直在思考这个问题。昨天又跟群里的小伙伴进行了一番讨论,感触还是有一些,于是就有了今天这篇文。 声明:本文不会下关于Mybatis和JPA两个持久层框架哪个更好这样的结论。只是摆事实,讲道理,所以,请各位看官勿喷。 一、事件起因 关于Mybatis和JPA孰优孰劣的问题,争论已经很多年了。一直也没有结论,毕竟每个人的喜好和习惯是大不相同的。我也看...
项目中的if else太多了,该怎么重构?
介绍 最近跟着公司的大佬开发了一款IM系统,类似QQ和微信哈,就是聊天软件。我们有一部分业务逻辑是这样的 if (msgType = "文本") { // dosomething } else if(msgType = "图片") { // doshomething } else if(msgType = "视频") { // doshomething } else { // doshom...
致 Python 初学者
欢迎来到“Python进阶”专栏!来到这里的每一位同学,应该大致上学习了很多 Python 的基础知识,正在努力成长的过程中。在此期间,一定遇到了很多的困惑,对未来的学习方向感到迷茫。我非常理解你们所面临的处境。我从2007年开始接触 python 这门编程语言,从2009年开始单一使用 python 应对所有的开发工作,直至今天。回顾自己的学习过程,也曾经遇到过无数的困难,也曾经迷茫过、困惑过。开办这个专栏,正是为了帮助像我当年一样困惑的 Python 初学者走出困境、快速成长。希望我的经验能真正帮到你
Python 编程实用技巧
Python是一门很灵活的语言,也有很多实用的方法,有时候实现一个功能可以用多种方法实现,我这里总结了一些常用的方法,并会持续更新。
“狗屁不通文章生成器”登顶GitHub热榜,分分钟写出万字形式主义大作
一、垃圾文字生成器介绍 最近在浏览GitHub的时候,发现了这样一个骨骼清奇的雷人项目,而且热度还特别高。 项目中文名:狗屁不通文章生成器 项目英文名:BullshitGenerator 根据作者的介绍,他是偶尔需要一些中文文字用于GUI开发时测试文本渲染,因此开发了这个废话生成器。但由于生成的废话实在是太过富于哲理,所以最近已经被小伙伴们给玩坏了。 他的文风可能是这样的: 你发现,
程序员:我终于知道post和get的区别
IT界知名的程序员曾说:对于那些月薪三万以下,自称IT工程师的码农们,其实我们从来没有把他们归为我们IT工程师的队伍。他们虽然总是以IT工程师自居,但只是他们一厢情愿罢了。 此话一出,不知激起了多少(码农)程序员的愤怒,却又无可奈何,于是码农问程序员。 码农:你知道get和post请求到底有什么区别? 程序员:你看这篇就知道了。 码农:你月薪三万了? 程序员:嗯。 码农:你是怎么做到的? 程序员:
"狗屁不通文章生成器"登顶GitHub热榜,分分钟写出万字形式主义大作
前言 GitHub 被誉为全球最大的同性交友网站,……,陪伴我们已经走过 10+ 年时间,它托管了大量的软件代码,同时也承载了程序员无尽的欢乐。 上周给大家分享了一篇10个让你笑的合不拢嘴的Github项目,而且还拿了7万+个Star哦,有兴趣的朋友,可以看看, 印象最深刻的是 “ 呼吸不止,码字不停 ”: 老实交代,你是不是经常准备写个技术博客,打开word后瞬间灵感便秘,码不出字? 有什么
推荐几款比较实用的工具,网站
1.盘百度PanDownload 这个云盘工具是免费的,可以进行资源搜索,提速(偶尔会抽风????) 不要去某站买付费的???? PanDownload下载地址 2.BeJSON 这是一款拥有各种在线工具的网站,推荐它的主要原因是网站简洁,功能齐全,广告相比其他广告好太多了 bejson网站 3.二维码美化 这个网站的二维码美化很好看,网站界面也很...
《程序人生》系列-这个程序员只用了20行代码就拿了冠军
你知道的越多,你不知道的越多 点赞再看,养成习惯GitHub上已经开源https://github.com/JavaFamily,有一线大厂面试点脑图,欢迎Star和完善 前言 这一期不算《吊打面试官》系列的,所有没前言我直接开始。 絮叨 本来应该是没有这期的,看过我上期的小伙伴应该是知道的嘛,双十一比较忙嘛,要值班又要去帮忙拍摄年会的视频素材,还得搞个程序员一天的Vlog,还要写BU
相关热词 c#处理浮点数 c# 生成字母数字随机数 c# 动态曲线 控件 c# oracle 开发 c#选择字体大小的控件 c# usb 批量传输 c#10进制转8进制 c#转base64 c# 科学计算 c#下拉列表获取串口
立即提问